English
Related papers

Related papers: Quantifying minimal non-collinearity among random …

200 papers

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

Metric Geometry · Mathematics 2014-10-15 Károly J. Böröczky , Ferenc Fodor , Daniel Hug

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

We propose a kernel-based nonparametric test of relative goodness of fit, where the goal is to compare two models, both of which may have unobserved latent variables, such that the marginal distribution of the observed variables is…

Machine Learning · Statistics 2023-05-10 Heishiro Kanagawa , Wittawat Jitkrittum , Lester Mackey , Kenji Fukumizu , Arthur Gretton

In this work we study subdivisions of $k$-rotationally symmetric planar convex bodies that minimize the maximum relative diameter functional. For some particular subdivisions called $k$-partitions, consisting of $k$ curves meeting in an…

Metric Geometry · Mathematics 2015-01-19 Antonio Cañete , Uwe Schnell , Salvador Segura Gomis

Invariant ensemble, which are characterised by the joint distribution of eigenvalues $P(\lambda_1,\ldots,\lambda_N)$, play a central role in random matrix theory. We consider the truncated linear statistics $L_K = \sum_{n=1}^K f(\lambda_n)$…

Statistical Mechanics · Physics 2022-03-09 Aurélien Grabsch

Let $K$ be a convex body in $\mathbb{R}^{n}$. Let $ d_{n,n-1}(K)$ be the smallest possible density of a non-separable lattice of translates of $K$. In this paper we prove the estimate $d_{2,1}(K)\leq \frac{\pi\sqrt{3}}{8}$ for $K\subset…

Metric Geometry · Mathematics 2022-08-03 Arkadiy Aliev

Let $K$ be a convex body in $\R^d$, let $j\in\{1, ..., d-1\}$, and let $\varrho$ be a positive and continuous probability density function with respect to the $(d-1)$-dimensional Hausdorff measure on the boundary $\partial K$ of $K$. Denote…

Metric Geometry · Mathematics 2014-10-07 Károly J. Böröczky , Ferenc Fodor , Daniel Hug

We derive precise asymptotic estimates for the number of labelled graphs not containing $K_{3,3}$ as a minor, and also for those which are edge maximal. Additionally, we establish limit laws for parameters in random $K_{3,3}$-minor-free…

Combinatorics · Mathematics 2008-04-01 S. Gerke , O. Gimenez , M. Noy , A. Weissl

Let $\lambda$ be a partition of the positive integer $n$, selected uniformly at random among all such partitions. Corteel et al. (1999) proposed three different procedures of sampling parts of $\lambda$ at random. They obtained limiting…

Probability · Mathematics 2014-07-15 Ljuben Mutafchiev

From among $ {n \choose 3}$ triangles with vertices chosen from $n$ points in the unit square, let $T$ be the one with the smallest area, and let $A$ be the area of $T$. Heilbronn's triangle problem asks for the maximum value assumed by $A$…

Combinatorics · Mathematics 2007-05-23 Tao Jiang , Ming Li , Paul Vitanyi

We establish central and local limit theorems for the number of vertices in the largest component of a random $d$-uniform hypergraph $\hnp$ with edge probability $p=c/\binnd$, where $(d-1)^{-1}+\eps<c<\infty$. The proof relies on a new,…

Combinatorics · Mathematics 2017-11-17 Michael Behrisch , Amin Coja-Oghlan , Mihyun Kang

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

Probability · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n-dimensional lattice as n tends to infinity. Moreover we interpret the result in terms of eigenvalues and eigenfunctions…

Number Theory · Mathematics 2014-02-26 Anders Södergren

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

Combinatorics · Mathematics 2011-01-28 Chris Dowden

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

Metric Geometry · Mathematics 2015-12-09 Ferenc Fodor , Daniel Hug , Ines Ziebarth

We study random k-lifts of large, but otherwise arbitrary graphs G. We prove that, with high probability, all eigenvalues of the adjacency matrix of the lift that are not eigenvalues of G are of the order (D ln (kn))^{1/2}, where D is the…

Combinatorics · Mathematics 2011-09-07 Roberto Imbuzeiro Oliveira

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Probability · Mathematics 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $\mathcal{P}_N(K,\lambda)$ that a large $N \times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a…

Statistical Mechanics · Physics 2015-11-04 Fernando L. Metz , Daniel A. Stariolo

We prove upper and lower bounds on the minimal spherical dispersion, improving upon previous estimates obtained by Rote and Tichy [Spherical dispersion with an application to polygonal approximation of curves, Anz. \"Osterreich. Akad. Wiss.…

Metric Geometry · Mathematics 2022-01-20 Joscha Prochno , Daniel Rudolf

We consider the complete graph $\cK_n$ on $n$ vertices with exponential mean $n$ edge lengths. Writing $C_{ij}$ for the weight of the smallest-weight path between vertex $i,j\in [n]$, Janson showed that $\max_{i,j\in [n]} C_{ij}/\log{n}$…

Probability · Mathematics 2013-06-04 Shankar Bhamidi , Remco van der Hofstad