Null model: Difference between revisions

Revision as of 08:32, 24 November 2012

Revision as of 08:36, 24 November 2012

Line 2:

{{context|date=November 2012}}

The '''null model''' can be a [[Graph (mathematics)|graph]] which matches the original graph in some of its structural features, but which is otherwise a [[random graph]]. The null model is used as a term of comparison, to verify whether the graph at studyinquestion displays some feature, such as community structure, or not. The most popular

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>

The null model is the basic concept behind the definition of [[Modularity (networks)|modularity]], a function which evaluates the goodness of partitions of a graph into clusters.

==See also==

* [[Null hypothesis]]

==References==