Measuring Segregation via Analysis on Graphs
From MaRDI portal
Recommendations
Cites work
- A characterization of the smallest eigenvalue of a graph
- A geometric interpretation of the Metropolis-Hastings algorithm.
- A variational approach to the consistency of spectral clustering
- Beitrag zur Theorie des Ferromagnetismus
- Clustering and mixing times for segregation models on \(\mathbb{Z}^2\)
- Concentration of mass on convex bodies
- Dynamic models of segregation†
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Explainer: measuring clustering and segregation
- scientific article; zbMATH DE number 1181255 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Networks
- Nodal decompositions of graphs
- NOTES ON CONTINUOUS STOCHASTIC PHENOMENA
- The Structure and Function of Complex Networks
Cited in
(7)- New methods for measuring and analyzing segregation
- scientific article; zbMATH DE number 3843460 (Why is no real title available?)
- Segregation surfaces
- Explainer: measuring clustering and segregation
- Numerical measures of segregation: Desirable properties and their implications
- Measuring school segregation
- Topological analysis of U.S. city demographics
This page was built for publication: Measuring Segregation via Analysis on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885803)