Stochastic and mixed flower graphs

Abstract

Stochasticity is introduced to a well studied class of recursively grown graphs: $(u,v)$-flower nets, which have power-law degree distributions as well as small-world properties (when $u=1$). The stochastic variant interpolates between different (deterministic) flower graphs and might better model real-world networks. 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.

arXiv comment11 pages, 6 figures

References in corpus (25)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Random graphs with arbitrary degree distributions and their applications
• Evolution of networks
• Mixing patterns in networks
• Connectivity of Growing Random Networks
• Pseudofractal Scale-free Web
• Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
• Deterministic Scale-Free Networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Recursive graphs with small-world scale-free properties
• Loops of any size and Hamilton cycles in random scale-free networks
• Percolation in Hierarchical Scale-Free Nets
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• Deterministic Small-World Networks
• A general geometric growth model for pseudofractal scale-free web
• Statistics of Cycles: How Loopy is your Network?
• Evolving small-world networks with geographical attachment preference
• Deterministic hierarchical networks
• Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
• Statistics of cycles in large networks
• Deterministic weighted scale-free small-world networks
• Finding long cycles in graphs
• Diffusion limited friendship network: A model for six degrees of separation

Cited by in corpus (3)

• A general model of hierarchical fractal scale-free networks
• Spanning Trees of Recursive Scale-Free Graphs
• Scale-free tree network with an ultra-large diameter