Weighted Configuration Model

• Weighted Configuration Model is a class of random weighted network ensembles that generalizes the classic configuration model by assigning integer edge weights to preserve prescribed node strengths.
• It features both microcanonical and canonical formulations, applying geometric and Poisson approximations to isolate network constraints and assess statistical significance.
• Advanced extensions introduce scale invariance, degree-dependent weights for epidemic modeling, and maximum-entropy generalizations, providing robust frameworks for complex network analysis.

Searching arXiv for recent and foundational papers on the Weighted Configuration Model to ground the article. to=arxiv_search.search 大发游戏官网 菲律宾申博json {"query":"Weighted Configuration Model weighted networks null model scale invariance configuration multi-edge model weighted configuration model epidemics weighted hypersoft configuration model", "max_results": 10, "sort_by": "relevance"} I found several directly relevant arXiv records and will use them to support the article, especially the 2025 scale-invariance analysis, the multi-edge/null-model formulation, the epidemic variant, and hypersoft/generalized extensions. The Weighted Configuration Model (WCM) denotes a family of random weighted-network ensembles obtained by extending the configuration model from unweighted edges to weighted interactions. In the null-model literature, the central construction is a weighted multigraph ensemble with prescribed node strengths, in which edge weights are interpreted as bundles of unit edges and randomized by stub matching; closely related grand-canonical formulations replace exact constraints by expected constraints and yield factorized edge-weight laws (Silva et al., 28 Oct 2025, Sagarra et al., 2014). The same label is also used in adjacent literatures for degree-dependent weighted stub matchings in epidemic models and for configuration models endowed with i.i.d. edge lengths (Britton et al., 2011). This suggests that the WCM is best understood as a class of related constructions whose common purpose is to isolate the consequences of degree, strength, or weight constraints from higher-order structure.

1. Formal strength-preserving ensemble

In its standard null-model form, the WCM is defined on an undirected weighted multigraph $G$ on $N$ vertices, without self-loops unless stated otherwise. The edge weight on $(i,j)$ is an integer $W_{ij}\in\{0,1,2,\dots\}$, the node strength is

$s_i=\sum_j W_{ij},$

and the total stub count is

$2W=\sum_i s_i.$

The microcanonical WCM is the uniform ensemble over all weighted multigraphs with prescribed strength sequence $\{s_i\}$. Equivalently, each weight $W_{ij}$ is split into $W_{ij}$ unit-weight stubs attached to $i$ and $N$0, and the $N$1 stubs are paired uniformly at random. The constraint is exact: $N$2

If self-loops are forbidden, the state count is

$N$3

so every admissible graph has probability

$N$4

and equivalently

$N$5

This formulation makes explicit the original intuition behind the model: weights are treated as multiplicities of parallel unit interactions. In that sense, the WCM is not merely a weighted analogue of the configuration model; it is a multigraph ensemble in which the strength sequence plays the role that the degree sequence plays in the unweighted case (Silva et al., 28 Oct 2025).

2. Canonical relaxations and the configuration multi-edge model

A canonical or maximum-entropy version replaces exact strength preservation by constraints on expected strengths. Writing the Lagrange multipliers as $N$6, the ensemble probability factorizes as

$N$7

with partition function

$N$8

Each $N$9 is then geometric,

$(i,j)$0

and the multipliers are fixed by the $(i,j)$1 constraints

$(i,j)$2

In sparse regimes with large weights, a Chung–Lu approximation replaces the geometric law by a Poisson law with the same mean,

$(i,j)$3

so that the full ensemble factorizes over pairs (Silva et al., 28 Oct 2025).

A closely related grand-canonical formulation for multi-edge networks uses nonnegative integer occupation numbers $(i,j)$4 on node pairs $(i,j)$5, with strengths

$(i,j)$6

Maximizing entropy under $(i,j)$7 yields independent Poisson occupations,

$(i,j)$8

where

$(i,j)$9

Introducing hidden variables $W_{ij}\in\{0,1,2,\dots\}$0, one obtains

