Detecting degree symmetries in networks.

  title={Detecting degree symmetries in networks.},
  author={Petter Holme},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={74 3 Pt 2},
  • P. Holme
  • Published 3 May 2006
  • Mathematics, Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
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… 

Figures and Tables from this paper

Characterization of Symmetry of Complex Networks
Using three indexes based on the natural action of the automorphism group Aut ( Γ ) of Γ on the vertex set V of a given network Γ = Γ ( V, E ) , one can get a quantitative characterization of how symmetric a network is and can compare the symmetry property of different networks.
Hidden Symmetries in Real and Theoretical Networks
Emergence of symmetry in complex networks.
An improved version of the Barabaśi-Albert model integrating similar linkage pattern successfully reproduces the symmetry of real networks, indicating that similar linkagepattern is the underlying ingredient that is responsible for the emergence of symmetry in complex networks.
Concentric network symmetry
Symmetry in complex networks
Resilience of Small Social Networks
The ability of a network to retain one or more specified properties under perturbation of its structure is referred to as resilience. In this thesis, we focus on the resilience of small social
Quasi-symmetries in complex networks: a dynamical model approach
This work defines the ‘dual-network’, a weighted network that effectively encodes all the information of quasi-symmetries in the original network, and provides a benchmark to determine whether a network has a more complex pattern than that of a random network with regard to quasi-SYMMetries.
Scale-free tree graphs are more symmetrical
It is found that, in contrast to random tree graph models, scale-free tree graphs are richly symmetric.
Network Specializations, Symmetries, and Spectral Properties
This dissertation introduces three techniques for network sciences, a series of new models for describing network growth, and a generalization of network symmetry, called latent symmetry, which is extended to work for every automorphism.
On Automorphism Groups of Networks


Vertex similarity in networks.
A measure of similarity based on the concept that two vertices are similar if their immediate neighbors in the network are themselves similar is proposed, which leads to a self-consistent matrix formulation of similarity that can be evaluated iteratively using only a knowledge of the adjacency matrix of the network.
Analysis of weighted networks.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is pointed out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighting graphs to weighted ones as well.
Assortative mixing in networks.
  • M. Newman
  • Computer Science
    Physical review letters
  • 2002
This work proposes a model of an assortatively mixed network and finds that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.
Modularity from fluctuations in random graphs and complex networks.
It is shown both numerically and analytically that random graphs and scale-free networks have modularity and it is argued that this fact must be taken into consideration to define statistically significant modularity in complex networks.
A measure of similarity between graph vertices
It is pointed out that Kleinberg's "hub and authority" method to identify web-pages relevant to a given query can be viewed as a special case of the similarity matrix definition in the case where one of the graphs has two vertices and a unique directed edge between them.
The Structure and Function of Complex Networks
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Currency and commodity metabolites: their identification and relation to the modularity of metabolic networks.
It is argued that cross-modular edges are the key for the robustness of metabolism, found to be more modular than random networks but far from perfectly divisible into modules.
Role-similarity based functional prediction in networked systems: application to the yeast proteome
  • P. Holme, M. Huss
  • Computer Science
    Journal of The Royal Society Interface
  • 2005
We propose a general method to predict functions of vertices where (i) the wiring of the network is somehow related to the vertex functionality and (ii) a fraction of the vertices are functionally
Social network analysis - methods and applications
This paper presents mathematical representation of social networks in the social and behavioral sciences through the lens of dyadic and triadic interaction models, which provide insights into the structure and dynamics of relationships between actors and groups.