English
Related papers

Related papers: Approximate Gaussian isoperimetry for k sets

200 papers

We give necessary and sufficient conditions on a smooth local map of a Riemannian manifold $M^m$ into the sphere $S^m$ to be the Gauss map of an isometric immersion $u:M^m \to R^n$, $n=m+1$. We briefly discuss the case of general $n$ as…

Differential Geometry · Mathematics 2013-01-22 J. Eschenburg , B. S. Kruglikov , V. S. Matveev , R. Tribuzy

We present an alternative approach to some results of Koldobsky on measures of sections of symmetric convex bodies, which allows us to extend them to the not necessarily symmetric setting. We prove that if $K$ is a convex body in ${\mathbb…

Metric Geometry · Mathematics 2015-12-31 Giorgos Chasapis , Apostolos Giannopoulos , Dimitris-Marios Liakopoulos

In this manuscript we introduce and study an extended version of the minimal dispersion of point sets, which has recently attracted considerable attention. Given a set $\mathscr P_n=\{x_1,\dots,x_n\}\subset [0,1]^d$ and…

Numerical Analysis · Mathematics 2019-08-15 Aicke Hinrichs , Joscha Prochno , Mario Ullrich , Jan Vybiral

This paper proposes a novel method for testing observability in Gaussian models using discrete density approximations (deterministic samples) of (multivariate) Gaussians. Our notion of observability is defined by the existence of the…

Systems and Control · Electrical Eng. & Systems 2022-08-19 Ariane Hanebeck , Claudia Czado

We study the problem of determining the least symmetric triangle, which arises both from pure geometry and from the study of molecular chirality in chemistry. Using the correspondence between planar $n$-gons and points in the Grassmannian…

Metric Geometry · Mathematics 2019-09-23 Laney Bowden , Andrea Haynes , Clayton Shonkwiler , Aaron Shukert

The present article derives the minimal number $N$ of observations needed to consider a Bayesian posterior distribution as Gaussian. Two examples are presented. Within one of them, a chi-squared distribution, the observable $x$ as well as…

Statistics Theory · Mathematics 2020-12-03 Christoph Fuhrmann , Hanns Ludwig Harney , Klaus Harney , Andreas Müller

Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…

Geometric Topology · Mathematics 2014-10-01 Max Neumann-Coto

Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1…

Metric Geometry · Mathematics 2008-02-03 János Pach , Joel Spencer

There are two definitions of the measurable functional on the topological vector space: as a linear and measurable real-valued function and as a pointwise limit of the sequence of the continious linear functionals. In general case they are…

Functional Analysis · Mathematics 2016-02-23 Denis Fufaev

In this article we introduce a definition of topological minimal sets, which is a generalization of that of Mumford-Shah-minimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an…

Classical Analysis and ODEs · Mathematics 2011-03-22 Xiangyu Liang

In this paper we study algorithms to find a Gaussian approximation to a target measure defined on a Hilbert space of functions; the target measure itself is defined via its density with respect to a reference Gaussian measure. We employ the…

Numerical Analysis · Mathematics 2014-08-11 Frank J. Pinski , Gideon Simpson , Andrew M. Stuart , Hendrik Weber

The $k$-cut problem asks, given a connected graph $G$ and a positive integer $k$, to find a minimum-weight set of edges whose removal splits $G$ into $k$ connected components. We give the first polynomial-time algorithm with approximation…

Data Structures and Algorithms · Computer Science 2018-11-12 MohammadHossein Bateni , Alireza Farhadi , MohammadTaghi Hajiaghayi

Let $X$ be a $d$-dimensional random vector and $X_\theta$ its projection onto the span of a set of orthonormal vectors $\{\theta_1,...,\theta_k\}$. Conditions on the distribution of $X$ are given such that if $\theta$ is chosen according to…

Probability · Mathematics 2011-02-16 Elizabeth Meckes

For every $k \in \mathbb{N}$ let $f_k:[\frac{1}{k+1}, \frac{1}{k}] \to [0,1]$ be decreasing, linear functions such that $f_k(\frac{1}{k+1}) = 1$ and $f_k(\frac{1}{k}) = 0$, $k = 1, 2, \dots$. We define iterated function system (IFS) $S_n$…

Dynamical Systems · Mathematics 2024-04-19 Rafał Tryniecki

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

Probability · Mathematics 2011-11-10 Omer Angel , Alexander E. Holroyd , Dan Romik , Balint Virag

In this paper we study critial isometric and minimal isometric embeddings of classes of Riemannian metrics which we call {\it quasi-$k$-curved metrics}. Quasi-$k$-curved metrics generalize the metrics of space forms. We construct explicit…

dg-ga · Mathematics 2008-02-03 Thomas Ivey , J. M. Landsberg

A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…

Numerical Analysis · Mathematics 2021-04-27 Aleš Vavpetič , Emil Žagar

We study the evolutions of selected quasi-(1+1) dimensional wavepacket solutions to the Klein-Gordon equation for a relativistic charged particle in uniform motion or accelerated by a uniform electric field in Minkowski space. We explore…

Quantum Physics · Physics 2024-02-02 Yu-Che Huang , Fong-Ming He , Shih-Yuin Lin

We study the complexity of learning $k$-mixtures of Gaussians ($k$-GMMs) on $\mathbb{R}^d$. This task is known to have complexity $d^{\Omega(k)}$ in full generality. To circumvent this exponential lower bound on the number of components,…

Machine Learning · Computer Science 2025-04-22 Ilias Diakonikolas , Daniel M. Kane , Sushrut Karmalkar , Jasper C. H. Lee , Thanasis Pittas

We prove several results of the following type: any $d$ measures in $\mathbb R^d$ can be partitioned simultaneously into $k$ equal parts by a convex partition (this particular result is proved independently by Pablo Sober\'on). Another…

Metric Geometry · Mathematics 2013-06-17 R. N. Karasev