English
Related papers

Related papers: Scaling universalities of kth-nearest neighbor dis…

200 papers

The $k$-nearest neighbour ($k$-NN) classifier is one of the oldest and most important supervised learning algorithms for classifying datasets. Traditionally the Euclidean norm is used as the distance for the $k$-NN classifier. In this…

Machine Learning · Statistics 2015-12-02 Stan Hatko

Starting from an arbitrary sequence of polygons whose total perimeter is $2n$, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the…

Probability · Mathematics 2019-02-05 Thomas Budzinski , Nicolas Curien , Bram Petri

We construct Kn\"orrer type equivalences outside of the hypersurface case, namely, between singularity categories of cyclic quotient surface singularities and certain finite dimensional local algebras. This generalises Kn\"orrer's…

Algebraic Geometry · Mathematics 2017-07-11 Martin Kalck , Joseph Karmazyn

In this paper we construct uniformly expanding random walks on smooth manifolds. In higher dimensions, our definition of uniform expansion measures the growth of subspaces rather than single vectors. Potrie showed that given any open set…

Dynamical Systems · Mathematics 2022-11-22 Rosemary Elliott Smith

Let $p_n$ denote the number of self-avoiding polygons of length $n$ on a regular three-dimensional lattice, and let $p_n(K)$ be the number which have knot type $K$. The probability that a random polygon of length $n$ has knot type $K$ is…

Statistical Mechanics · Physics 2015-05-27 E. J. Janse van Rensburg , A. Rechnitzer

Let A_N be an N-point distribution in the unit square in the Euclidean plane. We consider the Discrepancy function D_N(x) in two dimensions with respect to rectangles with lower left corner anchored at the origin and upper right corner at…

Number Theory · Mathematics 2013-10-14 Dmitriy Bilyk , Michael T. Lacey , Ioannis Parissis , Armen Vagharshakyan

We define the quantile set of order $\alpha \in \left[ 1/2,1\right) $ associated to a law $P$ on $\mathbb{R}^{d}$ to be the collection of its directional quantiles seen from an observer $O\in \mathbb{R}^{d}$. Under minimal assumptions these…

Statistics Theory · Mathematics 2016-12-06 Adil Ahidar-Coutrix , Philippe Berthet

In this paper we consider uniformly random lozenge tilings of arbitrary domains approximating (after suitable normalization) a closed, simply-connected subset of $\mathbb{R}^2$ with piecewise smooth, simple boundary. We show that the local…

Probability · Mathematics 2023-10-02 Amol Aggarwal

This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability…

Information Theory · Computer Science 2013-06-27 Zubair Khalid , Salman Durrani

We study here a standard next-nearest-neighbor (NNN) model of ballistic growth on one- and two-dimensional substrates focusing our analysis on the probability distribution function $P(M,L)$ of the number $M$ of maximal points (i.e., local…

Statistical Mechanics · Physics 2007-05-23 F. Hivert , S. Nechaev , G. Oshanin , O. Vasilyev

In this paper, we extend our previous work on the study of local scales of a function to studying local scales on curves and surfaces. In the case of a function f, the local scales of f at x is computed by measuring the deviation of f from…

Functional Analysis · Mathematics 2016-07-22 Triet Minh Le

We study universal aspects of polymer conformations and transverse fluctuations for a single swollen chain characterized by a contour length $L$ and a persistence length $\ell_p$ in two dimensions (2D) and in three dimensions (3D) in the…

Soft Condensed Matter · Physics 2023-06-07 Jacob Bair , Swarnadeep Seth , Aniket Bhattacharya

We provide a comprehensive report on scale-invariant fluctuations of growing interfaces in liquid-crystal turbulence, for which we recently found evidence that they belong to the Kardar-Parisi-Zhang (KPZ) universality class for 1+1…

Statistical Mechanics · Physics 2012-06-25 Kazumasa A. Takeuchi , Masaki Sano

Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…

Computational Geometry · Computer Science 2023-08-21 Ahmed Abdelkader , David M. Mount

We prove a Kuranishi-type theorem for deformations of complex structures on ALE K\"ahler surfaces. This is used to prove that for any scalar-flat K\"ahler ALE surface, all small deformations of complex structure also admit scalar-flat…

Differential Geometry · Mathematics 2018-09-18 Jiyuan Han , Jeff A. Viaclovsky

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

Computational Geometry · Computer Science 2020-03-10 Man-Kwun Chiu , Stefan Felsner , Manfred Scheucher , Patrick Schnider , Raphael Steiner , Pavel Valtr

Assume that $\mathfrak A$ is a real Banach space of finite dimension $n\geq2$. Consider any Borel probability measure $\nu$ supported on the unit ball $K$ of $\mathfrak A$. We show that \[\Delta(\nu)=\int_{x \in K}\int_{ y\in…

Functional Analysis · Mathematics 2024-11-22 Gyula Lakos

For non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) = n$, we sample a bipartite planar map with $n$ faces uniformly at random amongst those which have $d_n(k)$ faces of degree $2k$ for every $k \ge 1$ and we…

Probability · Mathematics 2020-07-20 Cyril Marzouk

A probability distribution over {-1, 1}^n is (eps, k)-wise uniform if, roughly, it is eps-close to the uniform distribution when restricted to any k coordinates. We consider the problem of how far an (eps, k)-wise uniform distribution can…

Data Structures and Algorithms · Computer Science 2018-06-12 Ryan O'Donnell , Yu Zhao

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson