Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
DOI10.1016/j.tcs.2023.114220zbMath1527.90247arXiv2309.17019OpenAlexW4387267395MaRDI QIDQ6069849
Xiaotian Zhou, Zhong-Zhi Zhang, Wei Li, Haoxin Sun
Publication date: 17 November 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2309.17019
spectral propertypartial derivativematrix perturbationgraph mininglinear algorithmgrounded Laplacian
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks and the effective resistance of networks
- Clustering to minimize the maximum intercluster distance
- Graph properties for splitting with grounded Laplacian matrices
- Pinning control of scale-free dynamical networks
- Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach
- A two-layer transformation for zeros analysis of networked dynamical systems
- Percolation on dense graph sequences
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
- A faster algorithm for betweenness centrality*
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- On the Smallest Eigenvalue of Grounded Laplacian Matrices
- Nonzero Bound on Fiedler Eigenvalue Causes Exponential Growth of H-Infinity Norm of Vehicular Platoon
- Learning, Local Interaction, and Coordination
- The Structure and Function of Complex Networks
- The Many Proofs and Applications of Perron's Theorem
- Distributed Identification of the Most Critical Node for Average Consensus
- H/sub 2//H/sub /spl infin// filter design for systems with polytope-bounded uncertainty
- Pinning a Complex Dynamical Network to Its Equilibrium
- Centrality Measures in Linear Consensus Networks With Structured Network Uncertainties
- Robustness of Leader–Follower Networked Dynamical Systems
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Bounds on the Smallest Eigenvalue of a Pinned Laplacian Matrix
- Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization
- Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
- Maximizing the Number of Spanning Trees in a Connected Graph
- Solving SDD linear systems in nearly m log 1/2 n time
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback
- The Price of Synchrony: Evaluating the Resistive Losses in Synchronizing Power Networks
This page was built for publication: Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
