Detecting degree symmetries in networks

dc.creatorHolme, Petter
dc.date2006-05-03
dc.date.accessioned2026-07-07T07:14:53Z
dc.date.available2026-07-07T07:14:53Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/physics/0605029
dc.identifierhttp://arxiv.org/abs/physics/0605029
dc.identifierPhys. Rev. E 74, 036107 (2006)
dc.identifierdoi:10.1103/PhysRevE.74.036107
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113067
dc.subjectData Analysis, Statistics and Probability
dc.subjectPhysics and Society
dc.titleDetecting degree symmetries in networks
dc.typetext

Files

Collections