Characterizing attitudinal network graphs through frustration cloud

DOI10.1007/s10618-021-00795-zzbMath1486.91069arXiv2009.07776OpenAlexW3202258359WikidataQ125631971 ScholiaQ125631971MaRDI QIDQ2066654

Lucas J. Rusnak, Jelena Tešić

Publication date: 14 January 2022

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.07776

zbMATH Keywords

signed graphconsensusbalanced graphstatuscontroversyfrustration cloud

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Signed and weighted graphs (05C22)

Related Items (2)

Oriented hypergraphs: balanceability ⋮ graphB

Uses Software

• NetworkX
• SNAP
• GitHub

Cites Work

• Oriented hypergraphs: introduction and balance
• Signed graphs
• The number of nets of the regular convex polytopes in dimension \(\leq 4\)
• Network modelling and variational Bayesian inference for structure analysis of signed networks
• Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
• On the eigenvalues of trees
• On the notion of balance of a signed graph
• Algorithms for Generating Fundamental Cycles in a Graph
• Consensus Problems on Networks With Antagonistic Interactions
• Status quo analysis in the graph model for conflict resolution
• A modeling and computational study of the frustration index in signed networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing attitudinal network graphs through frustration cloud