---
tag: ABGYE0F1H4
kind: concept
name: Soft configuration model
sources:
  - wikipedia: en:58486357@r1374107318
    locator: Soft configuration model
    note: adopted
    mention: wikipedia://en/58486357
    sections: [Summary]
same_as:
  wikidata: Q60775382
  wikipedia: Soft configuration model
inventory: [P1A7E79NP0]
---

## Summary

In applied mathematics, the **soft configuration model (SCM)** is a random graph model subject to the principle of maximum entropy under constraints on the expectation of the degree sequence of sampled [[graphs|00C0BR7D7H]]. Whereas the configuration model (CM) uniformly samples random graphs of a specific degree sequence, the SCM only retains the specified degree sequence on average over all network realizations; in this sense the SCM has very relaxed constraints relative to those of the CM ("soft" rather than "sharp" constraints). The SCM for graphs of size $n$ has a nonzero probability of sampling any graph of size $n$, whereas the CM is restricted to only graphs having precisely the prescribed connectivity structure.