Bounds on the Spectral Radius of Digraphs from Subgraph Counts

DOI10.1137/19M1256312zbMath1440.05139OpenAlexW3019622567MaRDI QIDQ5112240

Masaki Ogura, Victor M. Preciado, Xi-ming Chen

Publication date: 28 May 2020

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/19m1256312

zbMATH Keywords

moment problemsemidefinite programmingspectral radiusdirected graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Semidefinite programming (90C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Moment problems (44A60) Directed graphs (digraphs), tournaments (05C20)

Related Items

A dynamical approach to efficient eigenvalue estimation in general multiagent networks ⋮ Block sparse design of distributed controllers for dynamical network systems

Uses Software

• SNAP
• CVX
• GitHub
• Brain Connectivity Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some lower bounds for the spectral radius of matrices using traces
• Walks and the spectral radius of graphs
• More bounds for eigenvalues using traces
• Bounds for eigenvalues using traces
• Lower bounds for the spectral radius of a matrix
• Bounds for eigenvalues using the trace and determinant
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Cauchy's interlace theorem and lower bounds for the spectral radius
• Bounds for the spectral radius and the largest singular value
• The best possible lower bound for the Perron root using traces
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
• Dynamical Processes on Complex Networks
• The Structure and Function of Complex Networks
• Handbook of Graph Theory
• Random graph models of social networks
• Distributed Network Design for Laplacian Eigenvalue Placement
• The Average Distance in a Random Graph with Given Expected Degrees
• Collective dynamics of ‘small-world’ networks
• Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
• Exploring complex networks
• Lower bounds for the Perron root of a nonnegative matrix

This page was built for publication: Bounds on the Spectral Radius of Digraphs from Subgraph Counts