相关论文: Quantitative Russo-Seymour-Welsh for random walk o…

We prove a general Russo-Seymour-Welsh result valid for any invariant planar percolation process satisfying positive association. This means that the probability of crossing a rectangle in the long direction is related by a homeomorphism to…

We study the percolation properties of the nodal structures of random fields. Lower bounds on crossing probabilities (RSW-type estimates) of quads by nodal domains or nodal sets of Gaussian ensembles of smooth random functions are…

In this article, we prove a lower bound for the fluctuations of symmetric random walks on dynamic random environments in dimension $1 + 1$ in the perturbative regime where the walker is weakly influenced by the environment. We suppose that…

We prove that the standard Russo-Seymour-Welsh theory is valid for Voronoi percolation. This implies that at criticality the crossing probabilities for rectangles are bounded by constants depending only on their aspect ratio. This result…

Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on $\mathbb{Z}^2$ is $\mathrm{SLE}_2$. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

We consider the dimer model on the square and hexagonal lattices with doubly periodic weights. The purpose of this paper is threefold: (a) we establish a rigourous connection with the massive SLE$_2$ constructed by Makarov and Smirnov (and…

The Russo-Seymour-Welsh Theorem for Z^2 bond or T (triangular lattice) site percolation states that at criticality, for all fixed real {\lambda}, the probability of the existence of a horizontal occupied crossing of each rectangle with size…

Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…

The uniform spanning tree (UST) and the loop-erased random walk (LERW) are related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the mesh goes to zero. Although the existence of scaling…

We study simple random walk on the class of random planar maps which can be encoded by a two-dimensional random walk with i.i.d. increments or a two-dimensional Brownian motion via a "mating-of-trees" type bijection. This class includes the…

We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in $\Z^d$ with $d\ge2$. We prove that, for almost every percolation configuration, the path distribution of the walk converges weakly to…

We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration in the form of…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

We study the scaling limit of planar loop erased random walk (LERW) on the percolation cluster, with occupation probability $p\geq p_c$. We numerically demonstrate that the scaling limit of planar LERW$_p$ curves, for all $p>p_c$, can be…

We generalize a result from Volkov [Ann. Probab. 29 (2001) 66--91] and prove that, on a large class of locally finite connected graphs of bounded degree $(G,\sim)$ and symmetric reinforcement matrices $a=(a_{i,j})_{i,j\in G}$, the…

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…

We consider critical oriented Bernoulli percolation on the square lattice $\mathbb{Z}^2$. We prove a Russo-Seymour-Welsh type result which allows us to derive several new results concerning the critical behavior: - We establish that the…

We show that the scaling limit of the random walk loop soup on suitable planar graphs is the Brownian loop soup, under a topology on multisets of unrooted, unparameterized, and macroscopic loops. The result holds assuming only convergence…