TL;DR
This paper introduces Fractal Gaussian Networks, a new sparse random graph model based on Gaussian Multiplicative Chaos, capturing fractal structures in networks and enabling analysis of their properties and detection methods.
Contribution
It presents a novel fractal network model that interpolates between known random geometric graphs and fractal structures, with analytical characterizations and applications to real data.
Findings
Expected number of edges, triangles, and cliques characterized
Detection and parameter estimation methods developed
Application to real-world network data demonstrated
Abstract
We propose a novel stochastic network model, called Fractal Gaussian Network (FGN), that embodies well-defined and analytically tractable fractal structures. Such fractal structures have been empirically observed in diverse applications. FGNs interpolate continuously between the popular purely random geometric graphs (a.k.a. the Poisson Boolean network), and random graphs with increasingly fractal behavior. In fact, they form a parametric family of sparse random geometric graphs that are parametrized by a fractality parameter which governs the strength of the fractal structure. FGNs are driven by the latent spatial geometry of Gaussian Multiplicative Chaos (GMC), a canonical model of fractality in its own right. We asymptotically characterize the expected number of edges, triangles, cliques and hub-and-spoke motifs in FGNs, unveiling a distinct pattern in their scaling with the size…
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
