Related papers: Diffusive estimates for random walks on stationary…
In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is at variance with respect to the simple symmetric random walk…
We prove that the simple random walk on the uniform infinite planar triangulation (UIPT) typically travels graph distance at most $n^{1/4 + o_n(1)}$ in $n$ units of time. Together with the complementary lower bound proven by Gwynne and…
We consider random walks in a random environment of the type p_0+\gamma\xi_z, where p_0 denotes the transition probabilities of a stationary random walk on \BbbZ^d, to nearest neighbors, and \xi_z is an i.i.d. random perturbation. We give…
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is a stationary and ergodic process. In general, the stationary…
The Rado graph, also known as the random graph $G(\infty, p)$, is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at $i$, we show that order…
A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…
We prove tight mixing time bounds for natural random walks on bases of matroids, determinantal distributions, and more generally distributions associated with log-concave polynomials. For a matroid of rank $k$ on a ground set of $n$…
We consider several families of long jump random walks on groups of polynomial volume growth which are naturally expected to have a stable-like behavior. We then prove optimal pseudo-Poincar\'e inequalities for these walks. These…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…
Given an integer $n$, let $G(n)$ be the number of integer sequences $n-1\ge d_1\ge d_2\ge\dotsb\ge d_n\ge 0$ that are the degree sequence of some graph. We show that $G(n)=(c+o(1))4^n/n^{3/4}$ for some constant $c>0$, improving both the…
We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…
Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let $0<p<1$ be constant and let $G\sim G_{n,p}$. Let $odd(G)$ be the…
We consider diffusivity of random walks with transition probabilities depending on the number of consecutive traversals of the last traversed edge, the so called senile reinforced random walk (SeRW). In one dimension, the walk is known to…
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…
Given independent random points $X_1,...,X_n\in\eR^d$ with common probability distribution $\nu$, and a positive distance $r=r(n)>0$, we construct a random geometric graph $G_n$ with vertex set $\{1,...,n\}$ where distinct $i$ and $j$ are…
We investigate the statistics of the gap, G_n, between the two rightmost positions of a Markovian one-dimensional random walker (RW) after n time steps and of the duration, L_n, which separates the occurrence of these two extremal…
Random walks on bounded degree expander graphs have numerous applications, both in theoretical and practical computational problems. A key property of these walks is that they converge rapidly to their stationary distribution. In this work…
Given suitable functions $V, \Psi:[0,\infty) \to [0,\infty)$, we obtain necessary and sufficient conditions on $V,\Psi$ for the existence of a metric measure space and a symmetric diffusion process that satisfies sub-Gaussian heat kernel…
How many $n$-step polygons exist that contain a given vertex of an infinite quasi-transitive graph $G$? The exponential growth rate of such polygons is identified as the connective constant when $G$ has sub-exponential growth and possesses…