相关论文: Mixing Time of Random Walk on Poisson Geometry Sma…

We consider dynamical percolation on the $d$-dimensional discrete torus of side length $n$, $\mathbb{Z}_n^d$, where each edge refreshes its status at rate $\mu=\mu_n\le 1/2$ to be open with probability $p$. We study random walk on the…

It is well known that adding "long edges (shortcuts)" to a regularly constructed graph will make the resulted model a small world. Recently, \cite{W} indicated that, among all long edges, those edges with length proportional to the diameter…

In this paper we study the mixing time of the simple random walk on the giant component of supercritical $d$-dimensional random geometric graphs generated by the unit intensity Poisson Point Process in a $d$-dimensional cube of volume $n$.…

We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an edge if their distance is at most r. We consider the case of…

In this paper we present a study of the mixing time of a random walk on the largest component of a supercritical random graph, also known as the giant component. We identify local obstructions that slow down the random walk, when the…

We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate \mu\ while at the same time a random walker moves on G at rate 1 but only along…

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…

A small world is obtained from the $d$-dimensional torus of size 2L adding randomly chosen connections between sites, in a way such that each site has exactly one random neighbour in addition to its deterministic neighbours. We study the…

We study the mixing time of a random walker who moves inside a dynamical random cluster model on the d-dimensional torus of side-length n. In this model, edges switch at rate \mu between open and closed, following a Glauber dynamics for the…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

Consider the subgraph of the discrete $d$-dimensional torus of size length $N$, $d\ge3$, induced by the range of the simple random walk on the torus run until the time $uN^d$. We prove that for all $d\ge 3$ and $u>0$, the mixing time for…

Assign to each vertex of the one-dimensional torus i.i.d. weights with a heavy-tail of index $\tau-1>0$. Connect then each couple of vertices with probability roughly proportional to the product of their weights and that decays polynomially…

"Small worlds" are large systems in which any given node has only a few connections to other points, but possessing the property that all pairs of points are connected by a short path, typically logarithmic in the number of nodes. The use…

We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…

Random tessellations of the space represent a class of prototype models of heterogeneous media, which are central in several applications in physics, engineering and life sciences. In this work, we investigate the statistical properties of…

We study the robustness under perturbations of mixing times, by studying mixing times of random walks in percolation clusters inside boxes in $\Z^d$. We show that for $d \geq 2$ and $p > p_c(\Z^d)$, the mixing time of simple random walk on…

For $d\ge 3$ we construct a new coupling of the trace left by a random walk on a large $d$-dimensional discrete torus with the random interlacements on $\mathbb Z^d$. This coupling has the advantage of working up to macroscopic subsets of…

We study the mixing time of a random walk on the torus, alternated with a Lebesgue measure preserving Bernoulli map. Without the Bernoulli map, the mixing time of the random walk alone is $O(1/\epsilon^2)$, where $\epsilon$ is the step…