$W_{ij}\in\{0,1,2,\dots\}$1

with $W_{ij}\in\{0,1,2,\dots\}$2 and a common normalization $W_{ij}\in\{0,1,2,\dots\}$3. In this ensemble,

$W_{ij}\in\{0,1,2,\dots\}$4

and higher moments follow the Poisson law. The same framework gives analytic approximations for ensemble-averaged observables such as node degree, disparity, average neighbor properties, and the occupation-number distribution, typically by multivariate Taylor expansion around the means $W_{ij}\in\{0,1,2,\dots\}$5 (Sagarra et al., 2014).

The principal caveat is structural: edges are independent, multiple edges and self-loops may be allowed, higher-order correlations are absent, and grand-canonical enforcement fixes strengths only on average. For observables that depend sensitively on rare large weights, truncated Taylor expansions may also be inaccurate (Sagarra et al., 2014).

3. Scale invariance and null-model validity

A central recent result is that the conventional WCM is scale-dependent when used for statistical significance in weighted networks. If all original weights are multiplied by a factor $W_{ij}\in\{0,1,2,\dots\}$6, then

$W_{ij}\in\{0,1,2,\dots\}$7

In the microcanonical WCM, for $W_{ij}\in\{0,1,2,\dots\}$8,

$W_{ij}\in\{0,1,2,\dots\}$9

with mean

$s_i=\sum_j W_{ij},$0

and variance $s_i=\sum_j W_{ij},$1. In the canonical or Poisson approximation,

$s_i=\sum_j W_{ij},$2

Many weighted observables of practical interest are dimensionless in the weights. For a first-order Taylor expansion around the mean matrix $s_i=\sum_j W_{ij},$3,

$s_i=\sum_j W_{ij},$4

Because $s_i=\sum_j W_{ij},$5 scales as $s_i=\sum_j W_{ij},$6 while $s_i=\sum_j W_{ij},$7 scales as $s_i=\sum_j W_{ij},$8, the standard deviation of $s_i=\sum_j W_{ij},$9 over the WCM ensemble scales as $2W=\sum_i s_i.$0. As $2W=\sum_i s_i.$1 grows, the null distribution collapses and the corresponding $2W=\sum_i s_i.$2-values tend to zero. Statistical significance therefore depends on the arbitrary unit in which weights are measured, even though in most cases the result should be invariant under that choice (Silva et al., 28 Oct 2025).

A scale-invariant alternative separates topology from weights in two steps. First, a binary skeleton is randomized via the unweighted configuration model or its canonical Chung–Lu form, preserving the degree sequence $2W=\sum_i s_i.$3 in expectation: $2W=\sum_i s_i.$4 Second, for pairs with $2W=\sum_i s_i.$5, continuous weights $2W=\sum_i s_i.$6 are drawn independently from an exponential law,

$2W=\sum_i s_i.$7

with

$2W=\sum_i s_i.$8

The final weighted graph is

$2W=\sum_i s_i.$9

and the joint measure is

$\{s_i\}$0

Under the rescaling $\{s_i\}$1, the rates $\{s_i\}$2 are unchanged, so the null distribution is invariant. In applications to weighted clustering, eigenvector centrality, and modularity, this two-step model yields unit-independent $\{s_i\}$3-values; clustering often remains significant, eigenvector centrality typically is not, and modularity significance varies with the network (Silva et al., 28 Oct 2025).

4. Degree-dependent weights and epidemic thresholds

In epidemic modeling, the WCM has been used in a different but related sense: a random graph with prescribed degree distribution and degree-dependent edge weights. Each vertex $\{s_i\}$4 receives an i.i.d. degree

$\{s_i\}$5

and, conditional on $\{s_i\}$6, its $\{s_i\}$7 stubs receive i.i.d. integer weights $\{s_i\}$8 with

$\{s_i\}$9

For each weight value $W_{ij}$0, stubs carrying that value are paired uniformly at random; if the number of $W_{ij}$1-stubs is odd, one stub is dropped, which vanishes in the $W_{ij}$2 limit.

