Networks: Structure and Dynamics

  title={Networks: Structure and Dynamics},
  author={Erzs{\'e}bet Ravasz Regan},
  booktitle={Encyclopedia of Complexity and Systems Science},
  • E. Regan
  • Published in
    Encyclopedia of Complexity…
  • Computer Science
3 Structural Properties of Complex Networks 7 3.1 Simple Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.1.1 Degree Distributon . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.1.2 Paths on Networks, Small Worlds and Betweenness . . . . . . . . 10 3.1.3 Clustering and Network Motifs . . . . . . . . . . . . . . . . . . . 11 3.1.4 Degree Correlations and Mixing Patterns . . . . . . . . . . . . . . 12 3.1.5 Communities, Hierarchy and Fractality… 

Quantifying Loopy Network Architectures

This work presents an algorithmic framework, the hierarchical loop decomposition, that allows mapping loopy networks to binary trees, preserving in the connectivity of the trees the architecture of the original graph, and performs a quantitative statistical comparison between predictions of theoretical models and naturally occurring loopy graphs.

Environment and Planning B: Planning and Design 2012, volume 39, pages 308^325

The results demonstrate that, even without a centralized authority, road networks can display the property of self-organization and evolution, and that, in the absence of intervention, the degree to which a network structure is tree-like or web-like results from the underlying economies.

Environment and Planning B: Planning and Design 2009, volume 36, pages 450^465

This paper examines the relationship between street centrality and densities of commercial and service activities in the city of Bologna, northern Italy. Street centrality is calibrated in a multiple

Optimal Information Security Investment in Modern Social Networking

For further clarification of methodological issues of the social network’s information security we stratified the systems that support human relations into three components of different nature:



Community structure in social and biological networks

  • M. GirvanM. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.

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.

Finding community structure in very large networks.

A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.

The architecture of complex weighted networks.

This work studies the scientific collaboration network and the world-wide air-transportation network, which are representative examples of social and large infrastructure systems, respectively, and defines appropriate metrics combining weighted and topological observables that enable it to characterize the complex statistical properties and heterogeneity of the actual strength of edges and vertices.

Classification of scale-free networks

It is shown that the betweenness centrality displays a power-law distribution with an exponent η, which is robust, and is used to classify the scale-free networks, including two universality classes with η ≈ 2.2(1) and 2.0, respectively.

Random graphs with arbitrary degree distributions and their applications.

It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

Distance, dissimilarity index, and network community structure.

  • Haijun Zhou
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
This work calculates the dissimilarity index between nearest-neighboring vertices of a network and design an algorithm to partition these vertices into communities that are hierarchically organized, and identifies many clusters that have well defined biological functions.

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.

Self-similarity of complex networks

A power-law relation is identified between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.