Maximizing algebraic connectivity in interconnected networks

K-REx Repository

Show simple item record

dc.contributor.author Shakeri, Heman
dc.contributor.author Albin, Nathan
dc.contributor.author Sahneh, Faryad D.
dc.contributor.author Poggi-Corradini, Pietro
dc.contributor.author Scoglio, Caterina
dc.date.accessioned 2016-09-20T17:26:27Z
dc.date.available 2016-09-20T17:26:27Z
dc.identifier.uri http://hdl.handle.net/2097/33988
dc.description Citation: Shakeri, H., Albin, N., Sahneh, F. D., Poggi-Corradini, P., & Scoglio, C. (2016). Maximizing algebraic connectivity in interconnected networks. Physical Review E, 93(3), 6. doi:10.1103/PhysRevE.93.030301
dc.description.abstract Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with interlayer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these interlayer links considering realistic constraints. In this work, we solve the problem of finding an optimal weight distribution for one-to-one interlayer links under budget constraint. We show that for the special multiplex configurations with identical layers, the uniform weight distribution is always optimal. On the other hand, when the two layers are arbitrary, increasing the budget reveals the existence of two different regimes. Up to a certain threshold budget, the second eigenvalue of the supra-Laplacian is simple, the optimal weight distribution is uniform, and the Fiedler vector is constant on each layer. Increasing the budget past the threshold, the optimal weight distribution can be nonuniform. The interesting consequence of this result is that there is no need to solve the optimization problem when the available budget is less than the threshold, which can be easily found analytically.
dc.relation.uri https://doi.org/10.1103/PhysRevE.93.030301
dc.rights ©2016 American Physical Society
dc.rights.uri http://www.sherpa.ac.uk/romeo/issn/2470-0045/
dc.subject Interdependent Networks
dc.subject Graphs
dc.subject Physics
dc.title Maximizing algebraic connectivity in interconnected networks
dc.type Article
dc.date.published 2016
dc.citation.doi 10.1103/PhysRevE.93.030301
dc.citation.issn 1539-3755
dc.citation.issue 3
dc.citation.jtitle Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
dc.citation.spage 6
dc.citation.volume 93
dc.contributor.authoreid faryad
dc.contributor.authoreid albin
dc.contributor.authoreid pietro
dc.contributor.authoreid caterina


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search K-REx


Advanced Search

Browse

My Account

Statistics








Center for the

Advancement of Digital

Scholarship

118 Hale Library

Manhattan KS 66506


(785) 532-7444

cads@k-state.edu