Related papers: Monotonicity for continuous-time random walks

In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…

We study the two-player communication problem of determining whether two vertices $x, y$ are nearby in a graph $G$, with the goal of determining the graph structures that allow the problem to be solved with a constant-cost randomized…

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…

We show that on a Cayley graph of a nonamenable group, almost surely the infinite clusters of Bernoulli percolation are transient for simple random walk, that simple random walk on these clusters has positive speed, and that these clusters…

It is known that a random walk on $\Z^d$ among i.i.d. uniformly elliptic random bond conductances verifies a central limit theorem. It is also known that approximations of the covariance matrix can be obtained by considering periodic…

In this article we consider a natural class of random walks on free products of graphs, which arise as convex combinations of random walks on the single factors. From the works of Gilch [6,7] it is well-known that for these random walks the…

In 1993 van den Berg and Kesten proved a strict monotonicity theorem for first passage percolation on $\mathbb{Z}^d$, $d \ge 2$: given two probability measures $\nu$ and $\tilde{\nu}$ with finite mean, if $\tilde{\nu}$ is strictly more…

In this paper, we study random walks evolving on Z in a dynamic random environment that we assume to have time correlations that decrease polynomially fast. We show a law of large numbers by generalizing methods already used for the…

We extend a result of Lyons (2016) from fractional tiling of finite graphs to a version for infinite random graphs. The most general result is as follows. Let $\bf P$ be a unimodular probability measure on rooted networks $(G, o)$ with…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

We prove that the quantum relative entropy decreases monotonically under the application of any positive trace-preserving linear map, for underlying separable Hilbert spaces. This answers in the affirmative a natural question that has been…

We study continuous time quantum walk on a random comb graph with infinite teeth. Due to localization effects along the spine, the walk cannot go to infinity in the spine direction, while it can escape to infinity along the teeth of the…

For a continuous-time random walk $X=\{X_t,t\ge 0\}$ (in general non-Markov), we study the asymptotic behavior, as $t\rightarrow \infty$, of the normalized additive functional $c_t\int_0^{t} f(X_s)ds$, $t\ge 0$. Similarly to the Markov…

Convergence rate analyses of random walk Metropolis-Hastings Markov chains on general state spaces have largely focused on establishing sufficient conditions for geometric ergodicity or on analysis of mixing times. Geometric ergodicity is a…

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…

In this paper we study convergence of random walks, on finite quantum groups, arising from linear combination of irreducible characters. We bound the distance to the Haar state and determine the asymptotic behavior, i.e. the limit state if…