Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks

DOI10.1109/TAC.2013.2261187MaRDI QIDQ5353337zbMATH OpenOpenAlexFDO

Authors Victor M. Preciado, Ali Jadbabaie, George C. Verghese

Publication date 8 September 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.5676

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Large-scale systems (93A15)

Abstract: Using methods from algebraic graph theory and convex optimization, we study the relationship between local structural features of a network and spectral properties of its Laplacian matrix. In particular, we derive expressions for the so-called spectral moments of the Laplacian matrix of a network in terms of a collection of local structural measurements. Furthermore, we propose a series of semidefinite programs to compute bounds on the spectral radius and the spectral gap of the Laplacian matrix from a truncated sequence of Laplacian spectral moments. Our analysis shows that the Laplacian spectral moments and spectral radius are strongly constrained by local structural features of the network. On the other hand, we illustrate how local structural features are usually not enough to estimate the Laplacian spectral gap.

Cited in

(12)

• Fast distributed algebraic connectivity estimation in large scale networks
• A dynamical approach to efficient eigenvalue estimation in general multiagent networks
• Detection of hubs in complex networks by the Laplacian matrix
• Spectral identification of networks using sparse measurements
• scientific article; zbMATH DE number 5004834 (Why is no real title available?)
• Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
• Characterizing graphs with maximal Laplacian Estrada index
• Laplacian matrices of general complex weighted directed graphs
• Bounds on the spectral radius of digraphs from subgraph counts
• Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
• Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs
• Spectral plot properties: towards a qualitative classification of networks

This page was built for publication: Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353337)