Related papers: Recurrence of planar graph limits

We find explicit formulas for the probabilities of general boundary visit events for planar loop-erased random walks, as well as connectivity events for branches in the uniform spanning tree. We show that both probabilities, when suitably…

Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…

We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…

We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup $H$. We further assume…

We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

In this paper, we provide an application to the random distance-$t$ walk in finite planes and derive asymptotic formulas (as $q \to \infty$) for the probability of return to start point after $\ell$ steps based on the "vertical"…

We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…

We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Z^d, and planar graphs with locally finite embeddings. We also prove that recurrence and transience of rotor walks are invariant under…

This paper concerns random bipartite planar maps which are defined by assigning weights to their faces. The paper presents a threefold contribution to the theory. Firstly, we prove the existence of the local limit for all choices of weights…

We prove that the trace of a transient branching random walk on a planar hyperbolic Cayley graph has a.s. continuum many ends and no isolated end.

We show that for a uniformly irreducible random walk on a graph, with bounded range, there is a Floyd function for which the random walk converges to its corresponding Floyd boundary. Moreover if we add the assumptions, $p^{(n)}(v,w)\leq C…

In a \emph{rotor walk} the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in $\R^d$, we show that any simple rotor walk, regardless of rotor mechanism or initial rotor…

Consider the uniform random graph $G(n,M)$ with $n$ vertices and $M$ edges. Erd\H{o}s and R\'enyi (1960) conjectured that the limit $$ \lim_{n \to \infty} \Pr\{G(n,\textstyle{n\over 2}) is planar}} $$ exists and is a constant strictly…

The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…

We study the locality of critical percolation on finite graphs: let $G_n$ be a sequence of finite graphs, converging locally weakly to a (random, rooted) infinite graph $G$. Consider Bernoulli edge percolation: does the critical probability…

We study random graphs with an i.i.d. degree sequence of which the tail of the distribution function $F$ is regularly varying with exponent $\tau\in (1,2)$. Thus, the degrees have infinite mean. Such random graphs can serve as models for…

First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

It is shown that oriented random walk on the Heisenberg group admits exponential intersection tail. As a corollary we get that on any transitive graph of polynomial volume growth, which is not a finite extension of $\mathbb{Z},…