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
- Algebraic graph theory
- Chapter 9. Role assignments
- Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities
- Crossing reduction in circular layouts
- Drawing with fat edges
- Graph Drawing
- 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?)
- Improved Circular Layouts
- Latent semantic indexing: A probabilistic analysis
- Maintaining the mental map for circular drawings
- Network analysis. Methodological foundations.
- On clusterings: good, bad and spectral
- Regular equivalence: General theory
- Spectral analysis of data
- Structural similarity in graphs. A relaxation approach for role assignment
- The computational complexity of the role assignment problem
Cited in
(7)- An alternative class of models to position social network groups in latent spaces
- Methods of social network analysis
- Social network analysis used for modelling collaboration in distance learning groups
- Generating images of the shape of a class system
- scientific article; zbMATH DE number 1072404 (Why is no real title available?)
- Analysis and visualization of social networks
- 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)