Maximizing the algebraic connectivity in multilayer networks with arbitrary interconnections

08/29/2020
by   Ali Tavasoli, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/04/2019

Designing Optimal Multiplex Networks for Certain Laplacian Spectral Properties

We discuss the design of interlayer edges in a multiplex network, under ...
01/07/2019

Proof of a conjecture on the algebraic connectivity of a graph and its complement

For a graph G, let λ_2(G) denote its second smallest Laplacian eigenvalu...
12/18/2019

Extreme Values of the Fiedler Vector on Trees

Let G be a connected tree on n vertices and let L = D-A denote the Lapla...
09/23/2016

Multilayer Spectral Graph Clustering via Convex Layer Aggregation

Multilayer graphs are commonly used for representing different relations...
04/27/2018

Quantum Algorithms for Connectivity and Related Problems

An important family of span programs, st-connectivity span programs, hav...
08/27/2018

Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity

How to draw the vertices of a complete multipartite graph G on different...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.