Maximum-entropy random graph model
From Wikipedia, the free encyclopedia
Maximum-entropy random graph models are random graph models used to study complex networks subject to the principle of maximum entropy under a set of structural constraints,[1] which may be global, distributional, or local.