Related papers: The Brownian web: Characterization and convergence
This paper proposes an attributed network growth model. Despite the knowledge that individuals use limited resources to form connections to similar others, we lack an understanding of how local and resource-constrained mechanisms explain…
We develop a probabilistic framework for global modeling of the traffic over a computer network. This model integrates existing single-link (-flow) traffic models with the routing over the network to capture the global traffic behavior. It…
The large deviation function has been known for a long time in the literature for the displacement of the rightmost particle in a branching random walk (BRW), or in a branching Brownian motion (BBM). More recently a number of…
The stationary radial distribution, $P(\rho)$, of the random walk with the diffusion coefficient $D$, which winds with the tangential velocity $V$ around the impenetrable disc of radius $R$ for $R\gg 1$ converges to the distribution…
We propose a procedure to generate dynamical networks with bursty, possibly repetitive and correlated temporal behaviors. Regarding any weighted directed graph as being composed of the accumulation of paths between its nodes, our…
We present a duality relation between two systems of coalescing random walks and an analogous duality relation between two systems of coalescing Brownian motions. Our results extends previous work in the literature and we apply it to the…
In structural brain networks the connections of interest consist of white-matter fibre bundles between spatially segregated brain regions. The presence, location and orientation of these white matter tracts can be derived using diffusion…
A simple random walk and a Brownian motion are considered on a spider that is a collection of half lines (we call them legs) joined in the origin. We give a strong approximation of these two objects and their local times. For fixed number…
In this work we introduce correlated random walks on $\Z$. When picking suitably at random the coefficient of correlation, and taking the average over a large number of walks, we obtain a discrete Gaussian process, whose scaling limit is…
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…
Very recent experiments have discovered that localized light in strongly absorbing media displays intriguing diffusive phenomena. Here we develop a first-principles theory of light propagation in open media with arbitrary absorption…
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…
A simple strategy to explore a network is to use a random-walk where the walker jumps from one node to an adjacent node at random. It is known that biasing the random jump, the walker can explore every walk of the same length with equal…
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…
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…
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…
The flashing Brownian ratchet is a stochastic process that alternates between two regimes, a one-dimensional Brownian motion and a Brownian ratchet, the latter being a one-dimensional diffusion process that drifts towards a minimum of a…
We consider some random series parametrised by complex binary strings. The simplest case is that of Rademacher series, independent of a time parameter. This is then extended to the case of Fourier series on the circle with Rademacher…
The original Donsker theorem says that a standard random walk converges in distribution to a Brownian motion in the space of continuous functions. It has recently been extended to enriched random walks and enriched Brownian motion. We use…
Let $\xi(k,n)$ be the local time of a simple symmetric random walk on the line. We give a strong approximation of the centered local time process $\xi(k,n)-\xi(0,n)$ in terms of a Wiener sheet and an independent Wiener process, time changed…