Fully-connected bond percolation on Zd

被引:1
|
作者
Dereudre, David [1 ]
机构
[1] Univ Lille, CNRS, UMR 8524, Lab Paul Painleve, F-59000 Lille, France
关键词
FK-percolation; Random cluster model; Phase transition; FKG inequalities; DLR equations;
D O I
10.1007/s00440-021-01088-8
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We consider the bond percolation model on the lattice Z(d) (d >= 2) with the constraint to be fully connected. Each edge is open with probability p is an element of (0, 1), closed with probability 1- p and then the process is conditioned to have a unique open connected component (bounded or unbounded). The model is defined on Z(d) by passing to the limit for a sequence of finite volume modelswith general boundary conditions. Several questions and problems are investigated: existence, uniqueness, phase transition, DLR equations. Our main result involves the existence of a threshold 0 < p* (d) < 1 such that any infinite volume model is necessary the vacuum state in subcritical regime (no open edges) and is non trivial in the supercritical regime (existence of a stationary unbounded connected cluster). Bounds for p* (d) are given and show that it is drastically smaller than the standard bond percolation threshold in Z(d). For instance 0.128 < p* (2) < 0.202 (rigorous bounds) whereas the 2D bond percolation threshold is equal to 1/2.
引用
收藏
页码:547 / 579
页数:33
相关论文
共 50 条
  • [1] Fully-connected networks with local connections
    P. E. Kornilovitch
    R. N. Bicknell
    J. S. Yeo
    [J]. Applied Physics A, 2009, 95 : 999 - 1004
  • [2] Energy Complexity of Fully-Connected Layers
    Sima, Jiri
    Cabessa, Jeremie
    [J]. ADVANCES IN COMPUTATIONAL INTELLIGENCE, IWANN 2023, PT I, 2023, 14134 : 3 - 15
  • [3] On energy complexity of fully-connected layers
    Sima, Jiri
    Cabessa, Jeremie
    Vidnerova, Petra
    [J]. NEURAL NETWORKS, 2024, 178
  • [4] On the Learnability of Fully-connected Neural Networks
    Zhang, Yuchen
    Lee, Jason D.
    Wainwright, Martin J.
    Jordan, Michael I.
    [J]. ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 54, 2017, 54 : 83 - 91
  • [5] Fully-connected networks with local connections
    Kornilovitch, P. E.
    Bicknell, R. N.
    Yeo, J. S.
    [J]. APPLIED PHYSICS A-MATERIALS SCIENCE & PROCESSING, 2009, 95 (04): : 999 - 1004
  • [6] Efficient Inference for Fully-Connected CRFs with Stationarity
    Zhang, Yimeng
    Chen, Tsuhan
    [J]. 2012 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2012, : 582 - 589
  • [7] The storage capacity of a fully-connected committee machine
    Xiong, YS
    Kwon, CL
    Oh, JH
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 10, 1998, 10 : 378 - 384
  • [8] Storage capacity of the fully-connected committee machine
    Urbanczik, R
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1997, 30 (11): : L387 - L392
  • [9] On the Performance of Fully-Connected and Sub-Connected Hybrid Beamforming System
    Wan, Shaojun
    Zhu, Hongbin
    Kang, Kai
    Qian, Hua
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2021, 70 (10) : 11078 - 11082
  • [10] Reaction-diffusion on the fully-connected lattice: A plus A → A
    Turban, Loic
    Fortin, Jean-Yves
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2018, 51 (14)