Related papers: The Brownian web: Characterization and convergence
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…
We consider scaled Brownian motion (sBm), a random process described by a diffusion equation with explicitly time-dependent diffusion coefficient $D(t) = D_0 t^{\alpha - 1}$ (Batchelor's equation) which, for $\alpha < 1$, is often used for…
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…
A one-dimensional system of nonintersecting Brownian particles is constructed as the diffusion scaling limit of Fisher's vicious random walk model. $N$ Brownian particles start from the origin at time $t=0$ and undergo mutually avoiding…
Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…
We examine a new path transform on 1-dimensional simple random walks and Brownian motion, the quantile transform. This transformation relates to identities in fluctuation theory due to Wendel, Port, Dassios and others, and to discrete and…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
Many real life networks, such as the World Wide Web, transportation systems, biological or social networks, achieve both a strong local clustering (nodes have many mutual neighbors) and a small diameter (maximum distance between any two…
Let $R:(0,\infty) \to [0,\infty)$ be a measurable function. Consider coalescing Brownian motions started from every point in the subset $\{ (0,x) : x \in \mathbb{R} \}$ of $[0,\infty) \times \mathbb{R}$ (with $[0,\infty)$ denoting time and…
Sticky Brownian motion is the simplest example of a diffusion process that can spend finite time both in the interior of a domain and on its boundary. It arises in various applications such as in biology, materials science, and finance.…
We introduce a class of Markov coalescent processes on the continuous $d$-dimensional torus, in the most general setting of simultaneous multiple mergers, called the Brownian spatial coalescent. It is axiomatically defined through a…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
Let B_1,B_2, ... be independent one-dimensional Brownian motions defined over the whole real line such that B_i(0)=0. We consider the nth iterated Brownian motion W_n(t)= B_n(B_{n-1}(...(B_2(B_1(t)))...)). Although the sequences of…
Small-world (SW) networks have been identified in many different fields. Topological coefficients like the clustering coefficient and the characteristic path length have been used in the past for a qualitative characterization of these…
Recurrence networks are powerful tools used effectively in the nonlinear analysis of time series data. The analysis in this context is done mostly with unweighted and undirected complex networks constructed with specific criteria from the…
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and…
We study a simple model in which the growth of a network is determined by the location of one or more random walkers. Depending on walker speed, the model generates a spectrum of structures situated between well-known limiting cases. We…
The dynamical discrete web (DyDW),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 time parameter \tau. The evolution is by…
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…