Compressing strongly connected subgroups in social networks: An entropy-based approach

DOI10.1080/0022250X.2017.1284070zbMath1417.91406OpenAlexW2593253737MaRDI QIDQ4963379

Andreas Dellnitz, Dominic Brenner, Friedhelm Kulmann, Wilhelm Rödder

Publication date: 2 November 2018

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0022250x.2017.1284070

zbMATH Keywords

entropysocial networksinformation theorynetwork analysisgraph compression

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Measures of information, entropy (94A17)

Related Items (1)

Ranking game on networks: the evolution of hierarchical society

Uses Software

• Scilab
• SPIRIT

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing the principle of minimum cross-entropy within a conditional-logical framework
• I-divergence geometry of probability distributions and minimization problems
• Recall and reasoning -- an information theoretical model of cognitive processes
• A new status index derived from sociometric analysis
• Opinion Dynamics and the Evolution of Social Power in Influence Networks
• Features of the Expert-System-Shell SPIRIT
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• From information to probability: An axiomatic approach-Inference is information processing
• A Matrix Approach to Generalizing Axelrod-Type Tournaments
• Conditionals, Information, and Inference
• Networks
• Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents

This page was built for publication: Compressing strongly connected subgroups in social networks: An entropy-based approach