Related papers: The radial spanning tree of a Poisson point proces…
The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…
We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short range correlations in the level spacings of the…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
This work describes probabilistic methods for utilizing random spanning trees generated via a random walk process. Goyal et al. showed that the union of random spanning trees approximates the expansion of every cut of a graph. First, we…
Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…
Bayesian networks faithfully represent the symmetric conditional independences existing between the components of a random vector. Staged trees are an extension of Bayesian networks for categorical random vectors whose graph represents…
Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…
In recent years there has been a paradigm shift from the study of local task-related activation to the organization and functioning of large-scale functional and structural brain networks. However, a long-standing challenge in this…
We construct a stationary random tree, embedded in the upper half plane, with prescribed offspring distribution and whose vertices are the atoms of a unit Poisson point process. This process which we call Hammersley's tree process extends…
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
Let T be an infinite homogenous tree of homogeneity $q+1$. Attaching to each edge the conductance $1$, the tree will became an electric network. The reversible Markov chain associated to this network is the simple random walk on the…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
We revisit the model of the ballistic deposition studied in \cite{bdeposition} and prove several combinatorial properties of the random tree structure formed by the underlying stochastic process. Our results include limit theorems for the…
We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
The construction of minimum spanning trees (MSTs) from correlation matrices is an often used method to study relationships in the financial markets. However most of the work on this topic tends to use the Pearson correlation coefficient,…
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…
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…
Given a rooted point set $P$, the rooted $y-$Monotone Minimum Spanning Tree (rooted $y-$MMST) of $P$ is the spanning geometric graph of $P$ in which all the vertices are connected to the root by some $y-$monotone path and the sum of the…