Minimal obstructions for normal spanning trees
نویسندگان
چکیده
منابع مشابه
Percolation and Minimal Spanning Trees
Consider a random set V n of points in the box n; n) d , generated either by a Poisson process with density p or by a site percolation process with parameter p. We analyse the empirical distribution function F n of the lengths of edges in a minimal (Euclidean) spanning tree T n on V n. We express the limit of F n , as n ! 1, in terms of the free energies of a family of percolation processes der...
متن کاملAlgorithms for Updating Minimal Spanning Trees
The problem of finding the minimal spanning tree on an undirected weighted graph has been investigated by many people and O(nZ) algorithms are well known. P. M. Spira and A. Pan (Siam J. Computing 4 (1975), 375-380) present an O(n) algorithm for updating the minimal spanning tree if a new vertex is inserted into the graph. In this paper, we present another O(n) algorithm simpler than that prese...
متن کاملManifold Learning with Geodesic Minimal Spanning Trees
In the manifold learning problem one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper we consider the closely related problem of estimating the manifold’s intrinsic dimension and the intrinsic entropy of the sample points. Specifically, we view the sam...
متن کاملModeling Minimal Spanning Trees with Beta Vectors
We model the distribution of normalized interpoint distances (IDs) on the minimal spanning tree (MST) using multivariate beta vectors. We define overlapping sums of the components of a Dirichlet distribution to construct multivariate beta distributions. We also use a multivariate normal copula with beta marginals to define beta vectors. Based on the ordered IDs of the MST, we define a multivari...
متن کاملCalorimeter Clustering with Minimal Spanning Trees
Clustering calorimeter hits is a complex pattern recognition problem with complexity depending on event type, energy and detector design. A successful clustering algorithm must be characterised by high efficiency and speed to cope with and to exploit the high granularity design forseen for both electromagnetic and hadronic calorimeters in a Future Linear Collider experiment. In the following we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2018
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm337-10-2017