Central loops in random planar graphs
Benjamin Lion, Marc Barthelemy

TL;DR
This paper investigates the structure of random planar graphs, focusing on central loops and betweenness centrality, and introduces a toy model to understand the emergence of non-trivial patterns like central loops.
Contribution
It presents a simple star-based toy model to analyze the conditions under which central loops become prominent in random planar graphs.
Findings
Loop centrality depends on link weight and position.
Optimal loop position scales with branch number and weight.
Radial branch structure influences loop centrality.
Abstract
Random planar graphs appear in a variety of context and it is important for many different applications to be able to characterize their structure. Local quantities fail to give interesting information and it seems that path-related measures are able to convey relevant information about the organization of these structures. In particular, nodes with a large betweenness centrality (BC) display non-trivial patterns, such as central loops. We first discuss empirical results for different random planar graphs and we then propose a toy model which allows us to discuss the condition for the emergence of non-trivial patterns such as central loops. This toy model is made of a star network with branches of size and links of weight , superimposed to a loop at distance from the center and with links of weight . We estimate for this model the BC at the center and on the loop…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
