Compressing strongly connected subgroups in social networks: an entropy-based approach
DOI10.1080/0022250X.2017.1284070zbMATH Open1417.91406OpenAlexW2593253737MaRDI QIDQ4963379FDOQ4963379
Authors: Dominic Brenner, Andreas Dellnitz, Friedhelm Kulmann, W. 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
Recommendations
Applications of graph theory (05C90) Social networks; opinion dynamics (91D30) Measures of information, entropy (94A17)
Cites Work
- Features of the Expert-System-Shell SPIRIT
- A new status index derived from sociometric analysis
- Networks. An introduction.
- I-divergence geometry of probability distributions and minimization problems
- Title not available (Why is that?)
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
- From information to probability: An axiomatic approach-Inference is information processing
- Title not available (Why is that?)
- Opinion dynamics and the evolution of social power in influence networks
- Characterizing the principle of minimum cross-entropy within a conditional-logical framework
- Recall and reasoning -- an information theoretical model of cognitive processes
- A Matrix Approach to Generalizing Axelrod-Type Tournaments
- Conditionals, Information, and Inference
Cited In (1)
Uses Software
This page was built for publication: Compressing strongly connected subgroups in social networks: an entropy-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963379)