Maximizing the algebraic connectivity in multilayer networks with arbitrary interconnections

Abstract

The second smallest eigenvalue of the Laplacian matrix is determinative in characterizing many network properties and is known as algebraic connectivity. In this paper, we investigate the problem of maximizing algebraic connectivity in multilayer networks by allocating interlink weights subject to a budget while allowing arbitrary interconnections. For budgets below a threshold, we identify an upper-bound for maximum algebraic connectivity which is independent of interconnections pattern and is reachable with satisfying a certain regularity condition. For efficient numerical approaches in regions of no analytical solution, we cast the problem into a convex framework that explores the problem from several perspectives and, particularly, transforms into a graph embedding problem that is easier to interpret and related to the optimum diffusion phase. Allowing arbitrary interconnections entails regions of multiple transitions, giving more diverse diffusion phases with respect to one-to-one interconnection case. When there is no limitation on the interconnections pattern, we derive several analytical results characterizing the optimal weights by individual Fiedler vectors. We use the ratio of algebraic connectivity and the layer sizes to explain the results. Finally, we study the placement of a limited number of interlinks by greedy heuristics, using the Fiedler vector components of each layer.

arXiv comment46 pages, 25 figures

References in corpus (22)

• Catastrophic cascade of failures in interdependent networks
• Synchronization in complex networks
• Diffusion dynamics on multiplex networks
• Random Walks on Multiplex Networks
• Explosive synchronization in adaptive and multilayer networks
• Abrupt transition in the structural formation of interconnected networks
• Epidemic spreading on interconnected networks
• Network robustness of multiplex networks with interlayer degree correlations
• Robustness of a Tree-like Network of Interdependent Networks
• Optimal Allocation of Interconnecting Links in Cyber-Physical Systems: Interdependence, Cascading Failures and Robustness
• Analysis of complex contagions in random multiplex networks
• Synchronization of interconnected networks: the role of connector nodes
• Using network science to analyze football passing networks: dynamics, space, time and the multilayer nature of the game
• Communicability reveals a transition to coordinated behavior in multiplex networks
• Optimal interlayer structure for promoting spreading of SIS model in two-layer networks
• Exact Coupling Threshold for Structural Transition in Interconnected Networks
• Maximizing Algebraic Connectivity in Interconnected Networks
• Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions
• Layer degradation triggers an abrupt structural transition in multiplex networks
• Multiple structural transitions in interacting networks
• Designing Optimal Multiplex Networks for Certain Laplacian Spectral Properties
• Structural transition in interdependent networks with regular interconnections