Deterministic construction of typical networks in network models
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912742388006912 |
|---|---|
| author | Sabhahit, Narayan G. Laber, Moritz Hartle, Harrison van der Kolk, Jasper Scarpino, Samuel V. Klein, Brennan Krioukov, Dmitri |
| author_facet | Sabhahit, Narayan G. Laber, Moritz Hartle, Harrison van der Kolk, Jasper Scarpino, Samuel V. Klein, Brennan Krioukov, Dmitri |
| contents | It is often desirable to assess how well a given dataset is described by a given model. In network science, for instance, one often wants to say that a given real-world network appears to come from a particular network model. In statistical physics, the corresponding problem is about how typical a given state, representing real-world data, is in a particular statistical ensemble. One way to address this problem is to measure the distance between the data and the most typical state in the ensemble. Here, we identify the conditions that allow us to define this most typical state. These conditions hold in a wide class of grand canonical ensembles and their random mixtures. Our main contribution is a deterministic construction of a state that converges to this most typical state in the thermodynamic limit. This construction involves rounds of derandomization procedures, some of which deal with derandomizing point processes, an uncharted territory. We illustrate the construction on one particular network model, deterministic hyperbolic graphs, and its application to real-world networks, many of which we find are close to the most typical network in the model. While our main focus is on network models, our results are very general and apply to any grand canonical ensembles and their random mixtures satisfying certain niceness requirements. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_02254 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Deterministic construction of typical networks in network models Sabhahit, Narayan G. Laber, Moritz Hartle, Harrison van der Kolk, Jasper Scarpino, Samuel V. Klein, Brennan Krioukov, Dmitri Physics and Society Statistical Mechanics Social and Information Networks It is often desirable to assess how well a given dataset is described by a given model. In network science, for instance, one often wants to say that a given real-world network appears to come from a particular network model. In statistical physics, the corresponding problem is about how typical a given state, representing real-world data, is in a particular statistical ensemble. One way to address this problem is to measure the distance between the data and the most typical state in the ensemble. Here, we identify the conditions that allow us to define this most typical state. These conditions hold in a wide class of grand canonical ensembles and their random mixtures. Our main contribution is a deterministic construction of a state that converges to this most typical state in the thermodynamic limit. This construction involves rounds of derandomization procedures, some of which deal with derandomizing point processes, an uncharted territory. We illustrate the construction on one particular network model, deterministic hyperbolic graphs, and its application to real-world networks, many of which we find are close to the most typical network in the model. While our main focus is on network models, our results are very general and apply to any grand canonical ensembles and their random mixtures satisfying certain niceness requirements. |
| title | Deterministic construction of typical networks in network models |
| topic | Physics and Society Statistical Mechanics Social and Information Networks |
| url | https://arxiv.org/abs/2512.02254 |