2021
DOI: 10.1088/1751-8121/ac2474
|View full text |Cite
|
Sign up to set email alerts
|

The birth of geometry in exponential random graphs

Abstract: Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex degree and form very large numbers of simple polygons (triangles or squares). The models avoid the collapse phenomena that plague naive graph Hamiltonians based on triangle or square counts. More than that, statistically significant numbers of other geometric primitives (small p… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 51 publications
0
4
0
Order By: Relevance
“…In conclusion, we hope that this work could provide a fertile ground for research at the interface between network theory and quantum gravity [67][68][69][70][71][72][73][74][75][76][77][78][79] and, more generally, quantum mechanics [29,[80][81][82][83][84][85][86][87], which has received increasing attention recently. Moreover, the hereby defined mass of simple and higher-order networks could prove itself as a relevant metric to characterize simple and higher-order networks coming from interdisciplinary applications.…”
Section: Discussionmentioning
confidence: 99%
“…In conclusion, we hope that this work could provide a fertile ground for research at the interface between network theory and quantum gravity [67][68][69][70][71][72][73][74][75][76][77][78][79] and, more generally, quantum mechanics [29,[80][81][82][83][84][85][86][87], which has received increasing attention recently. Moreover, the hereby defined mass of simple and higher-order networks could prove itself as a relevant metric to characterize simple and higher-order networks coming from interdisciplinary applications.…”
Section: Discussionmentioning
confidence: 99%
“…It is this constraint that ultimately causes 2D combinatorial quantum gravity to be in a different universality class than Liouville quantum gravity [46]. Note also that some of these constraints on configuration space can alternatively be dynamically implemented by adding Kronecker delta terms to the Hamiltonian [48].…”
Section: Combinatorial Quantum Gravitymentioning
confidence: 99%
“…We note that however, due to space limitations, we cannot cover all the works at the interface between network science and quantum gravity, a field in which research interest is recently growing. This include work on causal sets [302,303], tensor field approaches [257,[304][305][306], combinatorial quantum gravity [307][308][309][310] and emergent random graph geometry [311][312][313][314] among other approaches [315].…”
Section: Introduction To Emergent Quantum Network Modelsmentioning
confidence: 99%