Random Sierpinski network with scale-free small-world and modular structure

Abstract

In this paper, we define a stochastic Sierpinski gasket, on the basis of which we construct a network called random Sierpinski network (RSN). We investigate analytically or numerically the statistical characteristics of RSN. The obtained results reveal that the properties of RSN is particularly rich, it is simultaneously scale-free, small-world, uncorrelated, modular, and maximal planar. All obtained analytical predictions are successfully contrasted with extensive numerical simulations. Our network representation method could be applied to study the complexity of some real systems in biological and information fields.

7 pages, 9 figures; final version accepted for publication in EPJB

References in corpus (28)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Lethality and centrality in protein networks
• Assortative mixing in networks
• The structure of scientific collaboration networks
• The diameter of the world wide web
• Hierarchical organization of modularity in metabolic networks
• The large-scale organization of metabolic networks
• Defining and identifying communities in networks
• Hierarchical Organization in Complex Networks
• Dynamical and correlation properties of the Internet
• The Web of Human Sexual Contacts
• Connectivity of Growing Random Networks
• Large-scale topological and dynamical properties of Internet
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
• Rate equation approach for correlations in growing network models
• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• High dimensional random Apollonian networks
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Exact analytical solution of average path length for Apollonian networks
• Evolving small-world scale-free networks consist of cliques
• Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
• Correlations in random Apollonian network
• Synchronous and Asynchronous Recursive Random Scale-Free Nets
• Vertex labeling and routing in expanded Apollonian networks

Cited by in corpus (7)

• Weighted Fractal Networks
• A unified model for Sierpinski networks with scale-free scaling and small-world effect
• Geographical networks stochastically constructed by a self-similar tiling according to population
• Constructions and properties of a class of random scale-free networks
• An approximative calculation of the fractal structure in self-similar tilings
• Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network
• Simple Derivation of the Lifetime and the Distribution of Faces for a Binary Subdivision Model