Location of Repository

Reconstruction of a real world social network using the Potts model and Loopy Belief Propagation

By Cristian eBisconti, Angelo eCorallo, Laura eFortunato, Antonio Andrea Gentile, Andrea eMassafra and Piergiuseppe ePellè

Abstract

The scope of this paper is to test the adoption of a statistical model derived from Condensed Matter Physics, aiming at the reconstruction of a networked structure from observations of the states of the nodes in the network.The inverse Potts model, normally applied to observations of quantum states, is here addressed to observations of the node states in a network and their (anti)correlations, thus inferring interactions as links connecting the nodes. Adopting the Bethe approximation, such an inverse problem is known to be tractable.Within this operational framework, we discuss and apply this network-reconstruction method to a small real-world social network, where it is easy to track statuses of its members: the Italian parliament, adopted as a case study. The dataset is made of (co)sponsorships of law proposals by parliament members. In previous studies of similar activity-based networks, the graph structure was inferred directly from activity co-occurrences: here we compare our statistical reconstruction with standard methods, outlining discrepancies and advantages

Topics: inverse problem, social network analysis, network reconstruction, quantum structures, community detection, Potts Model, Psychology, BF1-990
Publisher: Frontiers Media S.A.
Year: 2015
DOI identifier: 10.3389/fpsyg.2015.01698
OAI identifier: oai:doaj.org/article:32552459335f4d8d9ffe88f5006ad280
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/1664-1078 (external link)
  • http://journal.frontiersin.org... (external link)
  • https://doaj.org/article/32552... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.