Related papers: The continuous-time lace expansion
The aim of this survey is to explain, in a self-contained and relatively beginner-friendly manner, the lace expansion for the nearest-neighbor models of self-avoiding walk and percolation that converges in all dimensions above 6 and 9,…
We consider a class of strongly edge-reinforced random walks, where the corresponding reinforcement weight function is nondecreasing. It is known, from Limic and Tarr\`{e}s [Ann. Probab. (2007), to appear], that the attracting edge emerges…
Consider the long-range models on $\mathbb{Z}^d$ of random walk, self-avoiding walk, percolation and the Ising model, whose translation-invariant 1-step distribution/coupling coefficient decays as $|x|^{-d-\alpha}$ for some $\alpha>0$. In…
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
In this article, we study a class of lattice random variables in the domain of attraction of an $\alpha$-stable random variable with index $\alpha \in (0,2)$ which satisfy a truncated fractional Edgeworth expansion. Our results include…
We present a new proof of $|x|^{-(d-2)}$ decay of critical two-point functions for spread-out statistical mechanical models on $\mathbb{Z}^d$ above the upper critical dimension, based on the lace expansion and assuming appropriate…
We develop a diagrammatic approach for calculating the high temperature expansion of dynamic correlation functions, such as the electron Green's function and the time-dependent density-density and spin-spin correlation functions, for the…
Consider a branching random walk on $\mathbb Z$ in discrete time. Denote by $L_n(k)$ the number of particles at site $k\in\mathbb Z$ at time $n\in\mathbb N_0$. By the profile of the branching random walk (at time $n$) we mean the function…
We prove that the susceptibility of the continuous-time weakly self-avoiding walk on $\mathbb{Z}^d$, in the critical dimension $d=4$, has a logarithmic correction to mean-field scaling behaviour as the critical point is approached, with…
We study the local (in time) expansion of a continuous-time process and its conditional moments, including the process' characteristic function. The expansions are conducted by using the properties of the (time-extended) Ito signature, a…
We first study a model, introduced recently in \cite{ES}, of a critical branching random walk in an IID random environment on the $d$-dimensional integer lattice. The walker performs critical (0-2) branching at a lattice point if and only…
Active walker models have proved to be extremely effective in understanding the evolution of a large class of systems in biology like ant trail formation and pedestrian trails. We propose a simple model of a random walker which modifies its…
We study an asymptotic expansion of the critical point for the nearest-neighbor oriented percolation on $\mathbb Z^d$ in powers of $d^{-1}$ as $d\rightarrow \infty$. The proof relies heavily on the lace expansion.
We consider a continuous-time random walk which is the generalization, by means of the introduction of waiting periods on sites, of the one-dimensional nonhomogeneous random walk with a position-dependent drift known in the mathematical…
We discuss sufficient conditions that guarantee the existence of asymptotic expansions for the Central Limit Theorem for weakly dependent random variables including observations arising from sufficiently chaotic dynamical systems like…
We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at…
The lace expansion is a powerful perturbative technique to analyze the critical behavior of random spatial processes such as the self-avoiding walk, percolation and lattice trees and animals. The non-backtracking lace expansion (NoBLE) is a…
The strong-coupling character expansion of lattice models is reanalyzed in the perspective of its complete algorithmization. The geometric problem of identifying, counting, and grouping together all possible contributions is disentangled…
We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…
We consider loop-erased random walk (LERW) running between two boundary points of a square grid approximation of a planar simply connected domain. The LERW Green's function is the probability that the LERW passes through a given edge in the…