Part of a series on
Network science
Theory
Graph Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis Optimization Reciprocity Closure Homophily Transitivity Preferential attachment Balance theory Network effect Social influence
Network types
Informational (computing) Telecommunication Transport Social Scientific collaboration Biological Artificial neural Interdependent Semantic Spatial Dependency Flow on-Chip
Graphs
Features Clique Component Cut Cycle Data structure Edge Loop Neighborhood Path Vertex Adjacency list / matrix Incidence list / matrix Types Bipartite Complete Directed Hyper Labeled Multi Random Weighted
Metrics Algorithms
Centrality Degree Motif Clustering Degree distribution Assortativity Distance Modularity Efficiency
Models
Topology Random graph Erdős–Rényi Barabási–Albert Bianconi–Barabási Fitness model Watts–Strogatz Exponential random (ERGM) Random geometric (RGG) Hyperbolic (HGN) Hierarchical Stochastic block Blockmodeling Maximum entropy Soft configuration LFR Benchmark Dynamics Boolean network agent based Epidemic/SIR
Lists Categories
Topics Software Network scientists Category:Network theory Category:Graph theory
v t e

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.

Overview

Any random graph model (at a fixed set of parameter values) results in a probability distribution on graphs, and those that are maximum entropy within the considered class of distributions have the special property of being maximally unbiased null models for network inference^[2] (e.g. biological network inference). Each model defines a family of probability distributions on the set of graphs of size ${\displaystyle n}$ (for each ${\displaystyle n>n_{0}}$ for some finite ${\displaystyle n_{0}}$), parameterized by a collection of constraints on ${\displaystyle J}$ observables ${\displaystyle \{Q_{j}(G)\}_{j=1}^{J}}$ defined for each graph ${\displaystyle G}$ (such as fixed expected average degree, degree distribution of a particular form, or specific degree sequence), enforced in the graph distribution alongside entropy maximization by the method of Lagrange multipliers. Note that in this context "maximum entropy" refers not to the entropy of a single graph, but rather the entropy of the whole probabilistic ensemble of random graphs.

Several commonly studied random network models are in fact maximum entropy, for example the ER graphs ${\displaystyle G(n,m)}$ and ${\displaystyle G(n,p)}$ (which each have one global constraint on the number of edges), as well as the configuration model (CM).^[3] and soft configuration model (SCM) (which each have ${\displaystyle n}$ local constraints, one for each nodewise degree-value). In the two pairs of models mentioned above, an important distinction^[4][5] is in whether the constraint is sharp (i.e. satisfied by every element of the set of size-${\displaystyle n}$ graphs with nonzero probability in the ensemble), or soft (i.e. satisfied on average across the whole ensemble). The former (sharp) case corresponds to a microcanonical ensemble,^[6] the condition of maximum entropy yielding all graphs ${\displaystyle G}$ satisfying ${\displaystyle Q_{j}(G)=q_{j}\forall j}$ as equiprobable; the latter (soft) case is canonical,^[7] producing an exponential random graph model (ERGM).

Model	Constraint type	Constraint variable	Probability distribution
ER, ${\displaystyle G(n,m)}$	Sharp, global	Total edge-count ${\displaystyle |E(G)|}$	${\displaystyle 1/{\binom {\binom {n}{2}}{m}};\ m=|E(G)|}$
ER, ${\displaystyle G(n,p)}$	Soft, global	Expected total edge-count ${\displaystyle |E(G)|}$	${\displaystyle p^{|E(G)|}(1-p)^{{\binom {n}{2}}-|E(G)|}}$
Configuration model	Sharp, local	Degree of each vertex, ${\displaystyle \{{\hat {k}}_{j}\}_{j=1}^{n}}$	${\displaystyle 1/\left\vert \Omega (\{{\hat {k}}_{j}\}_{j=1}^{n})\right\vert ;\Omega (\{k_{j}\}_{j=1}^{n})=\{g\in {\mathcal {G}}_{n}:k_{j}(g)={\hat {k}}_{j}\forall j\}\subset {\mathcal {G}}_{n}}$
Soft configuration model	Soft, local	Expected degree of each vertex, ${\displaystyle \{{\hat {k}}_{j}\}_{j=1}^{n}}$	${\displaystyle Z^{-1}\exp \left;\ -{\frac {\partial \ln Z}{\partial \psi _{j}}}={\hat {k}}_{j}}$

Canonical ensemble of graphs (general framework)

Suppose we are building a random graph model consisting of a probability distribution ${\displaystyle \mathbb {P} (G)}$ on the set ${\displaystyle {\mathcal{G}}_n}$Zdroj:https://en.wikipedia.org?pojem=Maximum-entropy_random_graph_model
Text je dostupný za podmienok Creative Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších podmienok. Podrobnejšie informácie nájdete na stránke Podmienky použitia.