Sciweavers

Share
BIOCOMP
2006

Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks

9 years 5 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outstanding problem if the number of nodes within a network is not small. For example, high-throughput data from gene networks of, e.g., metabolic, signaling or transcriptional regulatory networks, provide information of thousands of genes or products thereof. Theoretically, the graph-theoretical measure dseparation provides a criteria to recover the network structure edge-by-edge by calculating the partial correlation. However, practically, for large networks it is not possible to estimate the partial correlation up to an arbitrary order because the number of possible d-separating sets grows exponential with the number of nodes in the network. In this paper, we determine numerically theoretical bounds for the number of inferable edges in directed (possible cyclic) sparse random networks if the maximal size of d-se...
Frank Emmert-Streib, Matthias Dehmer
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where BIOCOMP
Authors Frank Emmert-Streib, Matthias Dehmer
Comments (0)
books