title: Multifractal network generator.
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 with the increasing system size the generated graphs become topologically more structured. We present analytic expressions derived from the parameters of the--to be iterated--initial generating measure for such major characteristics of graphs as their degree, clustering coefficient, and assortativity coefficient distributions. The optimal parameters of the generating measure are determined from a simple simulated annealing process. Thus, the present work provides a tool for researchers from a variety of fields (such as biology, computer science, biology, or complex systems) enabling them to create a versatile model of their network data.
authors.affiliation: Statistical and Biological Physics Research Group of the Hungarian Academy of Sciences, Eötvös University, Budapest, Hungary.
authors.forename: Gergely
authors.initials: G
authors.lastname: Palla
authors.forename: László
authors.initials: L
authors.lastname: Lovász
authors.forename: Tamás
authors.initials: T
authors.lastname: Vicsek
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D017709:Fractals; D008962:Models, Theoretical
references.citation: Nature. 1998 Jun 4;393(6684):440-2
references.pmid: 9623998
references.citation: Phys Rev E Stat Nonlin Soft Matter Phys. 2004 Dec;70(6 Pt 2):066146
references.pmid: 15697473
references.citation: Nature. 2005 Jun 9;435(7043):814-8
references.pmid: 15944704
references.citation: Proc Natl Acad Sci U S A. 2002 Jun 11;99(12):7821-6
references.pmid: 12060727
references.citation: Proc Natl Acad Sci U S A. 2002 Dec 10;99(25):15879-82
references.pmid: 12466502
references.citation: Nature. 2005 Jan 27;433(7024):392-5
references.pmid: 15674285
references.citation: Nature. 2008 May 1;453(7191):98-101
references.pmid: 18451861
references.citation: Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Sep;68(3 Pt 2):036112
references.pmid: 14524837
references.citation: Phys Rev E Stat Nonlin Soft Matter Phys. 2005 Sep;72(3 Pt 2):036133
references.pmid: 16241541
references.citation: Proc Natl Acad Sci U S A. 2007 May 22;104(21):8685-90
references.pmid: 17502601
references.citation: Phys Rev Lett. 2002 Dec 16;89(25):258702
references.pmid: 12484927
references.citation: Science. 1999 Oct 15;286(5439):509-12
references.pmid: 10521342