Networks in Motion

@article{Motter2012NetworksIM,
  title={Networks in Motion},
  author={Adilson E. Motter and R{\'e}ka Albert},
  journal={ArXiv},
  year={2012},
  volume={abs/1206.2369}
}
Networks that govern communication, growth, herd behavior, and other key processes in nature and society are becoming increasingly amenable to modeling, forecast, and control. 

Figures from this paper

Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks

Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks is presented, which describes how Boolean networks are modeled and how these models can be modified for distributed systems.

Complex Structures and Behavior from Elementary Adaptive Network Automata

Investigating an extremely simple instance of this computational paradigm of adaptive networks finds particular rules and parameters for which power-law statistics emerge, which provides evidence that this fundamental framework is able to provide robust network structure evolution towards a critical state, an issue of great current interest.

Network observability transitions.

A new type of percolation transition is shown, here termed a network observability transition, which is solved analytically for the configuration model and demonstrates a dual role of the network's community structure, which both facilitates optimal measurement placement and renders the networks substantially more sensitive to "observability attacks".

Information dynamic spectrum characterizes system instability toward critical transitions

A novel information dynamic spectrum framework and a probabilistic light cone method to automate the analysis and suggest that early detecting critical transitions of synchronizations, sudden collapse, and exponential growth is possible.

Meta-rules for Networks

This article proposes conceptual approaches for both the design and implementation of network linkages, that dependent on context, should respect interlinking topological and parametric constraints,

Dynamical Systems on Networks: A Tutorial

This tutorial should be helpful for junior and senior undergraduate students, graduate students, and researchers from mathematics, physics, and engineering who seek to study dynamical systems on networks but who may not have prior experience with graph theory or networks.

Control of complex networks requires both structure and dynamics

This work studies Boolean network ensembles of network motifs as well as three models of biochemical regulation, demonstrating that structure-only methods both undershoot and overshoot the number and which sets of critical variables best control the dynamics of these models.

Group Measures and Modeling for Social Networks

It is shown how some measures used in social network analysis (degree, betweenness, and closeness) can be also generalized to consider a group as a whole entity.

Complex, inter-networked economic and social systems

Complex Networks have experienced an explosive growth since the end of the 20th century. While the application of graph theory to the understanding of everyday world has a long history, it was of

Multidisciplinary applications of complex networks modeling, simulation, visualization, and analysis

*Correspondence: cgg@unam.mx 1Universidad Nacional Autonoma de Mexico, A.P. 20-726, 01000 Mexico city, D.F, Mexico Full list of author information is available at the end of the article Complex
...

References

SHOWING 1-10 OF 50 REFERENCES

Explosive Percolation in Random Networks

It is shown that incorporating a limited amount of choice in the classic Erdös-Rényi network formation model causes its percolation transition to become discontinuous.

A simple model of global cascades on random networks

  • D. Watts
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
It is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but anincreasingly heterogeneous degree distribution makes it less vulnerable.

Network synchronization landscape reveals compensatory structures, quantization, and the positive effect of negative interactions

It is shown that networks with best complete synchronization, least coupling cost, and maximum dynamical robustness, have arbitrary complexity but quantized total interaction strength, which constrains the allowed number of connections.

Dynamical Processes on Complex Networks

A new and recent account presents a comprehensive explanation of the effect of complex connectivity patterns on dynamical phenomena in a vast number of everyday systems that can be represented as large complex networks.

Discovering Network Structure Beyond Communities

The results of applying the proposed exploratory method for discovering groups of nodes characterized by common network properties suggest the possibility that most group structures lurk undiscovered in the fast-growing inventory of social, biological, and technological networks of scientific interest.

The role of the airline transportation network in the prediction and predictability of global epidemics

A stochastic computational framework for the forecast of global epidemics that considers the complete worldwide air travel infrastructure complemented with census population data and defines a set of quantitative measures able to characterize the level of heterogeneity and predictability of the epidemic pattern.

Epidemic spreading in scale-free networks.

A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.

Catastrophic cascade of failures in interdependent networks

This work develops a framework for understanding the robustness of interacting networks subject to cascading failures and presents exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks.

Critical phenomena in complex networks

A wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, $k$-core percolations, phenomena near epidemic thresholds, condensation transitions,critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks are mentioned.

Explosive Percolation Is Continuous

A mathematical proof shows that in many models of the growth of network connectivity, phase transitions are continuous, although related models in which the number of nodes sampled may grow with the network size can indeed exhibit explosive percolation.