Advanced Search
MyIDEAS: Login to save this paper or follow this series

Enhanced network reconstruction from irreducible local information

Contents:

Author Info

  • Rossana Mastrandrea
  • Tiziano Squartini
  • Giorgio Fagiolo
  • Diego Garlaschelli

Abstract

Network topology plays a key role in many phenomena, from the spreading of diseases to that of nancial crises. Whenever the whole structure of a network is unknown, one must resort to reconstruction methods that identify the least biased ensemble of networks consistent with the partial information available. A challenging case is when there is only local (node-specic) information available. For binary networks, the relevant ensemble is one where the degree (number of links) of each node is constrained to its observed value. However, for weighted networks the problem is much more complicated. While the naive approach prescribes to constrain the strengths (total link weights) of all nodes, recent counter-intuitive results suggest that in weighted networks the degrees are often more informative than the strengths, and as `fundamental' as the latter. This implies that the reconstruction of weighted networks would be signicantly enhanced by the specication of both quantities, a computationally hard and bias-prone procedure. Here we solve this problem by introducing an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples. We consider several real-world applications and show that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Information-theoretic criteria rigorously conrm that the binary information is irreducible to the weighted one. Our results have strong implications for the analysis of motifs and communities and whenever the reconstructed ensemble is required as a null model to detect higher-order patterns.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://www.lem.sssup.it/WPLem/files/2013-16.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy in its series LEM Papers Series with number 2013/16.

as in new window
Length:
Date of creation: 10 Jul 2013
Date of revision:
Handle: RePEc:ssa:lemwps:2013/16

Contact details of provider:
Postal: Piazza dei Martiri della Liberta, 33, 56127 Pisa
Phone: +39-50-883343
Fax: +39-50-883344
Email:
Web page: http://www.lem.sssup.it/
More information through EDIRC

Related research

Keywords: Network reconstruction; Null models; Complex networks; Maximum entropy ensembles; Configuration model;

This paper has been announced in the following NEP Reports:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:ssa:lemwps:2013/16. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.