相关论文: The Brownian Web: Characterization and Convergence

The Brownian sphere is a random metric space, homeomorphic to the two-dimensional sphere, which arises as the universal scaling limit of many types of random planar maps. The direct construction of the Brownian sphere is via a continuous…

Real networks are complex dynamical systems, evolving over time with the addition and deletion of nodes and links. Currently, there exists no principled mathematical theory for their dynamics -- a grand-challenge open problem. Here, we show…

Quantum walks (QWs) exhibit different properties compared with classical random walks (RWs), most notably by linear spreading and localization. In the meantime, random walks that replicate quantum walks, which we refer to as…

Spatially and temporally inhomogeneous evolution of one-dimensional vicious walkers with wall restriction is studied. We show that its continuum version is equivalent with a noncolliding system of stochastic processes called Brownian…

We consider an expanding population on the plane. The genealogy of a sample from the population is modelled by coalescing Brownian motion on the circle. We establish a weak law of large numbers for the site frequency spectrum in this model.…

In this paper we examine the rate of convergence of one of the standard algorithms for emulating exit probabilities of Brownian motion, the Walk on Spheres (WoS) algorithm. We obtain the complete characterization of the rate of convergence…

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…

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 asymptotic behavior of the maximum likelihood estimator corresponding to the observation of a trajectory of a Skew Brownian motion, through a uniform time discretization. We characterize the speed of convergence and the…

There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint…

The understanding of the immense and intricate topological structure of the World Wide Web (WWW) is a major scientific and technological challenge. This has been tackled recently by characterizing the properties of its representative graphs…

Our goal in this paper is to develop a practical framework for obtaining a uniform sample of users in an online social network (OSN) by crawling its social graph. Such a sample allows to estimate any user property and some topological…

A Bayesian Network (BN) is a probabilistic model that represents a set of variables using a directed acyclic graph (DAG). Current algorithms for learning BN structures from data focus on estimating the edges of a specific DAG, and often…

We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…

Synchronization is a key functionality in wireless network, enabling a wide variety of services. We consider a Bayesian inference framework whereby network nodes can achieve phase and skew synchronization in a fully distributed way. In…

We consider the tributary structure of Howard's drainage model studied by Gangopadhyay et. al. Conditional on the event that the tributary survives up to time $n$, we show that, as a sequence of random metric spaces, scaled tributary…

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…

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…

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…

As an image of the many-to-one map of loop-erasing operation $\LE$ of random walks, a self-avoiding walk (SAW) is obtained. The loop-erased random walk (LERW) model is the statistical ensemble of SAWs such that the weight of each SAW…