If

$W_{ij}$3

then, in the large-$W_{ij}$4 approximation, the probability that two vertices of observed degrees $W_{ij}$5 and $W_{ij}$6 are joined by an edge of weight $W_{ij}$7 is

$W_{ij}$8

and summing over $W_{ij}$9 gives the total connection probability.

The giant-component threshold is expressed through a multi-type branching process with type indexed by weight class. The mean offspring matrix is

$W_{ij}$0

and a giant component appears iff

$W_{ij}$1

In the special unweighted case $W_{ij}$2, this reduces to the classical condition

$W_{ij}$3

For epidemics, if an edge of weight $W_{ij}$4 transmits independently with probability $W_{ij}$5, the corresponding offspring matrix becomes

$W_{ij}$6

and the basic reproduction number is

$W_{ij}$7

Equivalently, one may work with a degree-indexed matrix

$W_{ij}$8

with

$W_{ij}$9

If $i$0, this collapses to

$i$1

This formulation isolates the effect of degree–weight correlations. If high-degree vertices tend to have larger weights and $i$2 increases with $i$3, the offspring matrix becomes more top-heavy and $i$4 increases; if high-degree vertices carry systematically lower weights, $i$5 decreases. Empirical fitting therefore requires estimating both $i$6 and $i$7, rather than treating weight and degree as independent attributes (Britton et al., 2011).

5. Maximum-entropy generalizations and asymptotic properties

The WCM sits inside a broader hierarchy of maximum-entropy ensembles. In the weighted hypersoft configuration model, entropy

$i$8

is maximized not with a fixed degree or strength sequence, but with the empirical distribution of expected degrees and strengths constrained to converge to a target $i$9. The Hamiltonian is

$N$00

so the ensemble measure is

$N$01

Constructively, for each pair $N$02,

$N$03

and, conditional on connection,

$N$04

The expected degree and strength satisfy

$N$05

For target laws with $N$06, $N$07, and deterministic scaling $N$08, $N$09, the sparse limit yields Poisson degrees conditioned on $N$10, power-law marginal degree and strength distributions, and superlinear scaling $N$11. As a null model, it contains no higher-order structure beyond the imposed degree–strength statistics (Voitalov et al., 2020).

A different asymptotic direction concerns weighted adjacency matrices over arbitrary fields. In that setting, one prescribes a degree sequence, generates a configuration-model multigraph, independently fixes a symmetric nonzero weight matrix $N$12, and defines

$N$13

Under regularity assumptions on the empirical degree law,

$N$14

in probability, where

$N$15

The limiting normalized rank depends only on the degree distribution, not on the nonzero weights and not on the field $N$16. This result shows that, for this class of weighted configuration models, certain global linear-algebraic observables are asymptotically insensitive to the specific nonzero edge weights (Hofstad et al., 4 Aug 2025).

6. Terminological scope and related weighted configuration models

The expression weighted configuration model is not uniform across the literature. In one important usage, the graph is first generated by the configuration model and then given i.i.d. edge lengths $N$17 from a common distribution $N$18, yielding a weighted graph denoted

$N$19

For vertices $N$20, the graph distance is

$N$21

the weighted distance is

$N$22

and the hopcount is the number of edges in the $N$23-shortest path.

For scale-free degree sequences with exponent $N$24, the weighted-distance behavior depends on whether the associated age-dependent branching process is explosive. Writing

$N$25

the process is explosive if $N$26 and non-explosive if $N$27. In the non-explosive case,

$N$28

with

$N$29

In the explosive case,

$N$30

The same first-order behavior persists in the erased configuration model, where loops and multiple edges are removed (Adriaans et al., 2017).

This terminological breadth is methodologically consequential. In some papers, “weighted” means integer edge multiplicities constrained by node strengths; in others it means degree-dependent edge weights, continuous positive weights assigned after topology generation, or i.i.d. edge lengths used to define first-passage metrics. The common thread is the configuration-model backbone, but the constrained quantities, the sampling measure, and the observables of interest differ substantially.