English
Related papers

Related papers: Almost sure convergence of the minimum bipartite m…

200 papers

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

Differential Geometry · Mathematics 2021-09-21 Qi Ding , J. Jost , Y. L. Xin

The localization spectra of Lyapunov vectors in many-particle systems at low density exhibit a characteristic bending behavior. It is shown that this behavior is due to a restriction on the maximum number of the most localized Lyapunov…

Chaotic Dynamics · Physics 2015-06-26 Tooru Taniguchi , Gary P. Morriss

We show that the bipartite perfect matching problem is in quasi-NC$^2$. That is, it has uniform circuits of quasi-polynomial size $n^{O(\log n)}$, and $O(log^2 n)$ depth. Previously, only an exponential upper bound was known on the size of…

Computational Complexity · Computer Science 2018-07-16 Stephen A. Fenner , Rohit Gurjar , Thomas Thierauf

The Maximum Mean Discrepancy (MMD) is a widely used multivariate distance metric for two-sample testing. The standard MMD test statistic has an intractable null distribution typically requiring costly resampling or permutation approaches…

Methodology · Statistics 2026-02-24 Anirban Chatterjee , Aaditya Ramdas

We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.

Combinatorics · Mathematics 2008-04-18 T. Tao , V. Vu

For any constant $d$ and parameter $\varepsilon > 0$, we show the existence of (roughly) $1/\varepsilon^d$ orderings on the unit cube $[0,1)^d$, such that any two points $p,q\in [0,1)^d$ that are close together under the Euclidean metric…

Computational Geometry · Computer Science 2020-04-16 Timothy M. Chan , Sariel Har-Peled , Mitchell Jones

A uniform tight frame of N vectors for a d dimensional space is correlation minimizing if among all such frames it is as "nearly" orthogonal as possible, i.e., it minimizes the maximal inner product of unequal vectors. In this paper we…

Functional Analysis · Mathematics 2015-03-31 Grant Getzelman , Nicole L. Leonhard , Vern I. Paulsen

For any $p\in[1,\infty)$, we prove that the set of simple functions taking at most $k$ different values is proximinal in B\"ochner spaces $L^p(X)$ whenever $X$ is a dual Banach space with $w^*$-sequentially compact unit ball. With…

Functional Analysis · Mathematics 2024-04-24 Guillaume Grelier , Jaime San Martín

For $V : \mathbb{R}^d \to \mathbb{R}$ coercive, we study the convergence rate for the $L^1$-distance of the empiric minimizer, which is the true minimum of the function $V$ sampled with noise with a finite number $n$ of samples, to the…

Statistics Theory · Mathematics 2023-03-09 Pierre Bras

Some asymptotic properties of a Brownian motion in multifractal time, also called multifractal random walk, are established. We show the almost sure and $L^1$ convergence of its structure function. This is an issue directly connected to the…

Probability · Mathematics 2009-05-22 Laurent Duvernet

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

Data Structures and Algorithms · Computer Science 2021-03-17 Farzam Ebrahimnejad , Ansh Nagda , Shayan Oveis Gharan

Suppose $d+1$ absolutely continuous probability measures $m_0, \ldots, m_d$ on $\mathbb{R}^d$ are given. In this paper, we prove that there exists a point of $\mathbb{R}^d$ that belongs to the convex hull of $d+1$ points $v_0, \ldots, v_d$…

Combinatorics · Mathematics 2020-06-03 Zilin Jiang

We discuss the optimal matching solution for both the assignment problem and the matching problem in one dimension for a large class of convex cost functions. We consider the problem in a compact set with the topology both of the interval…

Disordered Systems and Neural Networks · Physics 2017-10-11 Sergio Caracciolo , Matteo D'Achille , Gabriele Sicuro

The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…

Soft Condensed Matter · Physics 2009-11-13 Ali R. Mohazab , Steven S. Plotkin

Let $X$ be a normed space that satisfies the Johnson-Lindenstrauss lemma (J-L lemma, in short) in the sense that for any integer $n$ and any $x_1,\ldots,x_n\in X$ there exists a linear mapping $L:X\to F$, where $F\subseteq X$ is a linear…

Functional Analysis · Mathematics 2008-07-29 William B. Johnson , Assaf Naor

Suppose that there exists a discrete subset $X$ of a complete, connected, $n$-dimensional Riemannian manifold $M$ such that the Riemannian distances between points of $X$ correspond to the Euclidean distances of a net in $\mathbb{R}^{n}$.…

Metric Geometry · Mathematics 2025-06-04 Matan Eilat

Let $(\Omega,\mu)$ be a $\sigma$-finite measure space, and let $X\subset L^1(\Omega)+L^\infty(\Omega)$ be a fully symmetric space of measurable functions on $(\Omega,\mu)$. If $\mu(\Omega)=\infty$, necessary and sufficient conditions are…

Functional Analysis · Mathematics 2018-02-21 Vladimir Chilin , Semyon Litvinov

In the setting of a metric space equipped with a doubling measure that supports a Poincar\'e inequality, we show that any set of finite perimeter can be approximated in the BV norm by a set whose topological and measure theoretic boundaries…

Metric Geometry · Mathematics 2016-11-21 Panu Lahti

We consider the well-studied problem of finding a perfect matching in $d$-regular bipartite graphs with $2n$ vertices and $m = nd$ edges. While the best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes $O(m…

Data Structures and Algorithms · Computer Science 2009-07-30 Ashish Goel , Michael Kapralov , Sanjeev Khanna

Consider a branching Brownian motion (BBM). It is well known \cite{Bramson1983ConvergenceOS, Lalley1987ACL} that the rightmost particle is located near \( m_t = \sqrt{2} t - \frac{3}{2\sqrt{2}} \log t \). Let $\mathcal{N}(t,x)$ be the set…

Probability · Mathematics 2026-03-24 Gabriel Flath
‹ Prev 1 8 9 10 Next ›