Hierarchical Random Graphs Based on Motifs
arXiv:1503.08583
Abstract
Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are proposed in which the motifs appear at each hierarchical level. A rigorous construction of such graphs is given and a number of their structural properties are analyzed. This includes degree distribution, amenability, clustering, and the small world property. For one of the motifs, annealed phase transitions in the Ising model based on the corresponding graph are also studied.
arXiv comment8 figures. arXiv admin note: substantial text overlap with arXiv:1106.4399
References in corpus (5)
- The structure and function of complex networks
- Subgraphs in random networks
- Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
- Subgraphs and network motifs in geometric networks
- Renormalization Group on hierarchical lattices in finite dimensional disordered Ising and Blume-Emery-Griffiths Models