Estimating the number of weak balance structures in signed networks
From MaRDI portal
Publication:2207900
Recommendations
- Measuring partial balance in signed networks
- Weak balance in random signed graphs
- Structural balance of multiplex signed networks: a distributed data-driven approach
- Rethinking structural balance in signed social networks
- Balance in random signed graphs
- Optimizing transformations of structural balance in signed networks with potential relationships
- On eigenvector structure of weakly balanced networks
- The asymptotic distribution of modularity in weighted signed networks
Cites work
- A simple algorithm to detect balance in signed graphs
- Elementary Methods in Number Theory
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095493 (Why is no real title available?)
- On an elementary proof of some asymptotic formulas in the theory of partitions
- On the notion of balance of a signed graph
Cited in
(6)- Fast computing global structural balance in signed networks based on memetic algorithm
- Analysis, calculation and utilization of the \(k\)-balance attribute in interdependent networks
- Structural balance of multiplex signed networks: a distributed data-driven approach
- A spectral algorithm for computing social balance
- Measuring the balance of signed networks and its application to sign prediction
- Social disruption games in signed networks
This page was built for publication: Estimating the number of weak balance structures in signed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2207900)