# Weighted hypersoft configuration model

@article{Voitalov2020WeightedHC, title={Weighted hypersoft configuration model}, author={Ivan Voitalov and Pim van der Hoorn and Maksim Kitsak and Fragkiskos Papadopoulos and Dmitri V. Krioukov}, journal={ArXiv}, year={2020}, volume={abs/2007.00124} }

Maximum entropy null models of networks come in different flavors that depend on the type of the constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration models. If the degree sequence is constrained exactly, the corresponding microcanonical ensemble of random graphs with a given degree sequence is the configuration model per se. If the degree sequence is constrained only on average, the corresponding… Expand

#### Figures and Tables from this paper

#### One Citation

Mobility-based SIR model for complex networks: with case study Of COVID-19

- Social Network Analysis and Mining
- 2021

In the last decade, humanity has faced many different pandemics such as SARS, H1N1, and presently novel coronavirus (COVID-19). On one side, scientists have developed vaccinations, and on the other… Expand

#### References

SHOWING 1-10 OF 106 REFERENCES

Entropy distribution and condensation in random networks with a given degree distribution.

- Mathematics, Medicine
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2014

It is shown that the leading term of the entropy of scale-free network ensembles depends only on the network size and average degree and that entropy is self-averaging, meaning that its relative variance vanishes in the thermodynamic limit. Expand

Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution

- Mathematics, Physics
- ArXiv
- 2017

It is proved that the hypersoft configuration model, belonging to the class of random graphs with latent hyperparameters, is an ensemble of random power-law graphs that are sparse, unbiased, and either exchangeable or projective. Expand

Entropy of network ensembles.

- Mathematics, Physics
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2009

The structural entropy is defined and evaluated, i.e., the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence, and a solution to the paradox is proposed by proving that scale-free degree distributions are the most likely degree distribution with the corresponding value of the structural entropy. Expand

The entropy of randomized network ensembles

- Physics
- 2008

Randomized network ensembles are the null models of real networks and are extensively used to compare a real system to a null hypothesis. In this paper we study network ensembles with the same degree… Expand

Unbiased sampling of network ensembles

- Physics, Computer Science
- ArXiv
- 2014

A 'Maximize and Sample' ('Max & Sam' for short) method to correctly sample ensembles of networks where the constraints are 'soft', i.e. realized as ensemble averages, which is based on exact maximum-entropy distributions and is therefore unbiased by construction, even for strongly heterogeneous networks. Expand

The average distances in random graphs with given expected degrees

- Mathematics, Medicine
- Proceedings of the National Academy of Sciences of the United States of America
- 2002

It is shown that for certain families of random graphs with given expected degrees the average distance is almost surely of order log n/log d́, where d̃ is the weighted average of the sum of squares of the expected degrees. Expand

A Weighted Configuration Model and Inhomogeneous Epidemics

- Mathematics
- 2011

A random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped with a random number of half-edges and each half-edge… Expand

Statistical mechanics of networks.

- Mathematics, Physics
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2004

We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of… Expand

Connected Components in Random Graphs with Given Expected Degree Sequences

- Mathematics
- 2002

Abstract. We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability proportional to the product of the expected degrees of its… Expand

The statistical physics of real-world networks

- Computer Science, Physics
- ArXiv
- 2018

This Review describes advances in the statistical physics of complex networks and provides a reference for the state of the art in theoretical network modelling and applications to real-world systems for pattern detection and network reconstruction. Expand