Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Geometry of Gaussoids
95
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, just like matroids encode independence in linear algebra. The gaussoid axioms of Lnenicka and Matus are equivalent to compatibility with certain quadratic relations among principal and almost-principal minors of a symmetric matrix. We develop the geometric theory of gaussoids, based on the Lagrangian Grassmannian and its symmetries. We introduce oriented gaussoids and valuated gaussoids, thus connecting to real and tropical geometry. We classify small realizable and non-realizable gaussoids. Positive gaussoids are as nice as positroids: they are all realizable via graphical models.
rate research
Read More
The number of $n$-gaussoids is shown to be a double exponential function in $n$. The necessary bounds are achieved by studying construction methods for gaussoids that rely on prescribing $3$-minors and encoding the resulting combinatorial constraints in a suitable transitive graph. Various special classes of gaussoids arise from restricting the allowed $3$-minors.
We relate finite generation of cones, monoids, and ideals in increasing chains (the local situation) to equivariant finite generation of the corresponding limit objects (the global situation). For cones and monoids there is no analogue of Noetherianity as in the case of ideals and we demonstrate this in examples. As a remedy we find local-global correspondences for finite generation. These results are derived from a more general framework that relates finite generation under closure operations to equivariant finite generation under general families of maps. We also give a new proof that non-saturated Inc-invariant chains stabilize, closing a gap in the literature.
The use of mathematical models in the sciences often involves the estimation of unknown parameter values from data. Sloppiness provides information about the uncertainty of this task. In this paper, we develop a precise mathematical foundation for sloppiness and define rigorously its key concepts, such as `model manifold, in relation to concepts of structural identifiability. We redefine sloppiness conceptually as a comparison between the premetric on parameter space induced by measurement noise and a reference metric. This opens up the possibility of alternative quantification of sloppiness, beyond the standard use of the Fisher Information Matrix, which assumes that parameter space is equipped with the usual Euclidean metric and the measurement error is infinitesimal. Applications include parametric statistical models, explicit time dependent models, and ordinary differential equation models.
In this paper we give a geometric characterization of the cones of toric varieties that are complete intersections. In particular, we prove that the class of complete intersection cones is the smallest class of cones which is closed under direct sum and contains all simplex cones. Further, we show that the number of the extreme rays of such a cone, which is less than or equal to $2n-2$, is exactly $2n-2$ if and only if the cone is a bipyramidal cone, where $n>1$ is the dimension of the cone. Finally, we characterize all toric varieties whose associated cones are complete intersection cones.
We graph-theoretically characterize the class of graphs $G$ such that $I(G)^2$ are Buchsbaum.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
