UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Tackling Information Asymmetry in Networks: A New Entropy-Based Ranking Index

Barucca, P; Caldarelli, G; Squartini, T; (2018) Tackling Information Asymmetry in Networks: A New Entropy-Based Ranking Index. Journal of Statistical Physics , 173 (3-4) pp. 1028-1044. 10.1007/s10955-018-2076-z. Green open access

[img]
Preview
Text
1710.09656v1.pdf - Accepted version

Download (1MB) | Preview

Abstract

Information is a valuable asset in socio-economic systems, a significant part of which is entailed into the network of connections between agents. The different interlinkages patterns that agents establish may, in fact, lead to asymmetries in the knowledge of the network structure; since this entails a different ability of quantifying relevant, systemic properties (e.g. the risk of contagion in a network of liabilities), agents capable of providing a better estimation of (otherwise) inaccessible network properties, ultimately have a competitive advantage. In this paper, we address the issue of quantifying the information asymmetry of nodes: to this aim, we define a novel index—InfoRank—intended to rank nodes according to their information content. In order to do so, each node ego-network is enforced as a constraint of an entropy-maximization problem and the subsequent uncertainty reduction is used to quantify the node-specific accessible information. We, then, test the performance of our ranking procedure in terms of reconstruction accuracy and show that it outperforms other centrality measures in identifying the “most informative” nodes. Finally, we discuss the socio-economic implications of network information asymmetry.

Type: Article
Title: Tackling Information Asymmetry in Networks: A New Entropy-Based Ranking Index
Open access status: An open access version is available from UCL Discovery
DOI: 10.1007/s10955-018-2076-z
Publisher version: http://doi.org/10.1007/s10955-018-2076-z
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Complex networks, Shannon entropy, Information theory, Ranking algorithm
UCL classification: UCL
UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/10051776
Downloads since deposit
29Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item