Optimizing transformations of structural balance in signed networks with potential relationships

DOI10.1016/J.PHYSA.2016.08.027MaRDI QIDQ1620110zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

optimizationtransformationstructural balancesigned networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30)

Recommendations

• Approximation algorithms for balancing signed graphs
• Rethinking structural balance in signed social networks
• Survey of signed network research
• Measuring partial balance in signed networks
• Projecting signed two-mode networks

Cites work

• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
• Fast computing global structural balance in signed networks based on memetic algorithm
• Networks, crowds and markets. Reasoning about a highly connected world.
• THE HEIDER BALANCE: A CONTINUOUS APPROACH
• 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)