On Simplices with a Given Barycenter That Are Enclosed by the Standard Simplex

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Austgen, Brent, Hasenbein, John J., Kutanoglu, Erhan
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910338722562048
author Austgen, Brent
Hasenbein, John J.
Kutanoglu, Erhan
author_facet Austgen, Brent
Hasenbein, John J.
Kutanoglu, Erhan
contents We present an optimization model defined on the manifold of the set of stochastic matrices. Geometrically, the model is akin to identifying a maximum-volume $n$-dimensional simplex that has a given barycenter and is enclosed by the $n$-dimensional standard simplex. Maximizing the volume of a simplex is equivalent to maximizing the determinant of its corresponding matrix. In our model, we employ trace maximization as a linear alternative to determinant maximization. We identify the analytical form of a solution to this model. We prove the solution is optimal and present necessary and sufficient conditions for it to be the unique optimal solution. Additionally, we show the identified optimal solution is an inverse $M$-matrix, and that its eigenvalues are the same as its diagonal entries. We demonstrate how the model and its solutions apply to the task of synthesizing conditional cumulative distribution functions (CDFs) that, in tandem with a given discrete marginal distribution, coherently preserve a given CDF.
format Preprint
id arxiv_https___arxiv_org_abs_2402_10591
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On Simplices with a Given Barycenter That Are Enclosed by the Standard Simplex
Austgen, Brent
Hasenbein, John J.
Kutanoglu, Erhan
Optimization and Control
Probability
We present an optimization model defined on the manifold of the set of stochastic matrices. Geometrically, the model is akin to identifying a maximum-volume $n$-dimensional simplex that has a given barycenter and is enclosed by the $n$-dimensional standard simplex. Maximizing the volume of a simplex is equivalent to maximizing the determinant of its corresponding matrix. In our model, we employ trace maximization as a linear alternative to determinant maximization. We identify the analytical form of a solution to this model. We prove the solution is optimal and present necessary and sufficient conditions for it to be the unique optimal solution. Additionally, we show the identified optimal solution is an inverse $M$-matrix, and that its eigenvalues are the same as its diagonal entries. We demonstrate how the model and its solutions apply to the task of synthesizing conditional cumulative distribution functions (CDFs) that, in tandem with a given discrete marginal distribution, coherently preserve a given CDF.
title On Simplices with a Given Barycenter That Are Enclosed by the Standard Simplex
topic Optimization and Control
Probability
url https://arxiv.org/abs/2402.10591