The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Algebraic connectivity of graphs
Open accessOverview
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
Congruent Graphs and the Connectivity of Graphs
Whitney, H. (1932) · American Journal of Mathematics · doi:10.2307/2371086 · Cited by 863
Bounds for eigenvalues of doubly stochastic matrices
Fiedler, M. (1972) · Linear Algebra and its Applications · doi:10.1016/0024-3795(72)90011-0 · Cited by 41
Self-citation
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“In this case, if one aims at a split in n1 and n2 = n−n1 vertices, the best strategy is to order the components of the Fiedler vector from the lowest to the largest values and to put in one group the vertices corresponding to the first n1 components from the top or the bottom, and the remaining vertices in the second…”
BackgroundMethodInfluentialComplex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
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
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
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
Synchronization in complex networks
Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y., & Zhou, C. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.002 · Cited by 3,713
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
The prognostic landscape of genes and infiltrating immune cells across human cancers
Gentles, A. J., Newman, A. M., Liu, C. L., Bratman, S. V., Feng, W., Kim, D., Nair, V. S., Xu, Y., Khuong, A., Hoang, C. D., et al. (2015) · Nature Medicine · doi:10.1038/nm.3909 · Cited by 3,118
Comparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.056131 · Cited by 2,476
Characterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
Computing Communities in Large Networks Using Random Walks
Pons, P., & Latapy, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11569596_31 · Cited by 2,048
Detecting community structure in networks
Newman, M. E. J. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00124-y · Cited by 2,028
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
Kernel methods in machine learning
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · The Annals of Statistics · doi:10.1214/009053607000000677 · Cited by 1,651
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
Brouwer, A. E., & Haemers, W. H. (2012) · Universitext · doi:10.1007/978-1-4614-1939-6 · Cited by 1,564
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
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
“The research directions in this category include: algebraic connectivity [Fiedler, 1973] [Wilson and Zhu, 2008]), a spectral method that has been studied thoroughly; an SVM-based approach on global feature vectors [Li et al., 2011a]; social networks similarity [Macindoe and Richards, 2010] which is…”
MethodComputing Communities in Large Networks Using Random Walks
Pons, P., & Latapy, M. (2006) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00124 · Cited by 1,501
KONECT: the Koblenz network collection
Kunegis, J. (2013) · Proceedings of the 22nd International Conference on World Wide Web · doi:10.1145/2487788.2488173 · Cited by 1,479
Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems
Yu, W., Chen, G., & Cao, M. (2010) · Automatica · doi:10.1016/j.automatica.2010.03.006 · Cited by 1,390
Mechanism Design via Differential Privacy
McSherry, F., & Talwar, K. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.66 · Cited by 1,371
Learning with Hypergraphs: Clustering, Classification, and Embedding
Zhou, D., Huang, J., & Schölkopf, B. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0205 · Cited by 1,283
Proteinortho: Detection of (Co-)orthologs in large-scale analysis
Lechner, M., Findeiß, S., Steiner, L., Marz, M., Stadler, P. F., & Prohaska, S. J. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-124 · Cited by 1,221
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
Yu, W., Chen, G., Cao, M., & Kurths, J. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2031624 · Cited by 1,120
Mitigation of malicious attacks on networks
Schneider, C. M., Moreira, A. A., Andrade, J. S., Havlin, S., & Herrmann, H. J. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1009440108 · Cited by 1,023
Controllability of structural brain networks
Gu, S., Pasqualetti, F., Cieslak, M., Telesford, Q. K., Yu, A. B., Kahn, A. E., Medaglia, J. D., Vettel, J. M., Miller, M. B., Grafton, S. T., et al. (2015) · Nature Communications · doi:10.1038/ncomms9414 · Cited by 912
“Second, following 10 , we determine the two-partition of the least controllable subnetwork from its Fiedler eigenvector 50,51 , and we identify the additional boundary nodes.”
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Structural Properties of the Caenorhabditis elegans Neuronal Network
Varshney, L. R., Chen, B. L., Paniagua, E., Hall, D. H., & Chklovskii, D. B. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001066 · Cited by 867
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
λ1, Isoperimetric inequalities for graphs, and superconcentrators
Alon, N., & Milman, V. D. (1985) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(85)90092-9 · Cited by 839
A min-max cut algorithm for graph partitioning and data clustering
Ding, C. H. Q., He, X., Zha, H., Gu, M., & Simon, H. D. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989507 · Cited by 829
A survey of kernel and spectral methods for clustering
Filippone, M., Camastra, F., Masulli, F., & Rovetta, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.05.018 · Cited by 827
On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2304432 · Cited by 820
Finding local community structure in networks
Clauset, A. (2005) · Physical Review E · doi:10.1103/physreve.72.026132 · Cited by 788
Consensus of Linear Multi-Agent Systems by Distributed Event-Triggered Strategy
Hu, W., Liu, L., & Feng, G. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2398892 · Cited by 738
Gleich, D. F. (2015) · SIAM Review · doi:10.1137/140976649 · Cited by 646
Social capital I: measurement and associations with economic mobility
Chetty, R., Jackson, M. O., Kuchler, T., Stroebel, J., Hendren, N., Fluegge, R. B., Gong, S., Gonzalez, F., Grondin, A., Jacob, M., et al. (2022) · Nature · doi:10.1038/s41586-022-04996-4 · Cited by 627
Decentralized control of vehicle formations
Lafferriere, G., Williams, A., Caughman, J., & Veerman, J. J. P. (2005) · Systems & Control Letters · doi:10.1016/j.sysconle.2005.02.004 · Cited by 627
You, K., & Xie, L. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2164017 · Cited by 622
Controllability Metrics, Limitations and Algorithms for Complex Networks
Pasqualetti, F., Zampieri, S., & Bullo, F. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2310254 · Cited by 594
Local Higher-Order Graph Clustering
Yin, H., Benson, A. R., Leskovec, J., & Gleich, D. F. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098069 · Cited by 583
Distributed Consensus With Limited Communication Data Rate
Li, T., Fu, M., Xie, L., & Zhang, J.-F. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2052384 · Cited by 565
Agreement over random networks
Hatano, Y., & Mesbahi, M. (2004) · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · doi:10.1109/cdc.2004.1430343 · Cited by 550
On partial contraction analysis for coupled nonlinear oscillators
Wang, W., & Slotine, J.-J. E. (2005) · Biological Cybernetics · doi:10.1007/s00422-004-0527-x · Cited by 545
Consistency of spectral clustering
von Luxburg, U., Belkin, M., & Bousquet, O. (2008) · The Annals of Statistics · doi:10.1214/009053607000000640 · Cited by 540
Regularization and Semi-supervised Learning on Large Graphs
Belkin, M., Matveeva, I., & Niyogi, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27819-1_43 · Cited by 536
Spectral clustering and the high-dimensional stochastic blockmodel
Rohe, K., Chatterjee, S., & Yu, B. (2011) · The Annals of Statistics · doi:10.1214/11-aos887 · Cited by 535
Second-order consensus in multi-agent dynamical systems with sampled position data
Yu, W., Zheng, W. X., Chen, G., Ren, W., & Cao, J. (2011) · Automatica · doi:10.1016/j.automatica.2011.02.027 · Cited by 526
Agreement over random networks
Hatano, Y., & Mesbahi, M. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.858670 · Cited by 503
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
Gutman, I., & Zhou, B. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.09.008 · Cited by 495
Barnard, S. T., & Simon, H. D. (1994) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330060203 · Cited by 488
Heterophilious Dynamics Enhances Consensus
Motsch, S., & Tadmor, E. (2014) · SIAM Review · doi:10.1137/120901866 · Cited by 482
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Hendrickson, B., & Leland, R. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916028 · Cited by 480
Eigenvalues of the Laplacian of a graph∗
Anderson, W. N., & Morley, T. D. (1985) · Linear and Multilinear Algebra · doi:10.1080/03081088508817681 · Cited by 475
Stability of graph communities across time scales
Delvenne, J.-C., Yaliraki, S. N., & Barahona, M. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0903215107 · Cited by 475
Diffusion Adaptation Over Networks
Sayed, A. H. (2014) · Academic Press Library in Signal Processing · doi:10.1016/b978-0-12-411597-2.00009-6 · Cited by 465
Finding communities in linear time: a physics approach
Wu, F., & Huberman, B. A. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00125-x · Cited by 451
Minimizing Effective Resistance of a Graph
Ghosh, A., Boyd, S., & Saberi, A. (2008) · SIAM Review · doi:10.1137/050645452 · Cited by 443
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Decentralized estimation and control of graph connectivity for mobile sensor networks
Yang, P., Freeman, R. A., Gordon, G. J., Lynch, K. M., Srinivasa, S. S., & Sukthankar, R. (2010) · Automatica · doi:10.1016/j.automatica.2009.11.012 · Cited by 430
Yu, W., Ren, W., Zheng, W. X., Chen, G., & Lü, J. (2013) · Automatica · doi:10.1016/j.automatica.2013.03.005 · Cited by 423
Some applications of Laplace eigenvalues of graphs
Mohar, B. (1997) · Graph Symmetry · doi:10.1007/978-94-015-8937-6_6 · Cited by 422
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
Levy, B. (2006) · IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06) · doi:10.1109/smi.2006.21 · Cited by 422
Consensus in Directed Networks of Agents With Nonlinear Dynamics
Yu, W., Chen, G., & Cao, M. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2112477 · Cited by 407
Graph-theoretic connectivity control of mobile robot networks
Zavlanos, M. M., Egerstedt, M. B., & Pappas, G. J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2157884 · Cited by 405
A Spectral Clustering Approach To Finding Communities in Graphs
White, S., & Smyth, P. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.25 · Cited by 404
Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
Lambiotte, R., Delvenne, J.-C., & Barahona, M. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2391998 · Cited by 398
Spectral partitioning works: planar graphs and finite element meshes
Spielman, D. A., & Teng, S.-H. (1996) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548468 · Cited by 393
Ultrafast consensus in small-world networks
Olfati-Saber, R. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470321 · Cited by 384
Community Mining from Signed Social Networks
Yang, B., Cheung, W., & Liu, J. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1061 · Cited by 383
Clustering categorical data: an approach based on dynamical systems
Gibson, D., Kleinberg, J., & Raghavan, P. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050005 · Cited by 382
Detecting network communities: a new systematic and efficient algorithm
Donetti, L., & Muñoz, M. A. (2004) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2004/10/p10012 · Cited by 374
Complex Networks: Principles, Methods and Applications
Latora, V., Nicosia, V., & Russo, G. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316216002 · Cited by 372
The ab-initio density matrix renormalization group in practice
Olivares-Amaya, R., Hu, W., Nakatani, N., Sharma, S., Yang, J., & Chan, G. K.-L. (2015) · The Journal of Chemical Physics · doi:10.1063/1.4905329 · Cited by 363
Abrupt transition in the structural formation of interconnected networks
Radicchi, F., & Arenas, A. (2013) · Nature Physics · doi:10.1038/nphys2761 · Cited by 348
Community detection in social networks
Bedi, P., & Sharma, C. (2016) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1178 · Cited by 346
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Williams, R. D. (1991) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330030502 · Cited by 345
Ghosh, A., & Boyd, S. (2006) · Proceedings of the 45th IEEE Conference on Decision and Control · doi:10.1109/cdc.2006.377282 · Cited by 341
Multi-Agent Coordination by Decentralized Estimation and Control
Yang, P., Freeman, R. A., & Lynch, K. M. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2006925 · Cited by 330
Tensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks
Scholtes, I., Wider, N., Pfitzner, R., Garas, A., Tessone, C. J., & Schweitzer, F. (2014) · Nature Communications · doi:10.1038/ncomms6024 · Cited by 304
Eigenvalues, diameter, and mean distance in graphs
Mohar, B. (1991) · Graphs and Combinatorics · doi:10.1007/bf01789463 · Cited by 301
Community Detection via Maximization of Modularity and Its Variants
Chen, M., Kuzmin, K., & Szymanski, B. K. (2014) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2014.2307458 · Cited by 301
Levin, A., Rav Acha, A., & Lischinski, D. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.168 · Cited by 297
Metadata
- Authors
- Fiedler, M.
- Venue
- Czechoslovak Mathematical Journal
- Published
- 1973
- Volume
- 23
- Issue
- 2
- Pages
- 298-305
- ISSN
- 0011-4642 (ISSN-L)
- 1572-9141
- OpenAlex
- W1587744656
- Cited by
- 3,977
- References
- 2
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- green
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.