Optimizing transformations of structural balance in signed networks with potential relationships
From MaRDI portal
Publication:1620110
DOI10.1016/J.PHYSA.2016.08.027zbMATH Open1400.91458OpenAlexW2507516295MaRDI QIDQ1620110FDOQ1620110
Authors: Haifeng Du, Xiaochen He, Shanfeng Wang, Maoguo Gong, Marcus W. Feldman
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2016.08.027
Recommendations
Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30)
Cites Work
- Networks, crowds and markets. Reasoning about a highly connected world.
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
- THE HEIDER BALANCE: A CONTINUOUS APPROACH
- Fast computing global structural balance in signed networks based on memetic algorithm
- The maximum balanced subgraph of a signed graph: applications and solution approaches
Cited In (4)
- Estimating the number of weak balance structures in signed networks
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Structural balance of multiplex signed networks: a distributed data-driven approach
- Evolutionary prisoner's dilemma game on signed networks based on structural balance theory
This page was built for publication: Optimizing transformations of structural balance in signed networks with potential relationships
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1620110)