# Bond Percolation in Small-World Graphs with Power-Law Distribution

@article{Becchetti2022BondPI,
title={Bond Percolation in Small-World Graphs with Power-Law Distribution},
author={Luca Becchetti and Andrea E. F. Clementi and Francesco Pasquale and Luca Trevisan and Isabella Ziccardi},
journal={ArXiv},
year={2022},
volume={abs/2205.08774}
}
• Published 18 May 2022
• Mathematics
• ArXiv
Full-bond percolation with parameter p is the process in which, given a graph, for every edge independently, we keep the edge with probability p and delete it with probability 1 − p . Bond percolation is motivated by problems in mathematical physics and it is studied in parallel computing and network science to understand the resilience of distributed systems to random link failure and the spread of information in networks through unreliable links. Full-bond percolation is also equivalent to…

## References

SHOWING 1-10 OF 36 REFERENCES
Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks
• Mathematics
ArXiv
• 2021
We study epidemic spreading according to a Susceptible-Infectious-Recovered (for short, SIR) network model known as the Reed-Frost model, and we establish sharp thresholds for two generative models
Exact solution of site and bond percolation on small-world networks.
• Mathematics
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
• 2000
An exact solution of the model for both site and bond percolation is given, including the position of thePercolation transition at which epidemic behavior sets in, the values of the critical exponents governing this transition, the mean and variance of the distribution of cluster sizes below the transition, and the size of the giant component (epidemic) above the transition.
Scaling and percolation in the small-world network model.
• Mathematics
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
• 1999
There is one nontrivial length-scale in the small-world network model of Watts and Strogatz, analogous to the correlation length in other systems, which is well-defined in the limit of infinite system size and which diverges continuously as the randomness in the network tends to zero, giving a normal critical point in this limit.
Tight Bounds for Influence in Diffusion Networks and Application to Bond Percolation and Epidemiology
• Computer Science
NIPS
• 2014
This paper points out that, in general networks, the sub-critical regime behaves in $O(\sqrt{n})$ where $n$ is the size of the network, and that this upper bound is met for star-shaped networks.
Percolation on finite graphs and isoperimetric inequalities
• Mathematics
• 2004
Consider a uniform expanders family Gn with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of Gn obtained by retaining each edge, randomly and independently,
Are randomly grown graphs really random?
• Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2001
It is concluded that grown graphs, however randomly they are constructed, are fundamentally different from their static random graph counterparts.
The Diameter of a Scale-Free Random Graph
• Computer Science
Comb.
• 2004
We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of earlier vertices, where each earlier vertex is chosen with probability
Graph diameter in long‐range percolation
• M. Biskup
• Mathematics
Random Struct. Algorithms
• 2011
The graph diameter for the graph reduced to a box of side L scales like (log L)Δ+o(1) where Δ−1 := log2(2d/s) and the diameter grows about as fast as the typical graph distance between two vertices at distance L.
Lévy Walk Navigation in Complex Networks: A Distinct Relation between Optimal Transport Exponent and Network Dimension
• Computer Science
Scientific reports
• 2015
We investigate, for the first time, navigation on networks with a Lévy walk strategy such that the step probability scales as pij ~ dij–α, where dij is the Manhattan distance between nodes i and j,
Thresholds for virus spread on networks
• Mathematics
valuetools '06
• 2006
This work characterise how the size of the population that eventually becomes infected depends on the network topology, and shows that if the ratio of cure to infection rates is larger than the spectral radius of the graph, and the initial infected population is small, then the finalinfected population is also small in a sense that can be made precise.