Parameterizing Network Graph Heterogeneity using a Modified Weibull Distribution

Abstract

We present a simple method to quantitatively capture the heterogeneity in the degree distribution of a network graph using a single parameter $\sigma$. Using an exponential transformation of the shape parameter of the Weibull distribution, this control parameter allows the degree distribution to be easily interpolated between highly symmetric and highly heterogeneous distributions on the unit interval. This parameterization of heterogeneity also recovers several other canonical distributions as intermediate special cases, including the Gaussian, Rayleigh, and exponential distributions. We then outline a general graph generation algorithm to produce graphs with a desired amount of heterogeneity. The utility of this formulation of a heterogeneity parameter is demonstrated with examples relating to epidemiological modeling and spectral analysis.

References in corpus (9)

• Epidemic spreading in scale-free networks
• Epidemic processes in complex networks
• Mean-field theory for scale-free random networks
• Connectivity of Growing Random Networks
• From Scale-free to Erdos-Renyi Networks
• Measure for degree heterogeneity in complex networks and its application to recurrence network analysis
• Normalised Degree Variance
• Emergence of Robust and Efficient Networks in a Family of Attachment Models
• Bifurcations in the Herd Immunity Threshold for Discrete-Time Models of Epidemic Spread

Cited by in corpus (1)

• Upper Bounds on Overshoot in SIR Models with Nonlinear Incidence