English
Related papers

Related papers: Approximate Gaussian isoperimetry for k sets

200 papers

We address the problem of curvature estimation from sampled compact sets. The main contribution is a stability result: we show that the gaussian, mean or anisotropic curvature measures of the offset of a compact set K with positive…

Computational Geometry · Computer Science 2008-12-09 Frédéric Chazal , David Cohen-Steiner , André Lieutier , Boris Thibert

We present a variation of quasi-isometry to approach the problem of defining a geometric notion equivalent to commensurability. In short, this variation can be summarized as "quasi-isometry with uniform parameters for a large enough family…

Group Theory · Mathematics 2010-06-01 Andreas Lochmann

The form factor of the unitary group U(N) endowed with the Haar measure characterizes the correlations within the spectrum of a typical unitary matrix. It can be decomposed into a sum over pairs of ``periodic orbits'', where by periodic…

Chaotic Dynamics · Physics 2007-05-23 G. Berkolaiko

There is a result of Diaconis and Freedman which says that, in a limiting sense, for large collections of high-dimensional data most one-dimensional projections of the data are approximately Gaussian. This paper gives quantitative versions…

Probability · Mathematics 2010-05-18 Elizabeth Meckes

Llarull's Theorem states that any Riemannian metric on the $n$-sphere which has scalar curv{\-}ature greater than or equal to $n(n-1)$, and whose distance function is bounded below by the unit sphere's, is isometric to the unit sphere.…

Differential Geometry · Mathematics 2023-11-27 Brian Allen , Edward Bryden , Demetre Kazaras

In the sub-Riemannian Heisenberg group equipped with its Carnot-Caratheodory metric and with a Haar measure, we consider isodiametric sets, i.e. sets maximizing the measure among all sets with a given diameter. In particular, given an…

Metric Geometry · Mathematics 2010-10-07 Gian Paolo Leonardi , Severine Rigot , Davide Vittone

Given a graph $G$, the sparsest-cut problem asks to find the set of vertices $S$ which has the least expansion defined as $$\phi_G(S) := \frac{w(E(S,\bar{S}))}{\min \set{w(S), w(\bar{S})}}, $$ where $w$ is the total edge weight of a subset.…

Data Structures and Algorithms · Computer Science 2013-10-09 Anand Louis , Konstantin Makarychev

Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…

Combinatorics · Mathematics 2013-09-27 Mikhail Kharitonov

In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…

Metric Geometry · Mathematics 2021-06-10 Felipe Negreira , Emiliano Sequeira

We generalize the measurement using an expanded concept of cover, in order to provide a new approach to size of set other than cardinality. The generalized measurement has application backgrounds such as a generalized problem in dimension…

General Mathematics · Mathematics 2012-11-13 Hua-Rong Peng , Da-Hai Li , Qiong-Hua Wang

Given a determinate (multivariate) probability measure $\mu$, we characterize Gaussian mixtures $\nu\_\phi$ which minimize the Wasserstein distance $W\_2(\mu,\nu\_\phi)$ to $\mu$ when the mixing probability measure $\phi$ on the parameters…

Optimization and Control · Mathematics 2024-05-01 Jean-Bernard Lasserre

This note presents families of inequalities for the Gaussian measure of convex sets which extend the recently proven Gaussian correlation inequality in various directions.

Probability · Mathematics 2017-10-10 Michael R. Tehranchi

A subset U of a group G is called k-universal if U contains a translate of every k-element subset of G. We give several nearly optimal constructions of small k-universal sets, and use them to resolve an old question of Erdos and Newman on…

Combinatorics · Mathematics 2008-04-06 Noga Alon , Boris Bukh , Benny Sudakov

The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…

Combinatorics · Mathematics 2011-11-28 Robert F. Bailey , Karen Meagher

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

Algebraic Geometry · Mathematics 2024-10-15 Claus Scheiderer

We consider the problem of finding, for a given quadratic measure of non-uniformity of a set of $N$ points (such as $L_2$ star-discrepancy or diaphony), the asymptotic distribution of this discrepancy for truly random points in the limit…

Computational Physics · Physics 2009-10-30 Andre van Hameren , Ronald Kleiss , Jiri Hoogland

The author has already proven that the space $\Delta(\Pi_n)/G$ is homotopy equivalent to a wedge of spheres of dimension $n-3$ for all natural numbers $n\geq 3$ and all subgroups $G\subset S_1\times S_{n-1}$. We construct an $S_1\times…

Algebraic Topology · Mathematics 2020-09-29 Ralf Donau

We study the lower bound for Koldobsky's slicing inequality. We show that there exists a measure $\mu$ and a symmetric convex body $K \subseteq \mathbb{R}^n$, such that for all $\xi\in S^{n-1}$ and all $t\in \mathbb{R},$…

Metric Geometry · Mathematics 2023-07-19 Bo'az Klartag , Galyna V. Livshyts

We present in detail Thomas Royen's proof of the Gaussian correlation inequality which states that $\mu(K\cap L)\geq \mu(K)\mu(L)$ for any centered Gaussian measure $\mu$ on $R^d$ and symmetric convex sets $K,L$ in $R^d$.

Probability · Mathematics 2017-05-17 Rafał Latała , Dariusz Matlak

We characterize geodesic paths in the $n$-dimensional unit sphere under sup norm. A geodesic path between two points is a shortest curve joining the two points.

Metric Geometry · Mathematics 2013-08-28 Teck-Cheong Lim