Spectral and structural properties of random interdependent networks

DOI10.1016/j.automatica.2017.06.024zbMath1373.93310OpenAlexW2727199916MaRDI QIDQ1679107

Ebrahim Moradi Shahrivar, Mohammad Pirani, Shreyas Sundaram

Publication date: 8 November 2017

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2017.06.024

zbMATH Keywords

robustnessisoperimetric constantalgebraic connectivitygrounded Laplacian matrixrandom interdependent networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Perturbations in control/observation systems (93C73) Eigenvalue problems (93B60) Stochastic systems in control theory (general) (93E03)

Related Items

On Stable Systems with Random Structure, Spectral and structural properties of random interdependent networks, Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey, Characterization of expansion-related properties of modular graphs, Merging relative sensing networks: a stability margin perspective, Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consensus of second-order multi-agent systems in the presence of locally bounded faults
• Old and new results on algebraic connectivity of graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• Heuristics for semirandom graph problems
• Spectral and structural properties of random interdependent networks
• Algebraic connectivity of interdependent networks
• Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
• Iterative approximate byzantine consensus in arbitrary directed graphs
• Exact Recovery in the Stochastic Block Model
• On the Smallest Eigenvalue of Grounded Laplacian Matrices
• Design of Network Topology in an Adversarial Environment
• Consensus and Cooperation in Networked Multi-Agent Systems
• Every monotone graph property has a sharp threshold
• Reaching a Consensus
• A Notion of Robustness in Complex Networks
• Probability and Computing