Exploring stochasticity and imprecise knowledge based on linear inequality constraints

DOI10.1007/S00285-015-0959-ZzbMATH Open1346.92079OpenAlexW2222645259WikidataQ46613316 ScholiaQ46613316MaRDI QIDQ314508FDOQ314508

Authors: Sam Subbey, Benjamin Planque, Ulf Lindström 

Publication date: 16 September 2016

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00285-015-0959-z

Recommendations

• scientific article; zbMATH DE number 7547119
• Expressing imprecision in probabilistic knowledge
• Structural properties of linear probabilistic constraints
• Probabilistic satisfiability with imprecise probabilities
• Confidence-based reasoning in stochastic constraint programming
• Extending uncertainty formalisms to linear constraints and other complex formalisms
• Toward a perception-based theory of probabilistic reasoning with imprecise probabilities
• Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
• Learning imprecise probability models: conceptual and practical challenges

zbMATH Keywords

polytopestochastichit-and-runfoodweblinear inequality

Mathematics Subject Classification ID

Ecology (92D40) Ordinary differential equations and systems with randomness (34F05)

Cites Work

• Numerical Optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monte Carlo methods in Bayesian computation
• Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.
• Hit-and-run mixes fast
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Testing inequality constraints in linear econometric models
• Title not available (Why is that?)
• A Laplace transform algorithm for the volume of a convex polytope
• On the Complexity of Computing the Volume of a Polyhedron
• Handbook of Monte Carlo Methods
• A Bayesian method for linear, inequality-constrained adjustment and its application to GPS positioning
• General hit-and-run Monte Carlo sampling for evaluating multidimensional integrals
• Direction choice for accelerated convergence in hit-and-run sampling
• Inference from simulations and monitoring convergence
• Volume Computation Using a Direct Monte Carlo Method
• Convergence properties of hit–and–run samplers
• Title not available (Why is that?)
• Hit-and-Run Algorithms for Generating Multivariate Distributions
• Title not available (Why is that?)
• Time varying VARs with inequality restrictions
• Inequality Restrictions in Regression Analysis
• Gaussian polytopes: variances and limit theorems

Cited In (1)

• Fitting stochastic predator-prey models using both population density and kill rate data

This page was built for publication: Exploring stochasticity and imprecise knowledge based on linear inequality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314508)