Related papers: Infinite cycles in the interchange process in five…
We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lov\'{a}sz from 1969 and Thomassen from 1978, respectively, states that all connected vertex-transitive graphs…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…
A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider $d$ many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-)…
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding 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 $d$ random walks $\big(S_n^{(j)}\big)_{n\in\mathbb{N}}$, $1\leq j \leq d$, in the same random environment $\omega$ in $\mathbb{Z}$, and a recurrent simple random walk $(Z_n)_{n\in\mathbb{N}}$ on $\mathbb{Z}$. We assume that,…
We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…
Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…
Nonintersecting motion of Brownian particles in one dimension is studied. The system is constructed as the diffusion scaling limit of Fisher's vicious random walk. N particles start from the origin at time t=0 and then undergo mutually…
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…
We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…
We study the asymptotic behavior for large $N$ of the disconnection time $T_N$ of a simple random walk on the discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}$, when $d\ge2$. We explore its connection with the model of random…
We study several fundamental properties of a class of stochastic processes called spatial Lambda-coalescents. In these models, a number of particles perform independent random walks on some underlying graph G. In addition, particles on the…
On a transient weighted graph, there are two models of random walk which continue after reaching infinity: random interlacements, and random walk reflected off of infinity, recently introduced in arXiv:2506.18827 [math.PR]. We prove these…
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…
The thermal ratchets model toggles a spatially periodic asymmetric potential to rectify random walks and achieve transport of diffusing particles. We numerically solve the governing equation for the full dynamics of an infinite 1D ratchet…