Show simple item record

dc.contributor.authorMondragon, RJen_US
dc.date.accessioned2016-11-14T11:34:32Z
dc.date.available2014-02-14en_US
dc.date.issued2012-10-08en_US
dc.date.submitted2016-08-25T16:35:00.865Z
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/17610
dc.description11 pages, 4 figures
dc.description11 pages, 4 figures
dc.description11 pages, 4 figuresen_US
dc.description11 pages, 4 figuresen_US
dc.description11 pages, 4 figuresen_US
dc.description.abstractWe present a method to construct a network null-model based on the maximum entropy principle and where the restrictions that the rich-club and the degree sequence impose are conserved. We show that the probability that two nodes share a link can be described with a simple probability function. The null-model closely approximates the assortative properties of the network.en_US
dc.format.extent288 - 298 (10)en_US
dc.languageEnglishen_US
dc.publisherOxford University Pressen_US
dc.relation.ispartofJournal of Complex Networksen_US
dc.rightsThis is a pre-copyedited, author-produced PDF of an article accepted for publication in Journal of Complex Networks following peer review. The version of record is available http://comnet.oxfordjournals.org/content/2/3/288.short
dc.subjectphysics.soc-phen_US
dc.subjectphysics.soc-phen_US
dc.subjectcs.SIen_US
dc.subjectstat.MEen_US
dc.titleNetwork Null Model based on Maximal Entropy and the Rich-Cluben_US
dc.typeArticle
dc.rights.holder© The authors 2014. Published by Oxford University Press. All rights reserved.
dc.identifier.doi10.1093/comnet/cnu006en_US
pubs.author-urlhttp://arxiv.org/abs/1210.2211v2en_US
pubs.issue3en_US
pubs.notesNot knownen_US
pubs.publication-statusPublisheden_US
pubs.publisher-urlhttp://comnet.oxfordjournals.org/en_US
pubs.volume2en_US
dcterms.dateAccepted2014-02-14en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record