REVIEW 1 cited by
Local symmetries in complex networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Symmetry -- invariance to certain operators -- is a fundamental concept in many branches of physics. We propose ways to measure symmetric properties of vertices, and their surroundings, in networks. To be stable to the randomness inherent in many complex networks, we consider measures that are continuous rather than dichotomous. The main operator we suggest is permutations of the paths of a certain length leading out from a vertex. If these paths are more similar (in some sense) than expected, the vertex is a local center of symmetry in networks. We discuss different precise definitions based on this idea and give examples how different symmetry coefficients can be applied to protein interaction networks.
Forward citations
Cited by 1 Pith paper
-
Symmetries of weighted networks: weight approximation method and its application to food webs
Logarithmic binning of edge weights turns weighted food webs into graphs where automorphisms appear, and the resulting orbits are almost always of size two or three.
Discussion (0). Continue with ORCID to comment.