Related papers: A random walk on the permutation group, some forma…
Discrete time random walks, in which a step of random sign but constant length $\delta x$ is performed after each time interval $\delta t$, are widely used models for stochastic processes. In the case of a correlated random walk, the next…
We prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group $G$. We introduce the switched random walk determined by a finite set of probability distributions on…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…
The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master…
Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of…
Permutations of correlated sequences of random variables appear naturally in a variety of applications such as graph matching and asynchronous communications. In this paper, the asymptotic statistical behavior of such permuted sequences is…
A variety of transport processes in natural and man-made systems are intrinsically random. To model their stochasticity, lattice random walks have been employed for a long time, mainly by considering Cartesian lattices. However, in many…
The 6-vertex model is a seminal model for many domains in Mathematics and Physics. The sets of configurations of the 6-vertex model can be described as the sets of paths in multigraphs. In this article the transition probability of the…
The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular…
By developing the entropy theory of random walks on equivalence relations and analyzing the asymptotic geometry of horospheric products we describe the Poisson boundary for random walks on random horospheric products of trees.
Using the results obtained by the non commutative geometry techniques applied to the Harper equation, we derive the areas distribution of random walks of length $ N $ on a two-dimensional square lattice for large $ N $, taking into account…
We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…
We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems…
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…
For any finitely generated group G, let n ---> \Phi_G(n) be the function that describes the rough asymptotic behavior of the probability of return to the identity element at time 2n of a symmetric simple random walk on G (this is an…
This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…
We introduce a model of a quantum walk on a graph in which a particle jumps between neighboring nodes and interacts with independent spins sitting on the edges. Entanglement propagates with the walker. We apply this model to the case of a…
We study the phase transition phenomena for long-range oriented percolation and contact process. We studied a contact process in which the range of each vertex are independent, updated dynamically and given by some distribution $N$. We also…
A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…