CONTINUUM PERCOLATION AND EUCLIDEAN MINIMAL SPANNING TREES IN HIGH DIMENSIONS

被引:0
|
作者
Penrose, Mathew D. [1 ]
机构
[1] Univ Durham, Dept Math Sci, South Rd, Durham DH1 3LE, England
来源
ANNALS OF APPLIED PROBABILITY | 1996年 / 6卷 / 02期
关键词
Geometric probability; continuum percolation; phase transitions; minimal spanning tree constant; high dimensions; Poisson process; branching process;
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We prove that for continuum percolation in R-d, parametrized by the mean number y of points connected to the origin, as d -> infinity with y fixed the distribution of the number of points in the cluster at the origin converges to that of the total number of progeny of a branching process with a Poisson(y) offspring distribution. We also prove that for sufficiently large d the critical points for the existence of infinite occupied and vacant regions are distinct. Our results resolve conjectures made by Avram and Bertsimas in connection with their formula for the growth rate of the length of the Euclidean minimal spanning tree on n independent uniformly distributed points in d dimensions as n -> infinity.
引用
收藏
页码:528 / 544
页数:17
相关论文
共 50 条
  • [31] Critical Percolation and the Minimal Spanning Tree in Slabs
    Newman, Charles
    Tassion, Vincent
    Wu, Wei
    COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2017, 70 (11) : 2084 - 2120
  • [32] SPANNING-TREES IN 2 DIMENSIONS
    MANNA, SS
    DHAR, D
    MAJUMDAR, SN
    PHYSICAL REVIEW A, 1992, 46 (08): : R4471 - R4474
  • [33] Estimating the asymptotic constants of the total length of Euclidean minimal spanning trees with power-weighted edges
    Cortina-Borja, M
    Robinson, T
    STATISTICS & PROBABILITY LETTERS, 2000, 47 (02) : 125 - 128
  • [34] Image Phylogeny by Minimal Spanning Trees
    Dias, Zanoni
    Rocha, Anderson
    Goldenstein, Siome
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2012, 7 (02) : 774 - 788
  • [35] ALGORITHMS FOR UPDATING MINIMAL SPANNING TREES
    CHIN, F
    HOUCK, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 16 (03) : 333 - 344
  • [36] Minimal Spanning Trees on Infinite Sets
    Ivanov A.O.
    Tuzhilin A.A.
    Journal of Mathematical Sciences, 2017, 223 (6) : 711 - 719
  • [37] On bicriterion minimal spanning trees: An approximation
    Andersen, KA
    Jornsten, K
    Lind, M
    COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (12) : 1171 - 1182
  • [38] Minimal obstructions for normal spanning trees
    Bowler, Nathan
    Geschke, Stefan
    Pitz, Max
    FUNDAMENTA MATHEMATICAE, 2018, 241 (03) : 245 - 263
  • [39] Lower bounds for testing Euclidean Minimum Spanning Trees
    Ben-Zwi, Oren
    Lachish, Oded
    Newman, Ilan
    INFORMATION PROCESSING LETTERS, 2007, 102 (06) : 219 - 225
  • [40] On minimum spanning trees for random Euclidean bipartite graphs
    Correddu, Mario
    Trevisan, Dario
    COMBINATORICS PROBABILITY AND COMPUTING, 2024, 33 (03) : 319 - 350