Measuring partial balance in signed networks
From MaRDI portal
(Redirected from Publication:3388893)
Abstract: Is the enemy of an enemy necessarily a friend? If not, to what extent does this tend to hold? Such questions were formulated in terms of signed (social) networks and necessary and sufficient conditions for a network to be "balanced" were obtained around 1960. Since then the idea that signed networks tend over time to become more balanced has been widely used in several application areas. However, investigation of this hypothesis has been complicated by the lack of a standard measure of partial balance, since complete balance is almost never achieved in practice. We formalize the concept of a measure of partial balance, discuss various measures, compare the measures on synthetic datasets, and investigate their axiomatic properties. The synthetic data involves ErdH{o}s-R'enyi and specially structured random graphs. We show that some measures behave better than others in terms of axioms and ability to differentiate between graphs. We also use well-known datasets from the sociology and biology literature, such as Read's New Guinean tribes, gene regulatory networks related to two organisms, and a network involving senate bill co-sponsorship. Our results show that substantially different levels of partial balance is observed under cycle-based, eigenvalue-based, and frustration-based measures. We make some recommendations for measures to be used in future work.
Recommendations
Cited in
(26)- Optimizing transformations of structural balance in signed networks with potential relationships
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- On optimization of complete social networks
- Characterizing attitudinal network graphs through frustration cloud
- Frustration-critical signed graphs
- Information spreading with relative attributes on signed networks
- Structural balance of multiplex signed networks: a distributed data-driven approach
- Group relations, resilience and the \textit{I Ching}
- On the logic of balance in social networks
- Estimating the number of weak balance structures in signed networks
- Rethinking structural balance in signed social networks
- Algebraic topological characterizations of structural balance in signed graphs
- Computing the line index of balance using integer programming optimisation
- A spectral algorithm for computing social balance
- Measuring the balance of signed networks and its application to sign prediction
- Partitioning Signed Two-Mode Networks
- scientific article; zbMATH DE number 2149224 (Why is no real title available?)
- Balance in random signed graphs
- Projecting signed two-mode networks
- Testing for Balance in Social Networks
- A modeling and computational study of the frustration index in signed networks
- Social balance - a signed detour distance analysis
- Corona product of signed graphs and its application to modeling signed networks
- Spreading and Structural Balance on Signed Networks
- Global balance and systemic risk in financial correlation networks
- Community detection in bipartite signed networks is highly dependent on parameter choice
This page was built for publication: Measuring partial balance in signed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3388893)
