2000 character limit reached
Minimal Unimodal Decompositions on Trees
Published 25 Jun 2018 in math.AT, math.ST, and stat.TH | (1806.09673v1)
Abstract: The decomposition of a density function on a domain into a minimal sum of unimodal components is a fundamental problem in statistics, leading to the topological invariant of unimodal category of a density. This paper gives an efficient algorithm for the construction of a minimal unimodal decomposition of a tame density function on a finite metric tree.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.