Matrix and discrepancy view of generalized random and quasirandom graphs

DOI10.1515/SPMA-2016-0004MaRDI QIDQ908195zbMATH OpenOpenAlexFDO

Authors Marianna Bolla, Ahmed Elbanna

Publication date 3 February 2016

Published in Special Matrices (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.1515/spma-2016-0004

zbMATH Keywords

spectral clusteringmodularity matrixgeneralized quasirandom propertiesgeneralized random graphsmultiway discrepancy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Generalized quasirandom properties of expanding graph sequences
• Generalized quasirandom graphs
• Generalized modularity matrices
• From quasirandom graphs to graph limits and graphlets
• Discrepancy minimizing spectral clustering

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• A nonparametric view of network models and Newman–Girvan and other modularities
• A sequence well distributed in the square
• Cliques in random graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Dense expanders and pseudo-random bipartite graphs
• Eigenvalues of random power law graphs
• Emergence of Scaling in Random Networks
• Expander graphs and their applications
• Finding Planted Partitions in Random Graphs with General Degree Distributions
• Generalized quasirandom graphs
• Hermitian matrices and graphs: Singular values and discrepancy
• Modularity spectra, eigen-subspaces, and structure of weighted graphs
• Networks. An introduction.
• Noisy random graphs and their laplacians
• Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
• Quasi-random graphs
• Quasi‐random graphs with given degree sequences
• Random graphs.
• Recognizing linear structure in noisy matrices
• SVD, discrepancy, and regular structure of contingency tables
• Spectral clustering and biclustering. Learning large graphs and contingency tables
• Spectral clustering and the high-dimensional stochastic blockmodel
• Spectral properties of modularity matrices
• Szemerédi's partition and quasirandomness
• The behavior of eigenvalues and singular values under perturbations of restricted rank
• The phase transition in inhomogeneous random graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Using discrepancy to control singular values for nonnegative matrices
• Very large graphs

Cited in

(3)

• Generalized quasirandom properties of expanding graph sequences
• Discrepancy properties for random regular digraphs
• Discrepancy minimizing spectral clustering

This page was built for publication: Matrix and discrepancy view of generalized random and quasirandom graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908195)