Related papers: The Brownian Web as a random $\mathbb R$-tree
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
According to a version of Donsker's theorem, geodesic random walks on Riemannian manifolds converge to the respective Brownian motion. From a computational perspective, however, evaluating geodesics can be quite costly. We therefore…
In this note - starting from $d$-dimensional (with $d>1$) fuzzy vectors - we prove Donsker's classical invariance principle. We consider a fuzzy random walk ${S^*_n}=X^*_1+\cdots+X^*_n,$ where $\{X^*_i\}_1^{\infty}$ is a sequence of…
We discuss subordination of random compact R-trees. We focus on the case of the Brownian tree, where the subordination function is given by the past maximum process of Brownian motion indexed by the tree. In that particular case, the…
We describe a probabilistic model involving iterated Brownian motion for constructing a random chainable continuum. We show that this random continuum is indecomposable.
Fix an arbitrary compact orientable surface with a boundary and consider a uniform bipartite random quadrangulation of this surface with $n$ faces and boundary component lengths of order $\sqrt n$ or of lower order. Endow this…
We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of…
We establish a new connection between local and large-scale structure in compactly generated totally disconnected locally compact (t.d.l.c.) groups $G$, finding a sufficient condition for $G$ to have more than one end in terms of its…
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously…
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…
A pathwise construction of discontinuous Brownian motions on metric graphs is given for every possible set of non-local Feller-Wentzell boundary conditions. This construction is achieved by locally decomposing the metric graphs into star…
In this paper, we determine the Poisson boundary of the relativistic Brownian motion in two classes of Lorentzian manifolds, namely model manifolds of constant scalar curvature and Robertson--Walker space-times, the latter constituting a…
We consider transport over a strongly connected, directed graph. The scheduling amounts to selecting transition probabilities for a discrete-time Markov evolution which is designed to be consistent with certain initial and final marginals.…
A Bernoulli random walk is a random trajectory starting from 0 and having i.i.d. increments, each of them being $+1$ or -1, equally likely. The other families cited in the title are Bernoulli random walks under various conditionings. A peak…
In this article, we show a result of approximation in law to subfractional Brownian motion, with $H>\frac{1}{2}$, in the Skorohod topology. The construction of these approximations is based on a sequence of I.I.D random variables
We present a statistical framework that jointly models brain shape and functional connectivity, which are two complex aspects of the brain that have been classically studied independently. We adopt a Riemannian modeling approach to account…
We study a model of interacting random walkers that proposes a simple mechanism for the emergence of cooperation in group of individuals. Each individual, represented by a Brownian particle, experiences an interaction produced by the local…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…