Stochastic and mixed flower graphs
- 22 May 2020
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 101 (5) , 052315
Abstract
Stochasticity is introduced to a well studied class of recursively grown graphs: -flower nets, which have power-law degree distributions as well as small-world properties (when . The stochastic variant interpolates between different (deterministic) flower graphs thus adding flexibility to the model. The random multiplicative growth process involved, however, leads to a spread ensemble of networks with finite variance for the number of links, nodes, and loops. Nevertheless, the degree exponent and loopiness exponent attain unique values in the thermodynamic limit of infinitely large graphs. We also study a class of mixed flower networks, closely related to the stochastic flowers, but which are grown recursively in a deterministic way. The deterministic growth of mixed flower-nets eliminates ensemble spreads, and their recursive growth allows for exact analysis of their (uniquely defined) mixed properties.
Keywords
All Related Versions
Funding Information
- Army Research Office (N68164-EG)
- Defense Advanced Research Projects Agency
This publication has 29 references indexed in Scilit:
- A NETWORK MODEL GENERATED FROM THE RECURSIVE GRAPH BASED ON POLYGONInternational Journal of Modern Physics C, 2013
- Finding long cycles in graphsPhysical Review E, 2007
- Percolation in hierarchical scale-free netsPhysical Review E, 2007
- Statistics of cycles in large networksPhysical Review E, 2006
- Statistics of cycles: how loopy is your network?Journal of Physics A: General Physics, 2005
- What is special about diffusion on scale-free nets?New Journal of Physics, 2005
- Diffusion-limited friendship network: A model for six degrees of separationPhysical Review E, 2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Spectra of “real-world” graphs: Beyond the semicircle lawPhysical Review E, 2001
- Connectivity of Growing Random NetworksPhysical Review Letters, 2000