Generating Hierarchically Modular Networks via Link Switching
arXiv:0903.2598
Abstract
This paper introduces a method to generate hierarchically modular networks with prescribed node degree list by link switching. Unlike many existing network generating models, our method does not use link probabilities to achieve modularity. Instead, it utilizes a user-specified topology to determine relatedness between pairs of nodes in terms of edge distances and links are switched to increase edge distances. To measure the modular-ness of a network as a whole, a new metric called Q2 is proposed. Comparisons are made between the Q [15] and Q2 measures. We also comment on the effect of our modularization method on other network characteristics such as clustering, hierarchy, average path length, small-worldness, degree correlation and centrality. An application of this method is reported elsewhere [12]. Briefly, the generated networks are used as test problems to explore the effect of modularity and degree distribution on evolutionary search algorithms.
Appendix B
References in corpus (17)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Modularity and community structure in networks
- Assortative mixing in networks
- Hierarchical organization of modularity in metabolic networks
- Specificity and stability in topology of protein networks
- Hierarchical structure and the prediction of missing links in networks
- Hierarchical Organization in Complex Networks
- Class of correlated random networks with hidden variables
- Random graphs as models of networks
- Hierarchy Measures in Complex Networks
- Small-world networks and the conformation space of a lattice polymer chain
- Structural constraints in complex networks
- The shortest path to complex networks
- Effect of Degree Distribution on Evolutionary Search