Random walks on generating sets for finite groups.

Chung, F.R.K.; Graham, R.L.

Displaying similar documents to “Random walks on generating sets for finite groups.”

Bounding a random environment bounding a random environment for two-dimensional edge-reinforced random walk.

Merkl, Franz, Rolles, Silke W.W. (2008)

Electronic Journal of Probability [electronic only]

Similarity:

Random walks on finite groups with few random generators.

Pak, Igor (1999)

Electronic Journal of Probability [electronic only]

Similarity:

Limiting behavior for the distance of a random walk.

Berestycki, Nathanael, Durrett, Rick (2008)

Electronic Journal of Probability [electronic only]

Similarity:

Entrywise bounds for eigenvectors of random graphs.

Mitra, Pradipta (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Compositions of random functions on a finite set.

Dalal, Avinash, Schmutz, Eric (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Beurling estimate for a class of random walks.

Lawler, Gregory F., Limic, Vlada (2004)

Electronic Journal of Probability [electronic only]

Similarity:

A note on the invariance principle of the product of sums of random variables.

Huang, Wei, Zhang, Li-Xin (2007)

Electronic Communications in Probability [electronic only]

Similarity:

Large deviations for independent random variables – Application to Erdös-Renyi’s functional law of large numbers

Jamal Najim (2005)

ESAIM: Probability and Statistics

Similarity:

A Large Deviation Principle (LDP) is proved for the family $\frac{1}{n} \sum_{1}^{n} 𝐟 (x_{i}^{n}) \cdot Z_{i}^{n}$ where the deterministic probability measure $\frac{1}{n} \sum_{1}^{n} δ_{x_{i}^{n}}$ converges weakly to a probability measure $R$ and ${(Z_{i}^{n})}_{i \in ℕ}$ are $ℝ^{d}$ -valued independent random variables whose distribution depends on $x_{i}^{n}$ and satisfies the following exponential moments condition: $sup_{i, n} 𝔼 e^{α^{*} | Z_{i}^{n} |} < + \infty forsome 0 < α^{*} < + \infty .$ In this context, the identification of the rate function is non-trivial due to the absence of equidistribution. We rely on fine convex analysis to address this issue. Among...

The cover time of deterministic random walks.

Friedrich, Tobias, Sauerwald, Thomas (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree.

Iksanov, Alex, Möhle, Martin (2007)

Electronic Communications in Probability [electronic only]

Similarity:

Loose Hamilton cycles in random uniform hypergraphs.

Dudek, Andrzej, Frieze, Alan (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Logarithmic components of the vacant set for random walk on a discrete torus.

Windisch, David (2008)

Electronic Journal of Probability [electronic only]

Similarity: