arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.01073cs.NIcs.SImath.OC
收藏

针对某些Laplacian谱性质的最优复用网络设计

Designing Optimal Multiplex Networks for Certain Laplacian Spectral Properties

Heman Shakeri, Ali Tavassoli, Ehsan Ardjmand, Pietro Poggi-Corradini

摘要:

我们讨论了在有限的预算下,以提高其整体性能为目标的复用网络中的层间边缘的设计。我们分别分析以下三个问题:首先,我们最大化最小的非零特征值,也称为代数连通性;其次,我们最小化最大的特征值,也称为谱半径;最后,我们最小化谱宽度。最大化的代数连接需要相同的权重的层间边缘的预算小于阈值。然而,对于较大的预算,最佳权重通常是不均匀的。对偶公式将问题转化为图实现(嵌入)问题,使我们能够给出更全面的画面。也就是说,在阈值预算之前,最优实现是一维的,同一层中的节点嵌入到一个点;而在阈值之外,最优嵌入通常展开到空间中,其维度由代数连通性的多重性所限定。最后,对于非常大的预算,嵌入再次恢复到较低的维度。最小化最大特征值是由各个网络的谱半径及其相应的特征向量驱动的。在阈值之前,总预算分布在对应于该特征向量的节线的层间边缘之间,并且拉普拉斯算子的最优最大特征值保持恒定。对于较大的预算,权重分布趋于几乎均匀。在对偶图中,最优图嵌入最初是一维的且非齐次的,并且超过该阈值,最优嵌入扩展为多维的,并且对于较大的预算值,两层填充嵌入空间。最后,我们将展示这两个问题是如何连接到最小化的频谱宽度。

英文摘要:

We discuss the design of interlayer edges in a multiplex network, under a limited budget, with the goal of improving its overall performance. We analyze the following three problems separately; first, we maximize the smallest nonzero eigenvalue, also known as the algebraic connectivity; secondly, we minimize the largest eigenvalue, also known as the spectral radius; and finally, we minimize the spectral width. Maximizing the algebraic connectivity requires identical weights on the interlayer edges for budgets less than a threshold value. However, for larger budgets, the optimal weights are generally non-uniform. The dual formulation transforms the problem into a graph realization (embedding) problem that allows us to give a fuller picture. Namely, before the threshold budget, the optimal realization is one-dimensional with nodes in the same layer embedded to a single point; while, beyond the threshold, the optimal embeddings generally unfold into spaces with dimension bounded by the multiplicity of the algebraic connectivity. Finally, for extremely large budgets the embeddings revert again to lower dimensions. Minimizing the largest eigenvalue is driven by the spectral radius of the individual networks and its corresponding eigenvector. Before a threshold, the total budget is distributed among interlayer edges corresponding to the nodal lines of this eigenvector, and the optimal largest eigenvalue of the Laplacian remains constant. For larger budgets, the weight distribution tends to be almost uniform. In the dual picture, the optimal graph embedding is one-dimensional and non-homogeneous at first and beyond this threshold, the optimal embedding expands to be multi-dimensional, and for larger values of the budget, the two layers fill the embedding space. Finally, we show how these two problems are connected to minimizing the spectral width.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