317 problems
Let . Suppose has finite support . If is uniformly distributed on , and if every is on the boundary of…
Let ) be a connected -regular graph with adjacency matrix and vertices. Let be orthogonal eigenvectors of , with the conditions stated b…
For Bernoulli bond percolation on , let . Then, for every integer ,…
Let be the once-centrally-excited random walk on , with , in which the first visit to a site has a bias of strength toward the orig…
Let be a centrally excited random walk on , , which otherwise moves as simple random walk, and let . Kozma conjec…
Let denote the scaling-limit law of three-dimensional loop-erased random walk, viewed as a random simple path or compact set under the standard spatial rescal…
Consider the parking process on in which each site initially contains a car with probability and a parking spot with probability , independently, and cars p…
This entry tracks Lyons–Pemantle–Peres monotonicity conjecture. It proves a substantial high-offspring regime of the random-walk conjecture. Latest development The conjectured mono…
Let each site of be assigned an independent uniformly random initial direction among its four outgoing directions. Starting at the origin, the Eulerian walker turns…
Let a Galton–Watson tree be supercritical and condition it on survival. Consider the simple exclusion process on this tree in the constant speed model and in the variable speed mod…
Let be a discrete subgroup, and let the random walk on have finite support. Its hitting measure is a measure on the boundary at infinity…
Let be a connected regular graph on vertices, and let denote the relaxation time of its random walk, defined by … where is the second-largest eigenvalue of…
A high-dimensional random walk on a discrete point process is a random walk on such a point process in sufficiently large dimension. Failure conjecture. There are random walks on d…
A two-dimensional random walk on a discrete point process is a random walk in dimension whose state space is a discrete point process. Existence conjecture. There are transient…
Let be a finite graph with vertex set . For a starting vertex , write for expectation for the simple random walk started at , and let the…
Let be a virtually- group and let be a nontrivial finite group. Let be the critical parameter such that the -stationary random walk on…
Singularity conjecture. If has finite support, then the -stationary measure is singular to the Lebesgue measure class on …
Let be a group, let satisfy and , and let be the Cayley graph of generated by independently and uniformly chos…
Let and be finite graphs that are -roughly isometric, and suppose both have maximal degree at most . Denote by and the…
Drift conjecture. The drift function satisfies
Fix . Let be the spatial dimension, let be the diffusion constant of the catalyst, and let denote the critical values governing…
Let be a symmetric random walk on with step distribution satisfying … for some , and let denote the diameter of the aggregate after particles…
Tightness conjecture. The highest points of sufficiently long positive arches, and the lowest points of sufficiently long negative arches, are tight to the Brownian limit.
Let the Laplacian operator be the operator defined by the jump conditions in --, and let denote the function in Theorem. Uniqueness conjecture. The unique, up to multiplicati…
Let particles evolve according to the Attracting Random Walks (ARW) model on an arbitrary graph, with interaction parameter . The mixing time is measured with respect…