Related papers: Hipster random walks, random series-parallel graph…

We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…

We prove distributional convergence for a family of random processes on $\mathbb{Z}$, which we call asymmetric cooperative motions. The model generalizes the "totally asymmetric hipster random walk" introduced in [Addario-Berry, Cairns,…

We prove effective density of random walks on homogeneous spaces, assuming that the underlying measure is supported on matrices generating a dense subgroup and having algebraic entries. The main novelty is an argument passing from high…

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

We prove expectation and concentration results for the following random variables on an Erd\H{o}s-R\'enyi random graph $\mathcal{G}\left(n,p\right)$ in the sparsely connected regime $\log n + \log\log \log n \leq np < n^{1/10}$: effective…

The random walk with hyperbolic probabilities that we are introducing is an example of stochastic diffusion in a one-dimensional heterogeneous media. Although driven by site-dependent one-step transition probabilities, the process retains…

This paper enhances the result of the work [G. Kozma, B. T\'oth, Ann. Probab. vol. 45 (2017) 4307-4347] . We prove the central limit theorem (in probability w.r.t. the environment) for the displacement of a random walker in divergence-free…

We study conditions under which a given hypergraph is randomly robust Hamiltonian, which means that a random sparsification of the host graph contains a Hamilton cycle with high probability. Our main contribution provides nearly optimal…

We study the asymptotic distribution of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible environments defined by an assignment of a positive conductance to each edge of $\mathbb Z^d$. We identify a deterministic set of…

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 emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum $d$-degree threshold for loose Hamiltonicity relative to the random $k$-uniform hypergraph $H_k(n,p)$ coincides with…

We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling, coined repelling random walks. By inducing correlations between the trajectories of an interacting ensemble such that their marginal transition probabilities…

We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…

Recent progress on the understanding of the Random Conductance Model is reviewed. A particular emphasis is on homogenization results such as functional central limit theorems, local limit theorems and heat kernel estimates for almost every…

Fix a graph $H$ and some $p\in (0,1)$, and let $X_H$ be the number of copies of $H$ in a random graph $G(n,p)$. Random variables of this form have been intensively studied since the foundational work of Erd\H{o}s and R\'{e}nyi. There has…

The cover-time problem, i.e., time to visit every site in a system, is one of the key issues of random walks with wide applications in natural, social, and engineered systems. Addressing the full distribution of cover times for random walk…

We consider one-dimensional discrete-time random walks (RWs) in the presence of finite size traps of length $\ell$ over which the RWs can jump. We study the survival probability of such RWs when the traps are periodically distributed and…

We propose a general framework for quantum walks on d-dimensional spaces. We investigate asymptotic behavior of these walks. Among them, existence of limit distribution of homogeneous walks is proved. In this theorem, the support of the…

Strong ratio limit theorems associated with a broad class of spread out random walks on unimodular groups were proved in the preceding paper, where these random walks were assumed to have the convergence parameter $R=1$. In the present…

In a recent letter [PRL 80 (1998) 3539] Fisher, Le Doussal and Monthus report new predictions for the persistence properties of Sinai's model, which they obtain by using an approximate real space renormalization group scheme. In this…