相关论文: The looping rate and sandpile density of planar gr…
We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…
Exact results are obtained for random walks on finite lattice tubes with a single source and absorbing lattice sites at the ends. Explicit formulae are derived for the absorption probabilities at the ends and for the expectations that a…
We show that the dissipative Abelian sandpile on a graph L can be related to a random walk on a graph which consists of L extended with a trapping site. From this relation it can be shown, using exact results and a scaling assumption, that…
We prove a sharp estimate on the expected value of the integral of the index of a simple random walk on the square or triangular lattice. This gives new lower bounds on the averaged Dehn function, which measures the expected area needed to…
Single site height probabilities in the Abelian sandpile model, and the corresponding mean height $<h>$, are directly related to the probability $P_{\rm ret}$ that a loop erased random walk passes through a nearest neighbour of the starting…
We consider the abelian sandpile model and the uniform spanning unicycle on random planar maps. We show that the sandpile density converges to 5/2 as the maps get large. For the spanning unicycle, we show that the length and area of the…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
We study the distribution of sizes of erased loops for loop-erased random walks on regular and fractal lattices. We show that for arbitrary graphs the probability $P(l)$ of generating a loop of perimeter $l$ is expressible in terms of the…
We study the range of a planar random walk on a randomly oriented lattice, already known to be transient. We prove that the expectation of the range grows linearly, in both the quenched (for a.e. orientation) and annealed ("averaged")…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
We study the dynamics of the Stochastic Sandpile Model on finite graphs, with two main results. First, we describe a procedure to exactly sample from the stationary distribution of the model in all connected finite graphs, extending a…
We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…
This paper discusses possible approaches to the escape rate in infinite lattices of weakly coupled maps with uniformly expanding repeller. It is proved that computed-via-volume rates of spatially periodic approximations grow linearly with…
We analyse the numbers of closed paths of length $k\in\mathbb{N}$ on two important regular lattices: the hexagonal lattice (also called $\textit{graphene}$ in chemistry) and its dual triangular lattice. These numbers form a moment sequence…
The Martin boundary associated with the simple random walk on an example of partially oriented lattice is shown to be trivial by computing fine estimates of the Green kernel.