相关论文: The Brownian web: Characterization and convergence
We study a system of coalescing random walks on the integer lattice $\mathbb{Z}^{d}$ in which the walk is oriented in the $d$-th direction and follows certain specified rules. We first study the geometry of the paths and show that, almost…
We obtain the Brownian net of Sun and Swart (2008) as the scaling limit of the paths traced out by a system of continuous (one-dimensional) space and time branching and coalescing random walks. This demonstrates a certain universality of…
The Brownian web can be roughly described as a family of coalescing one-dimensional Brownian motions starting at all times in $\R$ and at all points of $\R$. It was introduced by Arratia; a variant was then studied by Toth and Werner;…
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…
The coalescing Brownian flow on $\mathbb{R}$ is a process which was introduced by Arratia [Coalescing Brownian motions on the line (1979) Univ. Wisconsin, Madison] and T\'{o}th and Werner [Probab. Theory Related Fields 111 (1998) 375-452],…
We generalize the coalescing Brownian flow, aka the Brownian web, considered as a weak flow to allow varying drift and diffusivity in the constituent diffusion processes and call these flows coalescing diffusive flows. We then identify the…
In this paper we study the convergence of dynamical discrete web (DyDW) to the dynamical Brownian web (DyBW) in the path space topology. We show that almost surely the DyBW has RCLL paths taking values in an appropriate metric space and as…
We prove that, after centering and diffusively rescaling space and time, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2_{even}:={(x,i) in Z^2: x+i is even}…
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 paper we define Brownian local time as the almost sure limit of the local times of a nested sequence of simple, symmetric random walks. The limit is jointly continuous in $(t,x)$. The rate of convergence is $n^{\frac14} (\log…
We introduce the P\'olya Web, a system of coalescing random walks based on the classic P\'olya urn model. This construction serves as an analogue to the web of coalescing random walks studied by T\'oth and Werner (1998), replacing simple…
Let $(B(t),\,t\ge0)$ denote the standard, one-dimensional Wiener process and $(\ell(y,t);\, y\in\mathbb{R},\, t\ge0)$ its local time at level $y$ up to time $t$. Then $\big( (B(t),\, \ell(B(t),t)),\; t\ge0 \big)$ is a random path that fills…
Motivated by its relevance for the study of perturbations of one-dimensional voter models, including stochastic Potts models at low temperature, we consider diffusively rescaled coalescing random walks with branching and killing. Our main…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of this model is that the hybridization rate of the lineages…
We give a short overview on our work on ancestral lineages in spatial population models with local regulation. We explain how an ancestral lineage can be interpreted as a random walk in a dynamic random environment. Defining regeneration…
Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
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…
We introduce a new model called the Brownian Conga Line. It is a random curve evolving in time, generated when a particle performing a two dimensional Gaussian random walk leads a long chain of particles connected to each other by cohesive…