?url_ver=Z39.88-2004&rft_id=arXiv%3A1706.00230&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Feprints.imtlucca.it%2F4036%2F&rft.title=Irreducible+network+backbones%3A+unbiased+graph+filtering+via+maximum+entropy&rft.creator=Gemmetto%2C+Valerio&rft.creator=Cardillo%2C+Alessio&rft.creator=Garlaschelli%2C+Diego&rft.subject=QC+Physics&rft.description=Networks+provide+an+informative%2C+yet+non-redundant+description+of+complex+systems+only+if+links+represent+truly+dyadic+relationships+that+cannot+be+directly+traced+back+to+node-specific+properties+such+as+size%2C+importance%2C+or+coordinates+in+some+embedding+space.+In+any+real-world+network%2C+some+links+may+be+reducible%2C+and+others+irreducible%2C+to+such+local+properties.+This+dichotomy+persists+despite+the+steady+increase+in+data+availability+and+resolution%2C+which+actually+determines+an+even+stronger+need+for+filtering+techniques+aimed+at+discerning+essential+links+from+non-essential+ones.+Here+we+introduce+a+rigorous+method+that%2C+for+any+desired+level+of+statistical+significance%2C+outputs+the+network+backbone+that+is+irreducible+to+the+local+properties+of+nodes%2C+i.e.+their+degrees+and+strengths.+Unlike+previous+approaches%2C+our+method+employs+an+exact+maximum-entropy+formulation+guaranteeing+that+the+filtered+network+encodes+only+the+links+that+cannot+be+inferred+from+local+information.+Extensive+empirical+analysis+confirms+that+this+approach+uncovers+essential+backbones+that+are+otherwise+hidden+amidst+many+redundant+relationships+and+inaccessible+to+other+methods.+For+instance%2C+we+retrieve+the+hub-and-spoke+skeleton+of+the+US+airport+network+and+many+specialised+patterns+of+international+trade.+Being+irreducible+to+local+transportation+and+economic+constraints+of+supply+and+demand%2C+these+backbones+single+out+genuinely+higher-order+wiring+principles.&rft.publisher=arXiv&rft.date=2017&rft.type=Working+Paper&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.rights=cc_by_nc&rft.identifier=http%3A%2F%2Feprints.imtlucca.it%2F4036%2F1%2F1706.00230.pdf&rft.identifier=++Gemmetto%2C+Valerio+and+Cardillo%2C+Alessio+and+Garlaschelli%2C+Diego++Irreducible+network+backbones%3A+unbiased+graph+filtering+via+maximum+entropy.++Working+Paper+++arXiv+++++++(Submitted)+++&rft.relation=http%3A%2F%2Farxiv.org%2Fpdf%2F1706.00230&rft.relation=arXiv%3A1706.00230