Citation
Holme, P. (2006). Detecting degree symmetries in networks.
Phys Rev E Stat Nonlin Soft Matter Phys. vol. 74 (3 Pt 2) pp. 036107
Abstract
The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry--the property that many paths going out from a vertex have overlapping degree sequences. These measures are evaluated on artificial and real networks. Specifically we consider vertices in the human metabolic network. We also measure the average degree-symmetry coefficient for different classes of real-world network. We find that most studied examples are weakly positively degree symmetric. The exceptions are an airport network (having a negative degree-symmetry coefficient) and one-mode projections of social affiliation networks that are rather strongly degree symmetric.
URL
http://arxiv.org/abs/physics/0605029Keyword(s)
Algorithms
Notes
Holme, Petter
Reference Type
Journal Article
Journal Title
Phys Rev E Stat Nonlin Soft Matter Phys
Author(s)
Holme, P.
Year Published
2006
Volume Number
74
Issue Number
3 Pt 2
Edition
2006/10/10
ISSN/ISBN
1539-3755 (Print)
DOI
1539-3755 (Print)
Reference ID
1781