Sublinear Cuts are the Exception in BDF-GIRGs
Marc Kaufmann, Raghu Raman Ravi, Ulysse Schaller

TL;DR
This paper introduces BDF-GIRGs, a flexible class of geometric random graphs that model complex social networks more realistically, and classifies when small graph separators exist within these models.
Contribution
It extends GIRGs by incorporating arbitrary hierarchies of coordinate distances, providing a comprehensive classification of small separator existence in these models.
Findings
Small separators exist in BDF-GIRGs under certain conditions.
BDF-GIRGs satisfy a stochastic triangle inequality, indicating clustering.
The models better capture complex social tie formations.
Abstract
The introduction of geometry has proven instrumental in the efforts towards more realistic models for real-world networks. In Geometric Inhomogeneous Random Graphs (GIRGs), Euclidean Geometry induces clustering of the vertices, which is widely observed in networks in the wild. Euclidean Geometry in multiple dimensions however restricts proximity of vertices to those cases where vertices are close in each coordinate. We introduce a large class of GIRG extensions, called BDF-GIRGs, which capture arbitrary hierarchies of the coordinates within the distance function of the vertex feature space. These distance functions have the potential to allow more realistic modeling of the complex formation of social ties in real-world networks, where similarities between people lead to connections. Here, similarity with respect to certain features, such as familial kinship or a shared workplace,…
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.
Taxonomy
TopicsAuction Theory and Applications
