2012
DOI: 10.1098/rsif.2012.0490
|View full text |Cite
|
Sign up to set email alerts
|

Artefacts in statistical analyses of network motifs: general framework and application to metabolic networks

Abstract: Few-node subgraphs are the smallest collective units in a network that can be investigated. They are beyond the scale of individual nodes but more local than, for example, communities. When statistically over-or under-represented, they are called network motifs. Network motifs have been interpreted as building blocks that shape the dynamic behaviour of networks. It is this promise of potentially explaining emergent properties of complex systems with relatively simple structures that led to an interest in netwo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
38
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 41 publications
(38 citation statements)
references
References 69 publications
0
38
0
Order By: Relevance
“…In particular, it is difficult to decide which low-level topological properties of the network data the null model networks should capture while at the same time the connectivity between vertices varies stochastically. Using an inappropriate null model in the statistical test might introduce a bias in the assignment of significance to subnetworks [30], [31]. The null model widely employed by original network motif detection preserves the in-degree and out-degree sequence.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In particular, it is difficult to decide which low-level topological properties of the network data the null model networks should capture while at the same time the connectivity between vertices varies stochastically. Using an inappropriate null model in the statistical test might introduce a bias in the assignment of significance to subnetworks [30], [31]. The null model widely employed by original network motif detection preserves the in-degree and out-degree sequence.…”
Section: Methodsmentioning
confidence: 99%
“…In particular, rejected switches, which correspond to the transition from a network to itself, are also counted. Note that the edge-switching algorithm does not preserve the number of bidirectional links, which might be reasonable in several contexts [31].…”
Section: Methodsmentioning
confidence: 99%
“…Some critics have questioned Alon's methods of evaluating whether the frequency of subgraphs is beyond what would be expected by chance (cf. Beber, Fretter, Jain, Sonnenschein, Muller-Hannemann, and Hutt, 2012). Searching for overabundant circuit patterns in networks can, however, be useful as a heuristic regardless of the soundness of the null hypothesis used in the comparison, provided that this the network analysis is combined with other strategies that account for the details that network analyses neglect or distort.…”
Section: Figure 1 Example Of a Motif A Coherent Feedforward Loop Ofmentioning
confidence: 99%
“…The results of a wide range of our own investigations over the last years have their foundations in statistical physics and information theory [2,4,[25][26][27][28][29][30][31]. They have cemented the notion of a tight interplay of the regulatory network implemented via TFs and their binding sites (digital control); and the regulation implemented via alterations of chromosomal configuration and DNA compaction (analog control) in bacterial gene regulation (depicted in Fig.…”
Section: Introductionmentioning
confidence: 99%