Weighted hypersoft configuration model

  title={Weighted hypersoft configuration model},
  author={Ivan Voitalov and Pim van der Hoorn and Maksim Kitsak and Fragkiskos Papadopoulos and Dmitri V. Krioukov},
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… 

Figures and Tables from this paper

An anomalous topological phase transition in spatial random graphs

Clustering–the tendency for neighbors of nodes to be connected–quantifies the coupling of a complex network to its latent metric space. In random geometric graphs, clustering undergoes a continuous

The Random Plots Graph Generation Model for Studying Systems with Unknown Connection Structures

A new random graph generator is proposed, Random Plots, in which a diversified set of vertex degree distributions are generated and target a graph generator at each of the constructed distributions, one-by-one, to obtain the ensemble of graphs.

Dynamics of hot random hyperbolic graphs

Hot random hyperbolic graphs are not adequate null models for real temporal networks, in stark contrast to cold random hyperBolic graphs (T < 1), and the configuration model emerges at T →∞ is suggested.

Meta-validation of bipartite network projections

A meta-validation approach is proposed that allows to identify model-specific significance thresholds for which the signal is strongest, and at the same time to obtain results independent of the way in which the null hypothesis is formulated.

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

Two versions of the mobility-based SIR model, fully mixed and for complex networks, are proposed, which takes into account the population distribution, connectivity of different geographic locations across the globe, and individuals’ network connectivity information.



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

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.

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

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.

Entropy of network ensembles.

  • G. Bianconi
  • Computer Science
    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.

The entropy of randomized network ensembles

This paper characterize these randomized network ensembles by their entropy, i.e. the normalized logarithm of the total number of networks which are part of these ensemble, and proposes entropy as an indicator to assess the role of each structural feature in a given real network.

Unbiased sampling of network ensembles

The introduction of a ‘Maximize and Sample’ (‘Max & Sam’ for short) method to correctly sample ensembles of networks where the constraints are ‘soft’, which is based on exact maximum-entropy distributions and is therefore unbiased by construction, even for strongly heterogeneous networks.

The average distances in random graphs with given expected degrees

  • F. ChungLinyuan Lu
  • Mathematics, Computer Science
    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.

A Weighted Configuration Model and Inhomogeneous Epidemics

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

Statistical mechanics of networks.

  • Juyong ParkM. Newman
  • Computer Science
    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

Connected Components in Random Graphs with Given Expected Degree Sequences

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

The hidden geometry of weighted complex networks

  • 2016