Clusters' size-degree distribution for bond percolation

被引:4
|
作者
Timonin, P. N. [1 ]
机构
[1] Southern Fed Univ, Rostov Na Donu 344091, Russia
关键词
Percolation; Potts model; EQUATION-OF-STATE; SITE PERCOLATION; LATTICE ANIMALS; BETHE LATTICE; DIMENSIONALITY; CONNECTION; SYSTEMS; SHAPES;
D O I
10.1016/j.physa.2017.11.144
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
To address some physical properties of percolating systems it can be useful to know the degree distributions in finite clusters along with their size distribution. Here we show that to achieve this aim for classical bond percolation one can use the q -> 1 limit of suitably modified q-state Potts model. We consider a version of such model with the additional complex variables and show that its partition function gives the bond percolation's generating function for the size and degree distribution in the g -> 1 limit. For the first time we derive this distribution analytically for bond percolation on Bethe lattices and complete graph. The possibility to expand the applications of present method to other clusters' characteristics and to models of correlated percolation is discussed. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:2292 / 2300
页数:9
相关论文
共 50 条
  • [1] First and second moments of the size distribution of bond percolation clusters on rings, paths and stars
    Jevtic, Petar
    Lanchier, Nicolas
    La Salle, Axel
    [J]. STATISTICS & PROBABILITY LETTERS, 2020, 161
  • [2] Optimality of Size-Degree Tradeoffs for Polynomial Calculus
    Galesi, Nicola
    Lauria, Massimo
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2010, 12 (01) : 1 - 22
  • [3] Tight Size-Degree Bounds for Sums-of-Squares Proofs
    Lauria, Massimo
    Nordstrom, Jakob
    [J]. 30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015), 2015, 33 : 448 - 466
  • [4] THE EFFECT OF PARTICLE-SIZE DISTRIBUTION ON THE FORMATION OF PERCOLATION CLUSTERS
    DOVZHENKO, AY
    ZHIRKOV, PV
    [J]. PHYSICS LETTERS A, 1995, 204 (3-4) : 247 - 250
  • [5] Tight Size-Degree Bounds for Sums-of-Squares Proofs
    Lauria, Massimo
    Nordstrom, Jakob
    [J]. COMPUTATIONAL COMPLEXITY, 2017, 26 (04) : 911 - 948
  • [6] Tight Size-Degree Bounds for Sums-of-Squares Proofs
    Massimo Lauria
    Jakob Nordström
    [J]. computational complexity, 2017, 26 : 911 - 948
  • [7] Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
    De Rezende, Susanna F.
    Meir, Or
    Nordstrom, Jakob
    Robere, Robert
    [J]. COMPUTATIONAL COMPLEXITY, 2021, 30 (01)
  • [8] Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
    de Rezende, Susanna F.
    Nordstrom, Jakob
    Meir, Or
    Robere, Robert
    [J]. 34TH COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2019), 2019, 137
  • [9] Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
    Susanna F. De Rezende
    Or Meir
    Jakob Nordström
    Robert Robere
    [J]. computational complexity, 2021, 30
  • [10] Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs
    Atserias, Albert
    Hakoniemi, Tuomas
    [J]. 34TH COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2019), 2019, 137