相关论文: The spectral dimension of random trees
The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which is the local limit of uniformly distributed finite quadrangulations with a fixed number of faces. We study asymptotic properties of this…
The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the k-cut number of conditioned Galton-Watson trees converges…
One of the goals of the landscape program in string theory is to extract information about the space of string vacua in the form of statistical correlations between phenomenological features that are otherwise uncorrelated in field theory.…
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…
We study a random tree, which was introduced by Ajazi et al. as part of a model of a neuronal network. Realising a scaling relation for the law of the tree, we can use elementary techniques to derive asymptotic results on the geometry as…
Regression trees and random forests are popular and effective non-parametric estimators in practical applications. A recent paper by Athey and Wager shows that the random forest estimate at any point is asymptotically Gaussian; in this…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
We study marginally compact macromolecular trees that are created by means of two different fractal generators. In doing so, we assume Gaussian statistics for the vectors connecting nodes of the trees. Moreover, we introduce bond-bond…
We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…
This article presents a new way to understand the descriptive ability of tree shape statistics. Where before tree shape statistics were chosen by their ability to distinguish between macroevolutionary models, the ``resolution'' presented in…
This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…
A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of balanced spanning trees in the random geometric graph…
In this note, we claim that diagonal scaling of a sample covariance matrix is asymptotically inconsistent if the ratio of the dimension to the sample size converges to a positive constant, where population is assumed to be Gaussian with a…
We consider the number of crossings in a random labelled tree with vertices in convex position. We give a new proof of the fact that this quantity is asymptotically Gaussian with mean $n^2/6$ and variance $n^3/45$. Furthermore, we give an…
We discuss the space-time determinantal random field which arises for the PNG model in one dimension and resembles the one for Dyson's Brownian motion. The information of interest for growth processes is carried by the edge statistics of…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
We present a numerical study of topological descriptors of initially Gaussian and scale-free density perturbations evolving via gravitational instability in an expanding universe. We carefully evaluate and avoid numerical contamination in…
We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…
Permutons, which are probability measures on the unit square $[0, 1]^2$ with uniform marginals, are the natural scaling limits for sequences of (random) permutations. We introduce a $d$-dimensional generalization of these measures for all…