Related papers: Nonconcentration of return times

We study the edge-averaging process on a finite, connected graph $G = (V, E)$. Initially, the vertices in $V$ are endowed with i.i.d.\ real-valued opinions $(f_0(v))_{v \in V}$. Edges are activated according to i.i.d.\ Poisson clocks of…

Let $G(N,p)=(V,E)$ be an Erd\"os-R\'enyi random graph and $(X_n)_{n \in \mathbb{N}}$ be a simple random walk on it. We study the the order of magnitude of $\sum_{i \in V} \pi_ih_{ij} $ where $\pi_i=d_i / 2|E|$ for $d_i$ the number of…

A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$. A toll interval between…

We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…

In the proof of the invariance principle for locally perturbed periodic Lorentz process with finite horizon, a lot of delicate results were needed concerning the recurrence properties of its unperturbed version. These were analogous to the…

The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…

We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph…

Following the recent work of Sznitman (arXiv:0805.4516), we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form G_N x Z, where G_N is a large finite connected weighted graph, and relate it to…

We study the exact asymptotics for the distribution of the first time $\tau_x$ a L\'evy process $X_t$ crosses a negative level $-x$. We prove that $\mathbf P(\tau_x>t)\sim V(x)\mathbf P(X_t\ge 0)/t$ as $t\to\infty$ for a certain function…

We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…

We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…

The jump graph $J(G)$ of a simple graph $G$ has vertices which represent edges in $G$ where two vertices in $J(G)$ are adjacent if and only if the corresponding edges in $G$ do not share an endpoint. In this paper, we examine sequences of…

We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\log n$, where $h$ is a…

We present analytical results for the joint probability distribution $P(T_{FR}=t,S=s)$ of first return (FR) times t and of the number of distinct sites s visited by a random walk (RW) on a one dimensional lattice before returning to the…

Given a discrete source distribution $\mu$ and discrete target distribution $\nu$ on a common finite state space $\mathcal{X}$, we are tasked with transporting $\mu$ to $\nu$ using a given discrete-time Markov chain $X$ with the quickest…

This paper is organized in three parts closely related to closure properties of heavy-tailed distributions and heavy-tailed random vectors. In the first part we consider two random variables X and Y with distributions F and G respectively.…

We provide an explicit formula for the global mean first-passage time (GMFPT) for random walks in a general graph with a perfect trap fixed at an arbitrary node, where GMFPT is the average of mean first-passage time to the trap over all…

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

In this paper, we consider a homogeneous Markov process \xi(t;\omega) on an ultrametric space Q_p, with distribution density f(x,t), x in Q_p, t in R_+, satisfying the ultrametric diffusion equation df(x,t)/dt =-Df(x,t). We construct and…