Null model

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, in the study of statistical properties of graphs, the null model is a graph which matches one specific graph in some of its structural features, but which is otherwise taken to be an instance of a random graph. The null model is used as a term of comparison, to verify whether the graph in question displays some feature, such as community structure, or not.

One null model is that proposed by Newman and Girvan and consists of a randomized version of the original graph, where edges are rewired at random, under the constraint that the expected degree of each vertex matches the degree of the vertex in the original graph.[1]

The null model is the basic concept behind the definition of modularity, a function which evaluates the goodness of partitions of a graph into clusters.

See also[edit]

References[edit]

  1. ^ M.E.J, Newman; M.Girvan (2004). "Finding and evaluating community structure in networks". Phys. Rev. E. 69 (2). doi:10.1103/physreve.69.026113.