Related papers: Schramm's formula for multiple loop-erased random …
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
A matrix random walk is a stochastic process of the form $B_k = (I+A_1)\cdots(I+A_k)$ where $A_j$ are independent ``step'' matrices in $\mathrm{M}_N(\mathbb{C})$. With the right entry-covariance, a rescaled matrix random walk converges to…
We consider a 2-dimensional model of random walk in random environment known as line model. The environment is described by two independent families of i.i.d. random variables dictating rates of jumps in vertical, respectively horizontal…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
We consider the average number B_m(t) of bonds traversed exactly m times by a t step simple random walk. We determine B_m(t) explicitly in the scaling limit t -> oo with m/sqrt(t) fixed in dimension d=1 and m/log(t) fixed in dimension d=2.…
Diffusing a graph signal at multiple scales requires computing the action of the exponential of several multiples of the Laplacian matrix. We tighten a bound on the approximation error of truncated Chebyshev polynomial approximations of the…
We consider the symmetric inclusion process on a general finite graph. Our main result establishes universal upper and lower bounds for the spectral gap of this interacting particle system in terms of the spectral gap of the random walk on…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…
The density conjecture for activated random walk on the interval was recently resolved using a new tool called layer percolation. As a step towards understanding how layer percolation extends to activated random walk on more complex graphs,…
We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both…
The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…
We analyze a random walk strategy on undirected regular networks involving power matrix functions of the type $L^{\frac{\alpha}{2}}$ where $L$ indicates a `simple' Laplacian matrix. We refer such walks to as `Fractional Random Walks' with…
We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…
In this work, we discuss the smoothly amnesia-reinforced multidimensional elephant random walk (MARW). The scaling limit of the MARW is shown to exist in the diffusive, critical and superdiffusive regimes. We also establish the almost sure…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
Conditions are provided under which an endomorphism on quasisymmetric functions gives rise to a left random walk on the descent algebra which is also a lumping of a left random walk on permutations. Spectral results are also obtained.…
The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…