2012/10/08 by Raúl J. Mondragón, R. J. Mondragon, Mondragon, R. J.
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Computer and information sciences #FOS: Physical sciences #Methodology (stat.ME) #Opinion Dynamics and Social Influence #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI) #Topological and Geometric Data Analysis #cs.SI #physics.soc-ph #stat.ME
paper · pdf · doi:10.48550/arxiv.1210.2211
11 pages, 4 figures
openalex publication_date 2012/10/08 · arxiv created 2014/01/10 · arxiv updated 2014/01/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We 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.