Generalized quasirandom properties of expanding graph sequences
From MaRDI portal
Publication:5216273
DOI10.1088/1361-6544/ab60d2zbMath1433.05186arXiv1508.04369OpenAlexW3005953023MaRDI QIDQ5216273
Publication date: 17 February 2020
Published in: Nonlinearity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.04369
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- Testability of minimum balanced multiway cut densities
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Reconstruction and estimation in the planted partition model
- Recognizing linear structure in noisy matrices
- Limits of kernel operators and the spectral regularity lemma
- Geometric bounds for eigenvalues of Markov chains
- Turán's theorem for pseudo-random graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Singular value decomposition of large random matrices (for two-way classification of microarrays)
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Eigenvalues and expanders
- Quick approximation to matrices and applications
- Discrepancy minimizing spectral clustering
- On the concentration of eigenvalues of random symmetric matrices
- Generalized quasirandom graphs
- Modularity spectra, eigen-subspaces, and structure of weighted graphs
- Eigenvalues and partitionings of the edges of a graph
- Dense expanders and pseudo-random bipartite graphs
- Spectral Clustering and Biclustering
- Finding Planted Partitions in Random Graphs with General Degree Distributions
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- Mixing Properties and the Chromatic Number of Ramanujan Complexes
- Expander graphs and their applications
- Szemerédi's partition and quasirandomness
- The phase transition in inhomogeneous random graphs
- The effectiveness of lloyd-type methods for the k-means problem
- Multi-way spectral partitioning and higher-order cheeger inequalities
- Quasi‐random graphs with given degree sequences
- Quasi-random graphs
- Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalized quasirandom properties of expanding graph sequences
