# Network connectivity during mergers and growth: optimizing the addition of a module.

@article{Taylor2011NetworkCD, title={Network connectivity during mergers and growth: optimizing the addition of a module.}, author={Dane Taylor and Juan G. Restrepo}, journal={Physical review. E, Statistical, nonlinear, and soft matter physics}, year={2011}, volume={83 6 Pt 2}, pages={ 066112 } }

The principal eigenvalue λ of a network's adjacency matrix often determines dynamics on the network (e.g., in synchronization and spreading processes) and some of its structural properties (e.g., robustness against failure or attack) and is therefore a good indicator for how "strongly" a network is connected. We study how λ is modified by the addition of a module, or community, which has broad applications, ranging from those involving a single modification (e.g., introduction of a drug into a…

## 14 Citations

Optimizing interconnections to maximize the spectral radius of interdependent networks.

- Computer Science, MedicinePhysical review. E
- 2017

This paper derives formulas for the estimation of the spectral radius of interdependent networks and employs these results to develop a suite of algorithms that are applicable to different parameter regimes, and demonstrates the applicability of these algorithms via extensive simulations.

Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks

- Computer Science, PhysicsMultiscale Modeling & Simulation
- 2021

A linear-algebraic framework that generalizes eigenvector-based centralities---including PageRank---to provide a common framework for two popular classes of multilayer networks: multiplex networks with layers encoding different types of relationships and temporal networks in which the relationships change in time.

Enhancement of Synchronizability in Networks with Community Structure through Adding Efficient Inter-Community Links

- Computer Science, MathematicsIEEE Transactions on Network Science and Engineering
- 2016

A framework for enhancing synchronizability of networks with community structure through adding efficient inter-community links through an efficient rewiring algorithm, which uses a criterion based on eigenvectors corresponding to the largest and second smallest eigenvalues of the Laplacian matrix.

Synchronization of Heterogeneous Oscillators Under Network Modifications: Perturbation and Optimization of the Synchrony Alignment Function

- Physics, Computer ScienceSIAM J. Appl. Math.
- 2016

This work studies how network modifications affect the synchronization properties of network-coupled dynamical systems that have heterogeneous node dynamics (e.g., phase oscillators with non-identical frequencies), which is often the case for real-world systems.

Erosion of synchronization: Coupling heterogeneity and network structure.

- Mathematics, MedicinePhysica D. Nonlinear phenomena
- 2016

This work considers the important case of heterogeneous coupling functions and extends previous results by deriving analytical predictions for the total erosion of synchronization in network-coupled phase oscillators.

Perturbation analysis and comparison of network synchronization methods.

- Medicine, Computer SciencePhysical review. E
- 2019

This work analyzes five methods of network synchronization enhancement, including the link removal, node removal, dividing hub node, pull control, and pinning control methods, and obtains explicit expressions for eigenvalue changes, and finds that the pull control method is remarkable.

Quantifying the Dynamics of Coupled Networks of Switches and Oscillators

- Physics, MedicinePloS one
- 2012

A new modeling framework that describes the dynamics of networks composed of both oscillators and switches and provides the ability to incorporate mechanisms that underlie the synchronized stimulus response ubiquitous in biochemical systems is introduced.

Quantifying the Dynamics of Coupled Networks of Switches and Oscillators

- Computer ScienceRECOMB
- 2012

A theory for the network-level dynamics that result from coupling oscillatory and switch-like components have not been studied comprehensively previously is formulated.

Evolution of Directed Triangle Motifs in the Google+ OSN

- Mathematics, Computer ScienceArXiv
- 2015

It is found that users in more symmetric triangle motifs live closer together, indicating more personal relationships, and that many triangles evolve into less-connected motifs (with less edges), suggesting that growth also comes with pruning.

Eigenvector-Based Centrality Measures for Temporal Networks

- Mathematics, Computer ScienceMultiscale Model. Simul.
- 2017

This paper applies a principled generalization of network centrality measures that is valid for any eigenvector-based centrality to three empirical temporal networks, and introduces the concepts of marginal and conditional centralities, which facilitate the study of centrality trajectories over time.

## References

SHOWING 1-10 OF 81 REFERENCES

Predicting criticality and dynamic range in complex networks: effects of topology.

- Computer Science, MedicinePhysical review letters
- 2011

A general theoretical approach to study the effects of network topology on dynamic range is developed, which quantifies the range of stimulus intensities resulting in distinguishable network responses and finds that the largest eigenvalue of the weighted network adjacency matrix governs the network dynamic range.

Robust emergent activity in dynamical networks.

- Mathematics, PhysicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2006

This work develops a macroscopic description of the evolution of a random weighted network with complex nonlinear dynamics at each node in terms of the statistical features of the subnetwork of active nodes with similar asymptotic characteristics.

Approximating spectral impact of structural perturbations in large networks.

- Mathematics, PhysicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2010

A theory for estimating the change of the largest eigenvalue of the adjacency matrix or the extreme eigenvalues of the graph Laplacian when small but arbitrary set of links are added or removed from the network is developed.

Weighted percolation on directed networks.

- Computer Science, MedicinePhysical review letters
- 2008

An analysis of the percolation transition for general node removal strategies valid for locally treelike directed networks and applicable to situations not covered by previous works is presented.

Emergence of coherence in complex networks of heterogeneous dynamical systems.

- Computer Science, MedicinePhysical review letters
- 2006

This work finds that the critical coupling strength at which a transition to synchrony takes place depends separately on the dynamics of the individual uncoupled systems and on the largest eigenvalue of the adjacency matrix of the coupling network.

Emergence of synchronization in complex networks of interacting dynamical systems

- Mathematics
- 2006

Abstract We study the emergence of coherence in large complex networks of interacting heterogeneous dynamical systems. We show that for a large class of dynamical systems and network topologies there…

Spectral properties of networks with community structure.

- Mathematics, MedicinePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2009

It is shown that in many cases, the spectrum of eigenvalues of the adjacency matrix of a network with community structure gives a clear indication of the number of communities in the network.

Networks, topology and dynamics : theory and applications to economics and social systems

- Economics
- 2009

Tutorials.- Some Topics in Graph Theory.- From Graph Theory to Models of Economic Networks. A Tutorial.- Strategic Interaction, Economic Models and Networks.- Games of Coalition and Network…

Complexity vs. stability in small-world networks

- Physics, Mathematics
- 2005

According to the May–Wigner stability theorem, increasing the complexity of a network inevitably leads to its destabilization, such that a small perturbation will be able to disrupt the entire…

Characterizing the dynamical importance of network nodes and links.

- Computer Science, PhysicsPhysical review letters
- 2006

It is shown how the characterization of the dynamical importance of nodes can be affected by degree-degree correlations and network community structure, and how this can be used to optimize techniques for controlling certain network dynamical processes.