Mutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directional Links

DOI10.1007/978-3-642-30541-2_9zbMath1343.91041arXiv1203.5474OpenAlexW1946531959MaRDI QIDQ2900589

Jie Bao, Yanhua Li, Zhi-Li Zhang

Publication date: 23 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Twitterdyadic methodsSlashdot

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Internet topics (68M11)

Related Items (3)

Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social Network ⋮ Clustering and community detection in directed networks: a survey ⋮ Voter Model on Signed Social Networks

This page was built for publication: Mutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directional Links