| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Sao Paulo, Inst Fis Sao Carlos, BR-13560970 Sao Paulo - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | NEW JOURNAL OF PHYSICS; v. 11, JAN 30 2009. |
| Web of Science Citations: | 8 |
| Abstract | |
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel approach which extends from single nodes to the whole network level by considering non-overlapping subgraphs (i.e. connected components) and their interrelationships and distribution through the network. Though such subgraphs can be completely general, our methodology focuses on the cases in which the nodes of these subgraphs share some special feature, such as being critical for the proper operation of the network. The methodology of subgraph characterization involves two main aspects: (i) the generation of histograms of subgraph sizes and distances between subgraphs and (ii) a merging algorithm, developed to assess the relevance of nodes outside subgraphs by progressively merging subgraphs until the whole network is covered. The latter procedure complements the histograms by taking into account the nodes lying between subgraphs, as well as the relevance of these nodes to the overall subgraph interconnectivity. Experiments were carried out using four types of network models and five instances of real-world networks, in order to illustrate how subgraph characterization can help complementing complex network-based studies. (AU) | |
| FAPESP's process: | 05/00587-5 - Mesh (graph) modeling and techniques of pattern recognition: structure, dynamics and applications |
| Grantee: | Roberto Marcondes Cesar Junior |
| Support type: | Research Projects - Thematic Grants |