Computer Science - Social and Information Networks Physics - Physics and Society
Structural balance theory assumes triads in networks to gravitate towards
stable configurations. The theory has been verified for undirected graphs.
Since real-world networks are often directed, we introduce a novel method for
considering both transitivity and sign consistency for calculating balance in
signed digraphs. We test our approach on graphs that we constructed by using
different methods for identifying edge signs: natural language processing to
infer signs from underlying text data, and self-reported survey data. Our
results show that for various social contexts and edge sign detection methods,
balance is moderately high, ranging from 67.5% to 92.4%.
Metrics
6 Record Views
Details
Title
Structural balance in signed digraphs: considering transitivity to measure balance in graphs constructed by using different link signing methods
Creators
Ly Dinh
Rezvaneh Rezapour
Lan Jiang
Jana Diesner
Publication Details
arXiv (Cornell University)
Resource Type
Preprint
Language
English
Academic Unit
Information Science (Informatics)
Other Identifier
991021861646304721
Research Home Page
Browse by research and academic units
Learn about the ETD submission process at Drexel
Learn about the Libraries’ research data management services