Related papers: Statistics of Largest Loops in a Random Walk

Let $G$ be a real Lie group, $\Lambda\leq G$ a lattice, and $\Omega=G/\Lambda$. We study the equidistribution properties of the left random walk on $\Omega$ induced by a probability measure $\mu$ on $G$. It is assumed that $\mu$ has a…

We present a probabilistic approach to the core-size in random maps, which yields straightforward and singularity analysis-free proofs of some results of Banderier, Flajolet, Schaeffer and Soria. The proof also yields convergence in…

In this paper we study the asymptotic behavior of the Random-Walk Metropolis algorithm on probability densities with two different `scales', where most of the probability mass is distributed along certain key directions with the…

Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…

We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…

We consider the phase transition in the system of n simultaneously developing random walks on the halfline x>=0. All walks are independent on each others in all points except the origin x=0, where the point well is located. The well depth…

The deviation principles of record numbers in random walk models have not been completely investigated, especially for the non-nearest neighbor cases. In this paper, we derive the asymptotic probabilities of large and moderate deviations…

We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…

We study the random walk $X$ on the range of a simple random walk on $\mathbb{Z}^d$ in dimensions $d\geq 4$. When $d\geq 5$ we establish quenched and annealed scaling limits for the process $X$, which show that the intersections of the…

We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…

We present continuum models that describe the evolution of the position of a random walker on a growing network using four different growth algorithms. Three of these involve a random element, including one in which the motility rate of the…

We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…

We show that random walk in uniformly elliptic i.i.d. environment in dimension $\geq5$ has at most one non zero limiting velocity. In particular this proves a law of large numbers in the distributionally symmetric case and establishes…

In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…

We study the annihilating random walk with long-range interaction in one dimension. Each particle performs random walks on a one-dimensional ring in such a way that the probability of hopping toward the nearest particle is $W= [1 - \epsilon…

In this article, we consider several models of random walks in one or several dimensions, additionally allowing, at any unit of time, a reset (or "catastrophe") of the walk with probability $q$. We establish the distribution of the final…

Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…

We study the probability distribution function $P(\lambda)$ of the largest eigenvalue $\lambda_{\rm max}$ of $N \times N$ random matrices of the form $H + V$, where $H$ belongs to the GOE/GUE ensemble and $V$ is a full rank deterministic…

We present an algorithmic approach to estimate the value distributions of random variables of probabilistic loops whose statistical moments are (partially) known. Based on these moments, we apply two statistical methods, Maximum Entropy and…

We consider a discrete time quantum walker in one dimension, where at each step, the step length $\ell$ is chosen from a distribution $P(\ell) \propto \ell^{-\delta -1}$ with $\ell \leq \ell_{max}$. We evaluate the probability $f(x,t)$ that…