Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2015 Aug 19;10(8):e0135636.
doi: 10.1371/journal.pone.0135636. eCollection 2015.

Obstructions to Sampling Qualitative Properties

Affiliations

Obstructions to Sampling Qualitative Properties

Arne C Reimers. PLoS One. .

Abstract

Background: Sampling methods have proven to be a very efficient and intuitive method to understand properties of complicated spaces that cannot easily be computed using deterministic methods. Therefore, sampling methods became a popular tool in the applied sciences.

Results: Here, we show that sampling methods are not an appropriate tool to analyze qualitative properties of complicated spaces unless RP = NP. We illustrate these results on the example of the thermodynamically feasible flux space of genome-scale metabolic networks and show that with artificial centering hit and run (ACHR) not all reactions that can have variable flux rates are sampled with variables flux rates. In particular a uniform sample of the flux space would not sample the flux variabilities completely.

Conclusion: We conclude that unless theoretical convergence results exist, qualitative results obtained from sampling methods should be considered with caution and if possible double checked using a deterministic method.

PubMed Disclaimer

Conflict of interest statement

Competing Interests: The authors have declared that no competing interests exist.

Figures

Fig 1
Fig 1. Toy network.
Internal reactions r 1, r 2, r 3, r 4 are irreversible. By thermodynamics, it is not possible to have non-zero flux through r 1 and also to have a non-zero flux through one of r 2, r 3 or r 4 at the same time.
Fig 2
Fig 2. Flux space of toy network.
The gray area denotes the flux space. In this example it was assumed that input/output flux values are constrained to at most 1. It can be seen that flux v 1 through r 1 is exclusive to fluxes v 2 and v 3 through r 2 and r 3 respectively. Since fluxes through r 2 can be combined with fluxes through r 3, the flux space with v 2, v 3 > 0 is two-dimensional, while the flux space with v 1 > 0 is only one-dimensional. Hence, a uniform sample of the flux space would almost surely have zero flux through r 1.
Fig 3
Fig 3. Sampling results with 10000 sample points.
The y-axis shows the ratio for how many reactions that can have positive/negative flux the sampling method did not sample at least one such flux vector.
Fig 4
Fig 4. Distribution of E. coli iAF1260 flux variability that is missed by sampling.
Histograms (a) and (c) are for the flux space without thermodynamic constraints, histograms (b) and (d) are with thermodynamic constraints. The bins in histograms (a) and (b) count the number of reactions with the respective lower and upper bounds computed by FVA. Bounds equal to 0 are not counted. Histograms (c) and (d) show, for the lower and upper bounds shown in (a) and (b), the number of reactions for which no negative resp. positive flux has been sampled. For all histograms, bin sizes of length 20 were chosen. We remark that zero flux is always possible. Therefore, the flux bounds directly relate to the possible flux range.

Similar articles

Cited by

References

    1. Lovász L. Hit-and-run mixes fast. Mathematical Programming. 1999;86(3):443–461.
    1. Dyer M, Frieze A, Kannan R. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM. 1991;38(1):1–17. 10.1145/102782.102783 - DOI
    1. Lovász L, Vempala S. Simulated annealing in convex bodies and an O*(n 4) volume algorithm. Journal of Computer and System Sciences. 2006;72(2):392–417. 10.1016/j.jcss.2005.08.004 - DOI
    1. Elekes G. A geometric inequality and the complexity of computing volume. Discrete and Computational Geometry. 1986;1(1):289–292. 10.1007/BF02187701 - DOI
    1. Bárány I, Füredi Z. Computing the volume is difficult. Discrete and Computational Geometry. 1987;2(1):319–326. 10.1007/BF02187886 - DOI

Publication types

LinkOut - more resources