Related papers: The P\'olya Web
Following Hales (2018), the evolution of P\'olya's urn may be interpreted as a walk, a P\'olya walk, on the integer lattice $\mathbb{N}^2$. We study the visibility properties of P\'olya's walk or, equivalently, the divisibility properties…
Arratia, and later T\'oth and Werner, constructed random processes that formally correspond to coalescing one-dimensional Brownian motions starting from every space-time point. We extend their work by constructing and characterizing what we…
We introduce a system of one-dimensional coalescing nonsimple random walks with long range jumps allowing crossing paths and exibiting dependence before coalescence. We show that under diffusive scaling this system converges in distribution…
The P\'olya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. \v{S}tefa\v{n}\'ak, I. Jex and T. Kiss, Phys. Rev. Lett. \textbf{100}, 020501 (2008)] which is based on a…
We introduce the P\'olya threshold graph model and derive its stochastic and algebraic properties. This random threshold graph is generated sequentially via a two-color P\'olya urn process. Starting from an empty graph, each time step…
We consider P\'olya urns with infinitely many colours that are of a random walk type, in two related version. We show that the colour distribution a.s., after rescaling, converges to a normal distribution, assuming only second moments on…
We consider the simple random walk (or P\'olya walk) on the one-dimensional lattice subject to stochastic resetting to the origin with probability $r$ at each time step. The focus is on the joint statistics of the numbers…
We analyze the recurrence probability (P\'olya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localisation of quantum…
The P\'olya urn scheme is a discrete-time process concerning the addition and removal of colored balls. There is a known embedding of it in continuous-time, called the P\'olya process. We deal with a generalization of this stochastic model,…
Motivated by [G. Cannizzaro, M. Hairer, Comm. Pure Applied Math., '22], we provide a construction of the Brownian Web (see [T\'oth B., Werner W., Probab. Theory Related Fields, '98] and [L. R. G. Fontes, M. Isopi, C. M. Newman, and K.…
We study a new class of time inhomogeneous P\'olya-type urn schemes and give optimal rates of convergence for the distribution of the properly scaled number of balls of a given color to nearly the full class of generalized gamma…
We propose a definition for the P\'olya number of continuous-time quantum walks to characterize their recurrence properties. The definition involves a series of measurements on the system, each carried out on a different member from an…
We propose a metric space of coalescing pairs of paths on which we are able to prove (more or less) directly convergence of objects such as the persistence probability in the (one dimensional, nearest neighbor, symmetric) voter model or the…
The Brownian web is a collection of one-dimensional coalescing Brownian motions starting from everywhere in space and time, and the Brownian net is a generalization that also allows branching. They appear in the diffusive scaling limits of…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
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 answer Problem 11.1 of Janson arXiv:1803.04207 on P\'olya urns associated with stable random walk. Our proof use neither martingales nor trees, but an approximation with a differential equation.
We introduce a new metric for collections of aged paths and a robust set of criteria for compactness for a set of collection of aged paths in the topology corresponding to this metric. We show that the distribution of stable webs ($1<…
In this work, recent results on the moments of balanced P\'olya urns are generalized to unbalanced urns, with the condition that the expected change in total activity at each step is constant. We also provide applications of our results to…
The (standard) Brownian web is a collection of coalescing one- dimensional Brownian motions, starting from each point in space and time. It arises as the diffusive scaling limit of a collection of coalescing random walks. We show that it is…