相关论文: Geometry of the uniform spanning forest components…
We study uniform spanning trees (USTs) on the cylindrical graph $G = C_n \times P_m$. Fix a trunk $L$ as a designated simple path in the tree connecting the two boundary rings of the cylinder. We prove an exponential tail bound for the…
We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…
In this paper we introduce a variation on the multidimensional segment tree, formed by unifying different interpretations of the dimensionalities of the data structure. We give some new definitions to previously well-defined concepts that…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees $N_{ST}$ and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A…
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…
The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…
We extend the Aldous-Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm with Sznitman's random interlacement…
Metric embeddings are central to metric theory and its applications. Here we consider embeddings of a different sort: maps from a set to subsets of a metric space so that distances between points are approximated by minimal distances…
We discuss the geometry of trees endowed with a causal structure using the conventional framework of equilibrium statistical mechanics. We show how this ensemble is related to popular growing network models. In particular we demonstrate…
Evolutionary relationships between species are represented by phylogenetic trees, but these relationships are subject to uncertainty due to the random nature of evolution. A geometry for the space of phylogenetic trees is necessary in order…
Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this…
In the present paper we establish a clear correspondence between probabilities of certain edges belonging to a realization of the uniform spanning tree (UST), and the states of a fermionic Gaussian free field. Namely, we express the…
In a recent paper on 'Estimating Species Trees from Unrooted Gene Trees' Liu and Yu observe that the distance matrix on the underlying taxon set, which is built up from expected internode distances on gene trees under the multispecies…
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges…
We study the geometry of the cuspidal edge $M$ in $\mathbb R^3$ derived from its contact with planes and lines (referred to as flat geometry). The contact of $M$ with planes is measured by the singularities of the height functions on $M$.…
Given a subgraph $H$ of a graph $G$, the induced graph of $H$ is the largest subgraph of $G$ whose vertex set is the same as that of $H$. Our paper concerns the induced graphs of the components of $\operatorname{WSF}(G)$, the wired spanning…
The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…
We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube…
For a measure mu supported on a compact connected subset of a Euclidean space which satisfies a uniform d-dimensional decay of the volume of balls we show that the maximal edge in the minimum spanning tree of n indepndent samples from mu…