Detecting degree symmetries in networks

Petter Holme
Phys. Rev. E 74, 036107 – Published 14 September 2006

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.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 2 May 2006

DOI:https://doi.org/10.1103/PhysRevE.74.036107

©2006 American Physical Society

Authors & Affiliations

Petter Holme

  • Department of Computer Science, University of New Mexico, Albuquerque, New Mexico 87131, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 74, Iss. 3 — September 2006

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×