Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Concentric network symmetry

Full text
Author(s):
Silva, Filipi N. [1] ; Comin, Cesar H. [1] ; Peron, Thomas K. D. M. [1] ; Rodrigues, Francisco A. [2] ; Ye, Cheng [3] ; Wilson, Richard C. [3] ; Hancock, Edwin R. [3] ; Costa, Luciano da F. [1]
Total Authors: 8
Affiliation:
[1] Univ Sao Paulo, Sao Carlos Inst Phys, POB 668, BR-13560970 Sao Carlos, SP - Brazil
[2] Univ Sao Paulo, Inst Math & Comp Sci, POB 668, BR-13560970 Sao Carlos, SP - Brazil
[3] Univ York, Dept Comp Sci, York YO10 5GH, N Yorkshire - England
Total Affiliations: 3
Document type: Journal article
Source: INFORMATION SCIENCES; v. 333, p. 61-80, MAR 10 2016.
Web of Science Citations: 4
Abstract

Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify the symmetries around nodes, which we call connectivity patterns. We develop two topological transformations that allow a concise characterization of the different types of symmetry appearing on networks and apply these concepts to six network models, namely the Erdos-Renyi, Barabasi-Albert, random geometric graph, Waxman, Voronoi and rewired Voronoi. Real-world networks, namely the scientific areas of Wikipedia, the world-wide airport network and the street networks of Oldenburg and San Joaquin, are also analyzed in terms of the proposed symmetry measurements. Several interesting results emerge from this analysis, including the high symmetry exhibited by the Erdos-Renyi model. Additionally, we found that the proposed measurements present low correlation with other traditional metrics, such as node degree and betweenness centrality. Principal component analysis is used to combine all the results, revealing that the concepts presented here have substantial potential to also characterize networks at a global scale. We also provide a real-world application to the financial market network. (C) 2015 Elsevier Inc. All rights reserved. (AU)

FAPESP's process: 13/26416-9 - Modelling of dynamical processes in complex networks
Grantee:Francisco Aparecido Rodrigues
Support type: Regular Research Grants
FAPESP's process: 12/50986-7 - Graph spectra and complex network evolution
Grantee:Luciano da Fontoura Costa
Support type: Regular Research Grants
FAPESP's process: 11/22639-8 - Unveiling the relationship between structure and dynamics on modular networks
Grantee:Cesar Henrique Comin
Support type: Scholarships in Brazil - Doctorate
FAPESP's process: 12/22160-7 - Synchronization of Kuramoto oscillators in complex networks
Grantee:Thomas Kaue Dal Maso Peron
Support type: Scholarships in Brazil - Doctorate
FAPESP's process: 11/50761-2 - Models and methods of e-Science for life and agricultural sciences
Grantee:Roberto Marcondes Cesar Junior
Support type: Research Projects - Thematic Grants