Percolation and epidemic processes in one-dimensional small-world networks (extended abstract)
From MaRDI portal
Publication:6109026
DOI10.1007/978-3-031-20624-5_29arXiv2103.16398MaRDI QIDQ6109026
Riccardo Denni, Luca Trevisan, Andrea E. F. Clementi, Francesco Pasquale, Luca Becchetti, Isabella Ziccardi
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.16398
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- One dimensional \(1/| j-i| ^ s\) percolation models: The existence of a transition for s\(\leq 2\)
- The critical probability of bond percolation on the square lattice equals 1/2
- On the scaling of the chemical distance in long-range percolation models
- Percolation on finite graphs and isoperimetric inequalities.
- The diameter of a scale-free random graph
- Thresholds for virus spread on networks
- The diameter of long-range percolation clusters on finite cycles
- On the fault tolerance of the butterfly
- Graph diameter in long-range percolation
- Emergence of Scaling in Random Networks
- Large deviations for sums of partly dependent random variables
- The phase transition in inhomogeneous random graphs
- Collective dynamics of ‘small-world’ networks
- The giant component threshold for random regular graphs with edge faults H. Prodinger
- Percolation and epidemic processes in one-dimensional small-world networks (extended abstract)
This page was built for publication: Percolation and epidemic processes in one-dimensional small-world networks (extended abstract)
