What are the best concentric descriptors for complex networks

  title={What are the best concentric descriptors for complex networks},
  author={L. D. Costa and R. Andrade},
  journal={New Journal of Physics},
This work reviews several concentric measurements of the topology of complex networks and then applies feature selection concepts and methods in order to quantify the relative importance of each measurement with respect to the discrimination between four representative theoretical network models, namely Erdos–Renyi, Barabasi–Albert, Watts–Strogatz, as well as a geographical type of network. Progressive randomizations of the geographical model have also been considered. The obtained results… Expand

Figures and Tables from this paper

Concentric characterization and classification of complex network nodes: Application to an institutional collaboration network
Previous methodologies based on concentric measurements are extended, by studying the possibility of using agglomerative clustering methods, in order to obtain a set of functional groups of nodes, considering particular institutional collaboration network nodes, including various known communities. Expand
Measuring distances between complex networks
Abstract A previously introduced concept of higher order neighborhoods in complex networks, [R.F.S. Andrade, J.G.V. Miranda, T.P. Lobao, Phys. Rev. E 73 (2006) 046101] is used to define a distanceExpand
Range-limited Centrality Measures in Complex Networks
An efficient method is introduced that generates for every node and every edge its betweenness centrality based on shortest paths of lengths not longer than ℓ=1,...,L in the case of nonweighted networks, and for weighted networks the corresponding quantities based on minimum weight paths with path weights not larger than w(ℓ)=⚓Δ, ™=1,2...,L=R/Δ. Expand
A pattern recognition approach to complex networks
Complex networks exist in many areas of science such as biology, neuroscience, engineering, and sociology. The growing development of this area has led to the introduction of several topological andExpand
Generalized connectivity between any two nodes in a complex network.
This analysis revealed that the number of paths can provide a better discrimination of network models than traditional network measurements and that the long-range connectivity tends to be limited in these networks and may be strongly related to network growth and organization. Expand
Seeking the best Internet Model
The models of the Internet reported in the literature are mainly aimed at reproducing the scale-free structure, the high clustering coefficient and the small world effects found in the real Internet,Expand
Topological-collaborative approach for disambiguating authors’ names in collaborative networks
This work derives a hybrid approach based on authors’ collaboration patterns and topological features of collaborative networks that shows that the combination of strategies, in most cases, performs better than the traditional approach which disregardsTopological features. Expand
Modeling the Evolution of Complex Networks through the Path-Star Transformation and Optimal Multivariate Methods
The path-star transformation (in its uniform and preferential versions) is introduced as a means to model such network transformations where paths give rise to stars of connectivity and it is shown that while the US highways network adheres closely to a geographical network model, its path- star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network. Expand
Discriminating complex networks through supervised NDR and Bayesian classifier
Discriminating complex networks is a particularly important task for the purpose of the systematic study of networks. In order to discriminate unknown networks exactly, a large set of networkExpand
Multiresolution community detection for megascale networks by information-based replica correlations.
  • P. Ronhovde, Z. Nussinov
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
A Potts model community detection algorithm is used to accurately and quantitatively evaluate the hierarchical or multiresolution structure of a graph and has an accuracy that ranks among the best of currently available methods. Expand


Hierarchical Characterization of Complex Networks
The current work considers the concept of virtual hierarchies established around each node and the respectively defined hierarchical node degree and clustering coefficient, complemented by new hierarchical measurements, in order to obtain a powerful set of topological features of complex networks. Expand
A generalized approach to complex networks
Abstract.This work describes how the formalization of complex network concepts in terms of discrete mathematics, especially mathematical morphology, allows a series of generalizations and importantExpand
Characterization of complex networks: A survey of measurements
This article presents a survey of measurements capable of expressing the most relevant topological features of complex networks and includes general considerations about complex network characterization, a brief review of the principal models, and the presentation of the main existing measurements. Expand
Diversity of graphs with highly variable connectivity.
  • D. Alderson, Lun Li
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
It is shown how a simple structural metric characterizes key differences between graphs having the same degree sequence, and how the (often implicit) choice of a background set against which to measure graph features has serious implications for the interpretation and comparability of graph theoretic descriptions. Expand
Neighborhood properties of complex networks.
The families originated by the well known linear and the Erdös-Renyi networks are found to be invariant, in the sense that the spectra of Ml are the same, up to finite size effects. Expand
Evolution of networks
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated. Expand
Statistical mechanics of complex networks
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. Expand
Ego-centered networks and the ripple effect
  • M. Newman
  • Computer Science, Physics
  • Soc. Networks
  • 2003
This work argues that oneOs acquaintances, oneOs immediate neighbors in the acquaintance network, are far from being a random sample of the population, and that this biases the numbers of neighbors two and more steps away, and presents an improved theoretical model which gives significantly better results. Expand
The hierarchical backbone of complex networks.
  • L. D. Costa
  • Computer Science, Medicine
  • Physical review letters
  • 2004
This Letter presents how the interpretation of the network weight matrix as a transition matrix allows the hierarchical backbone to be identified and characterized in terms of the concepts of hierarchical degree, which expresses the total weights of virtual edges established along successive transitions. Expand
Complex networks: Structure and dynamics
Coupled biological and chemical systems, neural networks, social interacting species, the Internet and the World Wide Web, are only a few examples of systems composed by a large number of highlyExpand