Rotated multifractal network generator
Open Access
- 1 February 2011
- journal article
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2011 (2) , P02003
Abstract
The recently introduced multifractal network generator (MFNG), has been shown to provide a simple and flexible tool for creating random graphs with very diverse features. The MFNG is based on multifractal measures embedded in 2d, leading also to isolated nodes, whose number is relatively low for realistic cases, but may become dominant in the limiting case of infinitely large network sizes. Here we discuss the relation between this effect and the information dimension for the 1d projection of the link probability measure (LPM), and argue that the node isolation can be avoided by a simple transformation of the LPM based on rotation.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Community detection in graphsPhysics Reports, 2010
- Recent developments in exponential random graph (p*) models for social networksSocial Networks, 2007
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005
- Community structure in social and biological networksProceedings of the National Academy of Sciences of the United States of America, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Emergence of Scaling in Random NetworksScience, 1999
- On power-law relationships of the Internet topologyACM SIGCOMM Computer Communication Review, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- Logit Models and Logistic Regressions for Social Networks: I. An Introduction to Markov Graphs and pPsychometrika, 1996
- Markov GraphsJournal of the American Statistical Association, 1986