Related papers: Spectral Gap Inequality for Long-Range Random Walk…

Let $\{S_n\}$ be a random walk in the domain of attraction of a stable law $\mathcal{Y}$, i.e. there exists a sequence of positive real numbers $(a_n)$ such that $S_n/a_n$ converges in law to $\mathcal{Y}$. Our main result is that the…

Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…

We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…

This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…

We consider a recurrent random walk in random environment on a regular tree. Under suitable general assumptions upon the distribution of the environment, we show that the walk exhibits an unusual slow movement: the order of magnitude of the…

We consider biased random walk on regular tree and we obtain the spectral radius, first return probability and $n$-step transition probability.

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

The entropy, the spectral radius and the drift are important numerical quantities associated to random walks on countable groups. We prove sharp inequalities relating those quantities for walks with a finite second moment, improving upon…

We study the order statistics of a random walk (RW) of $n$ steps whose jumps are distributed according to symmetric Erlang densities $f_p(\eta)\sim |\eta|^p \,e^{-|\eta|}$, parametrized by a non-negative integer $p$. Our main focus is on…

In this paper we study the spectral gap of the path graph and illustrate an interesting effect which has been described recently in the continuous setting. More explicitly, in the large-volume limit and in the presence of a certain external…

We consider the limit behavior of a one-dimensional random walk with unit jumps whose transition probabilities are modified every time the walk hits zero. The invariance principle is proved in the scheme of series where the size of…

The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…

We develop techniques to obtain rigorous bounds on the behaviour of random walks on combs. Using these bounds we calculate exactly the spectral dimension of random combs with infinite teeth at random positions or teeth with random but…

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

We show that the spectral-gap of a general zero range process can be controlled in terms of the spectral-gap of a single particle. This is in the spirit of Aldous' famous spectral-gap conjecture for the interchange process. Our main…

In this paper we consider the Brownian motion with jump boundary and present a new proof of a recent result of Li, Leung and Rakesh concerning the exact convergence rate in the one-dimensional case. Our methods are different and mainly…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…

Let $G = (V,E)$ be a graph on $n$ vertices and let $m^*(G)$ denote the size of a maximum matching in $G$. We show that for any $\delta > 0$ and for any $1 \leq k \leq (1-\delta)m^*(G)$, the down-up walk on matchings of size $k$ in $G$ mixes…

We study the spectral norm of N-dimensional hermitian random matrices whose entries are zero outside of the band of the width b along the principal diagonal. Inside this band the elements are given by gaussian centered jointly independent…

We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…