共 50 条
- [21] The Power of Consensus: Random Graphs Have No Communities 2013 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2013, : 278 - 282
- [22] A Spectral Clustering Approach To Finding Communities in Graphs PROCEEDINGS OF THE FIFTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2005, : 274 - 285
- [23] On the hardness of finding balanced independent sets in random bipartite graphs PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2376 - 2397
- [25] An adaptive spectral heuristic for partitioning random graphs AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 691 - 702
- [26] THE SPECTRAL GAP OF DENSE RANDOM REGULAR GRAPHS ANNALS OF PROBABILITY, 2019, 47 (01): : 362 - 419
- [28] HAUSDORFF AND SPECTRAL DIMENSION OF INFINITE RANDOM GRAPHS ACTA PHYSICA POLONICA B, 2009, 40 (12): : 3509 - 3532
- [29] Spectral and localization properties of random bipartite graphs Chaos, Solitons and Fractals: X, 2019, 3