Related papers: A stronger topology for the Brownian web
Flexible Bayesian models are typically constructed using limits of large parametric models with a multitude of parameters that are often uninterpretable. In this article, we offer a novel alternative by constructing an exponentially tilted…
In this paper we study the rate of convergence of the iterates of \iid random piecewise constant monotone maps to the time-$1$ transport map for the process of coalescing Brownian motions. We prove that the rate of convergence is given by a…
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],…
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…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
Assume that a finite set of points is randomly sampled from a subspace of a metric space. Recent advances in computational topology have provided several approaches to recovering the geometric and topological properties of the underlying…
Consider a one-dimensional stepping stone model with colonies of size $M$ and per-generation migration probability $\nu$, or a voter model on $\mathbb{Z}$ in which interactions occur over a distance of order $K$. Sample one individual at…
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…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
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}…
Overdamped motion of Brownian particles in tilted piecewise linear periodic potentials is considered. Explicit algebraic expressions for the diffusion coefficient, current, and coherence level of Brownian transport are derived. Their…
In a recent work, we proved that under diffusive scaling, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2 converges in distribution to the Brownian web. In…
The Brownian web is a random variable consisting of a Brownian motion starting from each space-time point on the plane. These are independent until they hit each other, at which point they coalesce. Tsirelson mentions this model in his…
We review the main tools which allow for the statistical characterization of weighted networks. We then present two case studies, the airline connection network and the scientific collaboration network, which are representative of critical…
We study a correlated Brownian motion in two dimensions, which is reflected, stopped or killed in a wedge represented as the intersection of two half spaces. First, we provide explicit density formulas, hinted by the method of images. These…
The paper studies the overdamped motion of Brownian particles in a tilted sawtooth potential. The dependencies of the diffusion coefficient and coherence level of Brownian transport on temperature, tilting force, and the shape of the…
We extend the notion of the distance to a measure from Euclidean space to probability measures on general metric spaces as a way to do topological data analysis in a way that is robust to noise and outliers. We then give an efficient way to…
We present an iterative sampling method which delivers upper and lower bounding processes for the Brownian path. We develop such processes with particular emphasis on being able to unbiasedly simulate them on a personal computer. The…
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…
We establish the discrete approximation to Brownian motion with varying dimension (BMVD in abbreviation) by random walks. The setting is very similar to that in [11], but here we use a different method allowing us to get rid the…