Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2501.11226 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913066379116544 |
|---|---|
| author | Alimohammadi, Yeganeh Işık, Senem Saberi, Amin |
| author_facet | Alimohammadi, Yeganeh Işık, Senem Saberi, Amin |
| contents | Small-world networks, known for high local clustering and short path lengths, are a fundamental structure in many real-world systems, including social, biological, and technological networks. We apply the theory of (marked) local convergence (also known as Benjamini-Schramm convergence) to derive the limiting behavior of the local structures for two commonly studied small-world network models: the Watts-Strogatz and the Kleinberg models. Establishing local convergence enables us to show that key network measures, such as clustering coefficient, PageRank, greedy maximal independent set, number of spanning trees and tree entropy, converge as network size increases, with their limits determined by the graph's local structure. Additionally, this framework facilitates the estimation of global phenomena, such as the size of the giant component under bond percolation and the closely related properties, the size of the epidemic and information cascades, using local information from small neighborhoods. Furthermore, we observe a critical change in the behavior of the limit exactly when the parameter governing long-range connections in the Kleinberg model crosses the threshold where decentralized search remains efficient, offering a new perspective on why decentralized algorithms fail in certain regimes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_11226 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Local Limits of Small World Networks Alimohammadi, Yeganeh Işık, Senem Saberi, Amin Probability Data Structures and Algorithms Social and Information Networks Combinatorics Small-world networks, known for high local clustering and short path lengths, are a fundamental structure in many real-world systems, including social, biological, and technological networks. We apply the theory of (marked) local convergence (also known as Benjamini-Schramm convergence) to derive the limiting behavior of the local structures for two commonly studied small-world network models: the Watts-Strogatz and the Kleinberg models. Establishing local convergence enables us to show that key network measures, such as clustering coefficient, PageRank, greedy maximal independent set, number of spanning trees and tree entropy, converge as network size increases, with their limits determined by the graph's local structure. Additionally, this framework facilitates the estimation of global phenomena, such as the size of the giant component under bond percolation and the closely related properties, the size of the epidemic and information cascades, using local information from small neighborhoods. Furthermore, we observe a critical change in the behavior of the limit exactly when the parameter governing long-range connections in the Kleinberg model crosses the threshold where decentralized search remains efficient, offering a new perspective on why decentralized algorithms fail in certain regimes. |
| title | Local Limits of Small World Networks |
| topic | Probability Data Structures and Algorithms Social and Information Networks Combinatorics |
| url | https://arxiv.org/abs/2501.11226 |