Related papers: The P\'olya Web
The Brownian web is a collection of coalescing Brownian motions started from every space-time point in R2. The Brownian web can be constructed as a scaling limit of coalescing one-dimensional simple random walks started at every point in a…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
This work studies the variation in Kullback-Leibler divergence between random draws from some popular nonparametric processes and their baseline measure. In particular we focus on the Dirichlet process, the P\'olya tree and the frequentist…
In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…
In this paper, we explain the connection between the Elephant Random Walk (ERW) and an urn model \`a la P\'olya and derive functional limit theorems for the former. The ERW model was introduced by Sch\"utz and Trimper [2004] to study memory…
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 investigate a model of evolving random network, introduced by us previously {[}{\it Phys. Rev. Lett.} {\bf 83}, 5587 (1999){]} . The model is a generalization of the Bak-Sneppen model of biological evolution, with the modification that…
The Brownian web is a random object that occurs as the scaling limit of an infinite system of coalescing random walks. Perturbing this system of random walks by, independently at each point in space-time, resampling the random walk…
We introduce a system of coalescing random paths with radialbehavior in a subsetof the plane. We call it theDiscrete Radial Poissonian Web. We show that underdiffusive scaling this family converges in distribution toa mapping of a…
Stimulated by the growing interest in the applications of complex networks framework on time series analysis, we devise a network model in which each of $N$ nodes is associated with a random walk of length $L$. Connectivity between any two…
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…
The dynamical discrete web (DDW), introduced in recent work of Howitt and Warren, is a system of coalescing simple symmetric one-dimensional random walks which evolve in an extra continuous dynamical parameter s. The evolution is by…
Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…
We study preferential attachment models where vertices enter the network with i.i.d. random numbers of edges that we call the out-degree. We identify the local limit of such models, substantially extending the work of Berger et al.(2014).…
We consider the P\'olya random walk in $\mathbb{Z}^2$. The paper establishes a number of results for the distributions and expectations of the number of usual (undirected) and specifically defined in the paper up- and down-directed…
Let $X$ be the constrained random walk on ${\mathbb Z}_+^d$ representing the queue lengths of a stable Jackson network and $x$ its initial position. Let $\tau_n$ be the first time the sum of the components of $X$ equals $n$. $p_n \doteq…
Community structures have been identified in various complex real-world networks, for example, communication, information, internet and shareholder networks. The scaling of community size distribution indicates the heterogeneity in the…
The random order graph streaming model has received significant attention recently, with problems such as matching size estimation, component counting, and the evaluation of bounded degree constant query testable properties shown to admit…
We propose a variant model of P{\'o}lya urn process, where the dynamics consist of two competing elements namely, suppression of growth and enhancement of dormant character. Here the level of such features are controlled by an internal…
We study the $\beta$ analogue of the nonintersecting Poisson random walks. We derive a stochastic differential equation of the Stieltjes transform of the empirical measure process, which can be viewed as a dynamical version of the…