Group-Level Analysis and Visualization of Social Networks
From MaRDI portal
Recommendations
Cites work
- A spectral heuristic for bisecting random graphs
- A Spectral Technique for Coloring Random 3-Colorable Graphs
- Algorithms and Computation
- Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities
- Graph Drawing
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 2084275 (Why is no real title available?)
- scientific article; zbMATH DE number 3963860 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1974103 (Why is no real title available?)
- scientific article; zbMATH DE number 2038757 (Why is no real title available?)
- Improved Circular Layouts
- Latent semantic indexing: A probabilistic analysis
- Network Analysis
- Network analysis. Methodological foundations.
- On clusterings: good, bad and spectral
- Regular equivalence: General theory
- Spectral analysis of data
Cited in
(7)- An alternative class of models to position social network groups in latent spaces
- Methods of social network analysis
- scientific article; zbMATH DE number 2088981 (Why is no real title available?)
- Generating images of the shape of a class system
- scientific article; zbMATH DE number 1072404 (Why is no real title available?)
- scientific article; zbMATH DE number 1982193 (Why is no real title available?)
- Compressing strongly connected subgroups in social networks: an entropy-based approach
This page was built for publication: Group-Level Analysis and Visualization of Social Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637326)