Related papers: Local limit theorems for sequences of simple rando…
We show that the Bernoulli part extraction method can be used to obtain approximate forms of the local limit theorem for sums of independent lattice valued random variables, with effective error term, that is with explicit parameters and…
We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…
Schramm's Locality Conjecture asserts that the value of the critical percolation parameter $p_c$ of a graph satisfying $p_c<1$ depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive…
Small-world networks, known for high local clustering and short path lengths, are a fundamental structure in many real-world systems, including social, biological, and technological networks. We apply the theory of (marked) local…
We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…
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…
The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…
Extending a previous result of the first two authors, we prove a local limit theorem for the joint distribution of subgraph counts in the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$. This limit can be described as a nonlinear transformation…
We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…
We define the local empirical process, based on $n$ i.i.d. random vectors in dimension $d$, in the neighborhood of the boundary of a fixed set. Under natural conditions on the shrinking neighborhood, we show that, for these local empirical…
We study part sizes of supercritical locally restricted sequential structures. This extends previous results about locally restricted integer compositions and part sizes in smooth supercritical compositional structures. Applications are…
We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both…
We provide an explicit algorithm for sampling a uniform simple connected random graph with a given degree sequence. By products of this central result include: (i) continuum scaling limits of uniform simple connected graphs with given…
In this article, we study the pointwise asymptotic behavior of iterated convolutions on the one dimensional lattice Z. We generalize the so-called local limit theorem in probability theory to complex valued sequences. A sharp rate of…
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…
There are few known exponential speedups for quantum algorithms and these tend to fall into even fewer families. One speedup that has mostly resisted generalization is the use of quantum walks to traverse the welded-tree graph, due to…
We establish a quenched local central limit theorem for the dynamic random conductance model on $\mathbb{Z}^d$ only assuming ergodicity with respect to space-time shifts and a moment condition. As a key analytic ingredient we show H\"older…
When averages over all starting points are considered, the Type Problem for the recurrence or transience of a simple random walk on an inhomogeneous network in general differs from the usual "local" Type Problem. This difference leads to a…
Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…
Completing a strategy of Gou\"ezel and Lalley, we prove a local limit theorem for the random walk generated by any symmetric finitely supported probability measure on a non-elementary Gromov-hyperbolic group: denoting by $R$ the inverse of…