The architecture of complex weighted networks.

@article{Barrat2004TheAO,
  title={The architecture of complex weighted networks.},
  author={A. Barrat and M. Barthelemy and R. Pastor-Satorras and A. Vespignani},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  year={2004},
  volume={101 11},
  pages={
          3747-52
        }
}
Networked structures arise in a wide array of different contexts such as technological and transportation infrastructures, social phenomena, and biological systems. These highly interconnected systems have recently been the focus of a great deal of attention that has uncovered and characterized their topological complexity. Along with a complex topological structure, real networks display a large heterogeneity in the capacity and intensity of the connections. These features, however, have… Expand

Figures from this paper

Structure and Traffic on Complex Networks
In a time when large amounts of data about social, economical, technological, and biological systems are produced in a daily bases, complex networks have become a powerful tool to represent theExpand
Vulnerability of weighted networks
In real networks complex topological features are often associated with a diversity of interactions as measured by the weights of the links. Moreover, spatial constraints may also play an importantExpand
Extracting the multiscale backbone of complex weighted networks
TLDR
A filtering method is defined that offers a practical procedure to extract the relevant connection backbone in complex multiscale networks, preserving the edges that represent statistically significant deviations with respect to a null model for the local assignment of weights to edges. Expand
The structure and dynamics of multilayer networks
TLDR
This work offers a comprehensive review on both structural and dynamical organization of graphs made of diverse relationships (layers) between its constituents, and cover several relevant issues, from a full redefinition of the basic structural measures, to understanding how the multilayer nature of the network affects processes and dynamics. Expand
Topological Strata of Weighted Complex Networks
TLDR
This work introduces a novel method, based on persistent homology, to detect particular non-local structures, akin to weighted holes within the link-weight network fabric, which are invisible to existing methods and creates the first bridge between network theory and algebraic topology, which will allow to import the toolset of algebraic methods to complex systems. Expand
Topological Structure of Complex Networks and its Importance in Diffusion
TLDR
In this research, the importance of heterogeneous topological structure of real-world complex networks and its importance in understanding the phenomenon of diffusion in these networks is emphasized. Expand
Classes of complex networks defined by role-to-role connectivity profiles.
TLDR
It is reported that networks with different functions, including the Internet, metabolic, air transportation and protein interaction networks, have distinct patterns of connections among nodes with different roles, and that, as a consequence, complex networks can be classified into two distinct functional classes on the basis of their link type frequency. Expand
The structure and dynamics of multiplex networks
TLDR
This thesis provides a mathematical framework to deal with multiplex networks and suggests metrics to unveil multiplexity from basic node, layer and edge properties to more complicated structure at the microand meso-scale, such as motifs, communities and cores. Expand
The Role of Geography and Traffic in the Structure of Complex Networks
TLDR
The presented results suggest that the interplay between topology, weights and geographical constraints is a key ingredient in order to understand the structure and evolution of many real-world networks. Expand
Scale-free networks as entropy competition.
TLDR
By identifying the connectivities of a node with the number of its nearest neighbors, it is shown that the power law is the most probable degree distribution that both nodes and neighbors, in a reciprocal competition, assume when the respective entropy functions reach their maxima, under mutual constraint. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Statistical mechanics of complex networks
TLDR
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
Hierarchical organization in complex networks.
  • E. Ravasz, A. Barabasi
  • Computer Science, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
TLDR
It is found that several real networks, such as the Worldwideweb, actor network, the Internet at the domain level, and the semantic web obey this scaling law, indicating that hierarchy is a fundamental characteristic of many complex systems. Expand
Evolution of the social network of scientific collaborations
TLDR
The results indicate that the co-authorship network of scientists is scale-free, and that the network evolution is governed by preferential attachment, affecting both internal and external links, and a simple model is proposed that captures the network's time evolution. Expand
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems. Expand
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand
Weighted evolving networks.
TLDR
This paper introduces and investigates the scaling properties of a class of models which assign weights to the links as the network evolves, and indicates that asymptotically the total weight distribution converges to the scaling behavior of the connectivity distribution, but this convergence is hampered by strong logarithmic corrections. Expand
Classes of small-world networks.
TLDR
Evidence of the occurrence of three classes of small-world networks, characterized by a vertex connectivity distribution that decays as a power law law, and the nature of such constraints may be the controlling factor for the emergence of different classes of networks are presented. Expand
Network robustness and fragility: percolation on random graphs.
TLDR
This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree. Expand
Error and attack tolerance of complex networks
TLDR
It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates. Expand
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality.
  • M. Newman
  • Medicine, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
TLDR
It is argued that simple networks such as these cannot capture variation in the strength of collaborative ties and proposed a measure of collaboration strength based on the number of papers coauthored by pairs of scientists, and thenumber of other scientists with whom they coauthored those papers. Expand
...
1
2
3
4
5
...