English
Related papers

Related papers: Coherent distributions on the square $\unicode{x20…

200 papers

In this paper, we determine the sharp threshold for universality of cokernels of random matrices over finite fields. More precisely, we prove the following: given any constant $c>1$, let $A(n)$ be a random $n \times n$ matrix over…

Probability · Mathematics 2025-11-18 Jungin Lee

We define the strong shortcut property for rough geodesic metric spaces, generalizing the notion of strongly shortcut graphs. We show that the strong shortcut property is a rough similarity invariant. We give several new characterizations…

Group Theory · Mathematics 2024-10-23 Nima Hoda

In this work we prove an universality result regarding the equidistribution of zeros of random holomorphic sections associated to a sequence of singular Hermitian holomorphic line bundles on a compact K\"ahler complex space $X$. Namely,…

Complex Variables · Mathematics 2020-04-15 Turgay Bayraktar , Dan Coman , George Marinescu

We study the relative entropy between the empirical estimate of a discrete distribution and the true underlying distribution. If the minimum value of the probability mass function exceeds an $\alpha > 0$ (i.e. when the true underlying…

Statistics Theory · Mathematics 2021-09-21 Alankrita Bhatt , Ankit Pensia

We consider the inhomogeneous Landau equation with $\gamma \in (\sqrt{3},2]$ and construct smooth, strictly positive initial data that develop a finite time singularity. The $C^{\alpha}$-norm of the distribution function blows up for every…

Analysis of PDEs · Mathematics 2026-02-06 Jacob Bedrossian , Jiajie Chen , Maria Pia Gualdani , Sehyun Ji , Vlad Vicol , Jincheng Yang

In this paper we study some basic properties of strong {\lambda}- statistical convergence of sequences in probabilistic metric (PM) spaces. We also introduce and study the notion of strong {\lambda}-statistically Cauchyness. Further…

Functional Analysis · Mathematics 2020-07-21 Prasanta Malik , Samiran Das

Uniformity testing is one of the most well-studied problems in property testing, with many known test statistics, including ones based on counting collisions, singletons, and the empirical TV distance. It is known that the optimal sample…

Machine Learning · Statistics 2022-06-23 Shivam Gupta , Eric Price

We determine the distribution of the sandpile group (a.k.a. Jacobian) of the Erd\H{o}s-R\'enyi random graph G(n,q) as n goes to infinity. Since any particular group appears with asymptotic probability 0 (as we show), it is natural ask for…

Probability · Mathematics 2014-06-03 Melanie Matchett Wood

Inter-relations between random matrix ensembles with different symmetry types provide inter-relations between generating functions for the gap probabilites at the spectrum edge. Combining these in the scaled limit with the exact evaluation…

Mathematical Physics · Physics 2007-05-23 P. J. Forrester

We obtain structural theorems for the so-called S-asymptotic and quasiasymptotic boundedness of ultradistributions. Using these results, we then analyze the moment asymptotic expansion (MAE), providing a full characterization of those…

Functional Analysis · Mathematics 2021-08-19 Lenny Neyt , Jasson Vindas

Most asymptotic results for robust estimates rely on regularity conditions that are difficult to verify in practice. Moreover, these results apply to fixed distribution functions. In the robustness context the distribution of the data…

Statistics Theory · Mathematics 2007-06-13 Matias Salibian-Barrera , Ruben H. Zamar

Let $\{X(t) : t \in [0, \infty) \}$ be a centered stationary Gaussian process. We study the exact asymptotics of $\pr (\sup_{s \in [0,T]} X(t) > u)$, as $u \to \infty$, where $T$ is an independent of \{X(t)\} nonnegative random variable. It…

Probability · Mathematics 2010-11-30 Marek Arendarczyk , Krzysztof Debicki

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…

Probability · Mathematics 2016-07-21 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

Let $X_{nr}$ be the $r$th largest of a random sample of size $n$ from a distribution $F (x) = 1 - \sum_{i = 0}^\infty c_i x^{-\alpha - i \beta}$ for $\alpha > 0$ and $\beta > 0$. An inversion theorem is proved and used to derive an…

Methodology · Statistics 2009-03-26 Saralees Nadarajah , Christopher S. Withers

Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be mutually independent centered Gaussian processes with almost surely continuous sample paths. We derive the exact asymptotics of $$ P\left(\exists_{t \in [0,T]} \forall_{i=1 ... n} X_i(t)> u \right) $$…

Probability · Mathematics 2015-05-26 Krzysztof Dȩbicki , Enkelejd Hashorva , Lanpeng Ji , Kamil Tabiś

We consider a family of periodic tight-binding models (combinatorial graphs) that have the minimal number of links between copies of the fundamental domain. For this family we establish a local condition of second derivative type under…

Mathematical Physics · Physics 2022-10-19 Gregory Berkolaiko , Yaiza Canzani , Graham Cox , Jeremy L. Marzuola

We consider a smooth two-parameter family $f_{a,L}\colon\theta\mapsto \theta+a+L\Phi(\theta)$ of circle maps with a finite number of critical points. For sufficiently large $L$ we construct a set $A_L^{(\infty)}$ of $a$-values of positive…

Dynamical Systems · Mathematics 2009-08-05 Hiroki Takahasi

We study the asymptotic behavior of piecewise constant least squares regression estimates, when the number of partitions of the estimate is penalized. We show that the estimator is consistent in the relevant metric if the signal is in…

Statistics Theory · Mathematics 2009-09-29 Leif Boysen , Volkmar Liebscher , Axel Munk , Olaf Wittich

In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.

Discrete Mathematics · Computer Science 2008-07-23 J. Diaz , D. Mitsche , X. Perez

We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in \{0,1\}^n$ to a CNF formula $\varphi$ is shared between two parties, where Alice knows $x_1, \dots, x_{n/2}$, Bob knows…

Computational Complexity · Computer Science 2017-11-02 Amir Abboud , Aviad Rubinstein , Ryan Williams
‹ Prev 1 4 5 6 7 8 10 Next ›