Related papers: Transience, Recurrence and Critical Behavior for L…

Let $G=(V,E)$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. In recent work, we conjectured that if $G$ is nonamenable then the matrix of critical connection probabilities…

In this paper, we are interested in the loop cluster model on $\mathbb{Z}^d$ for $d\geq 3$. It is a long range model with two parameters $\alpha$ and $\kappa$, where the non-negative parameter $\alpha$ measures the amount of loops, and…

We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary…

We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $\beta$. We prove…

We prove the almost sure ('quenched') invariance principle for a random walker on an infinite Bernoulli percolation cluster in $\Z^d$ where $d$ is larger or equal than 2.

The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase…

Consider percolation on $T\times \mathbb{Z}^d$, the product of a regular tree of degree $k\geq 3$ with the hypercubic lattice $\mathbb{Z}^d$. It is known that this graph has $0<p_c<p_u<1$, so that there are non-trivial regimes in which…

Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…

This paper concerns the long-term behaviour of a system of interacting random walks labeled by vertices of a finite graph. The model is reversible which allows to use the method of electric networks in the study. In addition, examples of…

Given any $\gamma>0$ and for $\eta=\{\eta_v\}_{v\in \mathbb Z^2}$ denoting a sample of the two-dimensional discrete Gaussian free field on $\mathbb Z^2$ pinned at the origin, we consider the random walk on~$\mathbb Z^2$ among random…

The $k$-core percolation is a fundamental structural transition in complex networks. Through the analysis of the size jump behaviors of $k$-core in the evolution process of networks, we confirm that $k$-core percolation is continuous phase…

We study percolation on the sites of a finite lattice visited by a generalized random walk of finite length with periodic boundary conditions. More precisely, consider Levy flights and walks with finite jumps of length $>1$ (like knight's…

We study the transport properties of directed percolation clusters at the upper critical dimension $d_{c} = 4+1$, where critical fluctuations induce logarithmic corrections to the leading (mean-field) scaling behavior. Employing field…

We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For $d=2$ they clearly…

We consider the Random Walk Pinning Model studied in [3,2]: this is a random walk X on Z^d, whose law is modified by the exponential of \beta times L_N(X,Y), the collision local time up to time N with the (quenched) trajectory Y of another…

We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…

We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z^2 by removing all horizontal edges off the X-axis,…

We study the scaling laws of diffusion in two-dimensional media with long-range correlated disorder through exact enumeration of random walks. The disordered medium is modelled by percolation clusters with correlations decaying with the…

The eigenvalue spectra of the transition probability matrix for random walks traversing critically disordered clusters in three different types of percolation problems show that the random walker sees a developing Euclidean signature for…