Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
DOI10.1137/070709529zbMATH Open1227.05225OpenAlexW2024428102WikidataQ105584148 ScholiaQ105584148MaRDI QIDQ3068635FDOQ3068635
Authors: Noga Alon, Amin Coja-Oghlan, Hiệp Hàn, Mihyun Kang, Vojtěch Rödl, M. Schacht 
Publication date: 17 January 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/3320/3/WRAP_Coja-Oghlan_Quasi_randomness.pdf
Recommendations
- Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- Quasirandomness in Graphs
- Quasi-randomness and the regularity method in hypergraphs
- Hypergraph regularity and quasi-randomness
- Quasi-randomness and the distribution of copies of a fixed graph
- Hypergraphs, quasi-randomness, and conditions for regularity
- Quasi‐random graphs with given degree sequences
- Quasi-random graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (22)
- Generalized quasirandom properties of expanding graph sequences
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- A note on even cycles and quasirandom tournaments
- The poset of hypergraph quasirandomness
- Beyond the expanders
- Spectra and structure of weighted graphs
- Average Gromov hyperbolicity and the Parisi ansatz
- A weighted regularity lemma with applications
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
- Quasi-randomness and the distribution of copies of a fixed graph
- Grothendieck-type inequalities in combinatorial optimization
- Regularity-based spectral clustering and mapping the Fiedler-carpet
- Quasirandom Cayley graphs
- Discrepancy and eigenvalues of Cayley graphs
- Modularity spectra, eigen-subspaces, and structure of weighted graphs
- Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- Extremal results in sparse pseudorandom graphs
- A unified view of graph regularity via matrix decompositions
- Matrix and discrepancy view of generalized random and quasirandom graphs
- On the KŁR conjecture in random graphs
- Discrepancy minimizing spectral clustering
This page was built for publication: Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068635)
