Multifractal Network Generator
G. Palla, L. Lovasz, T. Vicsek

TL;DR
This paper presents a simple yet versatile multifractal network generator that can produce networks with diverse statistical properties, useful for modeling and testing hypotheses in complex systems.
Contribution
It introduces a novel multifractal approach to generate networks with prescribed properties using a two-parameter model based on singular measures.
Findings
Able to generate networks with various degree and clustering distributions
Provides analytic expressions for key network characteristics
Uses simulated annealing to optimize parameters
Abstract
We introduce a new approach to constructing networks with realistic features. Our method, in spite of its conceptual simplicity (it has only two parameters) is capable of generating a wide variety of network types with prescribed statistical properties, e.g., with degree- or clustering coefficient distributions of various, very different forms. In turn, these graphs can be used to test hypotheses, or, as models of actual data. The method is based on a mapping between suitably chosen singular measures defined on the unit square and sparse infinite networks. Such a mapping has the great potential of allowing for graph theoretical results for a variety of network topologies. The main idea of our approach is to go to the infinite limit of the singular measure and the size of the corresponding graph simultaneously. A very unique feature of this construction is that the complexity of the…
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.
