Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted path of nodes between them. In a variety of more recent data transmission protocols, such as the communication of noisy data via error-correcting repeaters, both in classical and quantum networks, the requirement of an uninterrupted path is too strict: two nodes may be able to communicate even if all paths between them have interruptions or gaps consisting of nodes that may corrupt the message. In such a case a different approach is needed. We develop the theoretical framework for extended-range percolation in networks, describing the fundamental connectivity properties relevant to such models of information transfer. We obtain exact results, for any range R, for infinite random uncorrelated networks and we provide a message-passing formulation that works well in sparse real-world networks. The interplay of the extended range and heterogeneity leads to novel critical behavior in scale-free networks.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1103/PhysRevE.108.044304 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
General theory for extended-range percolation on simple and multiplex networks.
Phys Rev E
September 2024
School of Mathematical Sciences, Queen Mary University of London, London E1 4NS, United Kingdom.
Article Synopsis
- Extended-range percolation is a process useful for quantum communication, where nodes can be categorized as trusted or untrusted, affecting connectivity.
- Untrusted facilitator nodes can help maintain communication between trusted nodes if they lie within a specific distance (R) of each other.
- The study combines a message-passing algorithm with analysis of interdependent multiplex networks, revealing complex behaviors and phase transitions, confirmed by simulations, useful for understanding communication in networks with extended-range connections.
Extended-range percolation in complex networks.
Phys Rev E
October 2023
Departamento de Física da Universidade de Aveiro & I3N, Campus Universitário de Santiago, 3810-193 Aveiro, Portugal.
Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted path of nodes between them. In a variety of more recent data transmission protocols, such as the communication of noisy data via error-correcting repeaters, both in classical and quantum networks, the requirement of an uninterrupted path is too strict: two nodes may be able to communicate even if all paths between them have interruptions or gaps consisting of nodes that may corrupt the message.
View Article and Find Full Text PDFRandom site percolation on honeycomb lattices with complex neighborhoods.
Chaos
August 2022
Faculty of Physics and Applied Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Kraków, Poland.
We present a rough estimation-up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs the occupation probability-of the critical occupation probabilities for the random site percolation problem on a honeycomb lattice with complex neighborhoods containing sites up to the fifth coordination zone. There are 31 such neighborhoods with a radius ranging from one to three and containing 3-24 sites. For two-dimensional regular lattices with compact extended-range neighborhoods, in the limit of the large number z of sites in the neighborhoods, the site percolation thresholds follow the dependency ∝ 1 / z, as recently shown by Xun et al.
View Article and Find Full Text PDFSite and bond percolation thresholds on regular lattices with compact extended-range neighborhoods in two and three dimensions.
Phys Rev E
February 2022
Center for the Study of Complex System and Department of Chemical Engineering, University of Michigan, Ann Arbor, Michigan 48109-2800, USA.
Extended-range percolation on various regular lattices, including all 11 Archimedean lattices in two dimensions and the simple cubic (sc), body-centered cubic (bcc), and face-centered cubic (fcc) lattices in three dimensions, is investigated. In two dimensions, correlations between coordination number z and site thresholds p_{c} for Archimedean lattices up to 10th nearest neighbors (NN) are seen by plotting z versus 1/p_{c} and z versus -1/ln(1-p_{c}) using the data of d'Iribarne et al. [J.
View Article and Find Full Text PDFSite percolation on square and simple cubic lattices with extended neighborhoods and their continuum limit.
Phys Rev E
February 2021
Center for the Study of Complex Systems and Department of Chemical Engineering, University of Michigan, Ann Arbor, Michigan 48109-2800, USA.
By means of extensive Monte Carlo simulation, we study extended-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors up to the eighth nearest neighbors for the square lattice and the ninth nearest neighbors for the simple cubic lattice. We find precise thresholds for 23 systems using a single-cluster growth algorithm. Site percolation on lattices with compact neighborhoods of connected sites can be mapped to problems of lattice percolation of extended objects of a given shape, such as disks and spheres, and the thresholds can be related to the continuum thresholds η_{c} for objects of those shapes.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!