The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
Abstract
We consider the set G consisting of graphs of fixed order and weighted edges. The vertex set of graphs in G will correspond to point masses and the weight for an edge between two vertices is a functional of the distance between them. We pose the problem of finding the best vertex positional configuration in the presence of an additional proximity constraint, in the sense that, the second smallest eigenvalue of the corresponding graph Laplacian is maximized. In many recent applications of algebraic graph theory in systems and control, the second smallest eigenvalue of Laplacian has emerged as a critical parameter that influences the stability and robustness properties of dynamic systems that operate over an information network. Our motivation in the present work is to "assign" this Laplacian eigenvalue when relative positions of various elements dictate the interconnection of the underlying weighted graph. In this venue, one would then be able to "synthesize" information graphs that have desirable system theoretic properties.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Laplacian matrices of graphs: a survey
Merris, R. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90486-3 · Cited by 1,520
Flocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
On the Quality of Spectral Separators
Guattery, S., & Miller, G. L. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896312262 · Cited by 171
On State-dependent dynamic graphs and their controllability properties
Mesbahi, M. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.843858 · Cited by 161
Self-citationNotes on the Complexity of Switching Networks
Ngo, H. Q., & Du, D. (2001) · Network theory and applications · doi:10.1007/978-1-4613-0281-0_14 · Cited by 20
Cited by
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Finite-Time Consensus Problems for Networks of Dynamic Agents
Wang, L., & Xiao, F. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041610 · Cited by 1,170
Metadata
- Authors
- Kim, Y., & Mesbahi, M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2006-01
- Volume
- 51
- Issue
- 1
- Pages
- 116-120
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2074032690
- Cited by
- 593
- References
- 12
- FWCI
- 39.75
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.