Null model: Difference between revisions

Revision as of 11:05, 24 November 2012

Revision as of 12:33, 24 November 2012

Line 1:

{{for|use in statistical testing|Statistical model}}

{{for|use in ecology|Theoretical_ecologyTheoretical ecology}}

{{orphan|date=November 2012}}

In mathematics, in the study of statisicalstatistical properties of [[Graph (mathematics)|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.<ref>{{cite journal|last=M.E.J|first=Newman|coauthors=M.Girvan|title=Finding and evaluating community structure in networks|journal=Phys. Rev. E|year=2004|volume=69|issue=2}}</ref>

Line 13:

==References==

<references />