Hit and Run Sampling from Tropically Convex Sets
From MaRDI portal
Abstract: In this paper we propose Hit and Run (HAR) sampling from a tropically convex set. The key ingredient of HAR sampling from a tropically convex set is sampling uniformly from a tropical line segment over the tropical projective torus, which runs linearly in its computational time complexity. We show that this HAR sampling method samples uniformly from a tropical polytope which is the smallest tropical convex set of finitely many vertices. Finally, we apply this novel method to any given distribution using Metropolis-Hasting filtering over a tropical polytope.
Cites work
- A note on the metric properties of trees
- A practical volume algorithm
- Analysis of phylogenetics and evolution with R
- Approximating the volume of tropical polytopes is difficult
- Convergence properties of hit–and–run samplers
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Essentials of Tropical Combinatorics
- Fast MCMC sampling algorithms on polytopes
- Hit-and-Run from a Corner
- Hit-and-run mixes fast
- Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes
- On the Computation of Multidimensional Integrals by the Monte-Carlo Method
- polymake: a framework for analyzing convex polytopes
- The Bergman complex of a matroid and phylogenetic trees
- Tropical and ordinary convexity combined
- Tropical convexity
- Tropical Ehrhart theory and tropical volume
Cited in
(4)
This page was built for publication: Hit and Run Sampling from Tropically Convex Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5978962)