Null model: Difference between revisions

Revision as of 08:36, 24 November 2012

Revision as of 08:38, 24 November 2012

Line 1:

{{orphan|date=November 2012}}

{{context|date=November 2012}}

TheIn '''nullmathematics, model'''in canthe bestudy aof statisical properties of [[Graph (mathematics)|graphgraphs]], the '''null model''' is a graph which matches theone originalspecific 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 inquestionin 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>