English
Related papers

Related papers: The Pareto Record Frontier

200 papers

Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…

Probability · Mathematics 2025-03-05 Víctor J. Maciá

We study model selection in linear bandits, where the learner must adapt to the dimension (denoted by $d_\star$) of the smallest hypothesis class containing the true linear model while balancing exploration and exploitation. Previous papers…

Machine Learning · Statistics 2022-03-17 Yinglun Zhu , Robert Nowak

Fault-tolerant spanners are fundamental objects that preserve distances in graphs even under edge failures. A long line of work culminating in Bodwin, Dinitz, Robelle (SODA 2022) gives $(2k-1)$-stretch, $f$-fault-tolerant spanners with…

Data Structures and Algorithms · Computer Science 2026-03-26 Sanjeev Khanna , Christian Konrad , Aaron Putterman

We present a new method for estimating the frontier of a sample. The estimator is based on a local polynomial regression on the power-transformed data. We assume that the exponent of the transformation goes to infinity while the bandwidth…

Methodology · Statistics 2011-04-04 Stéphane Girard , Pierre Jacob

Let $E$ be a finite set, $\{F^i\}_{i \in E}$ a family of vector fields on $\mathbb{R}^d$ leaving positively invariant a compact set $M$ and having a common zero $p \in M.$ We consider a piecewise deterministic Markov process $(X,I)$ on $M…

Probability · Mathematics 2018-07-03 Michel Benaïm , Edouard Strickler

Let $\mathbb{T}^d$ denote the $d$-dimensional torus. We consider the problem of optimally recovering a target function $f^*:\mathbb{T}^d\rightarrow \mathbb{C}$ from samples of its Fourier coefficients. We make classical smoothness…

Functional Analysis · Mathematics 2025-09-01 Jonathan W. Siegel

This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…

Information Theory · Computer Science 2015-10-27 Igal Sason

Consider a degree-$d$ polynomial $f(\xi_1,\dots,\xi_n)$ of independent Rademacher random variables $\xi_1,\dots,\xi_n$. To what extent can $f(\xi_1,\dots,\xi_n)$ concentrate on a single point? This is the so-called polynomial…

Combinatorics · Mathematics 2025-05-30 Zhihan Jin , Matthew Kwan , Lisa Sauermann , Yiting Wang

The proportion of $d$-element subsets of $\mathbb{F}_2^d$ that are bases is asymptotic to $\prod_{j=1}^{\infty}(1-2^{-j}) \approx 0.29$ as $d \to \infty$. It is natural to ask whether there exists a (large) subset $\mathcal{F}$ of…

Combinatorics · Mathematics 2025-03-03 David Ellis , Maria-Romina Ivan , Imre Leader

The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…

Information Theory · Computer Science 2025-11-13 Andreas Theocharous , Lampros Gavalakis , Ioannis Kontoyiannis

We establish sharp asymptotic bounds for the critical intensity of the Finitary Random Interlacements (FRI) model in four and higher dimensions with general trajectory length distributions. Our proof reveals that the construction of…

Probability · Mathematics 2025-10-17 Yijie Bi , Zhenhao Cai , Xinyi Li , Balázs Ráth , Yuan Zhang

The main contribution of this paper is a mathematical definition of statistical sparsity, which is expressed as a limiting property of a sequence of probability distributions. The limit is characterized by an exceedance measure~$H$ and a…

Methodology · Statistics 2018-05-24 Peter McCullagh , Nicholas Polson

We study how a countable algebraic root set passes to a fractal connectedness locus. Let $D_n=\{-n+1,-n+2,\ldots,n-1\}$, and let $R_n$ be the set of roots of monic polynomials whose non-leading coefficients lie in $D_n$. We study…

Dynamical Systems · Mathematics 2026-03-10 Bernat Espigule , David Juher

Let L_n denote the lowest crossing of a square 2n\times2n box for critical site percolation on the triangular lattice imbedded in Z^2. Denote also by F_n the pioneering sites extending below this crossing, and Q_n the pivotal sites on this…

Probability · Mathematics 2007-05-23 G. J. Morrow , Y. Zhang

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

Combinatorics · Mathematics 2025-02-21 Yaobin Chen , Xizhi Liu , Jiaxi Nie , Ji Zeng

Regularly varying stochastic processes model extreme dependence between process values at different locations and/or time points. For such processes we propose a two-step parameter estimation of the extremogram, when some part of the domain…

Statistics Theory · Mathematics 2018-08-28 Sven Buhl , Claudia Klüppelberg

We present an analysis of the approximation error for a $d$-dimensional quasiperiodic function $f$ with Diophantine frequencies, approximated by a periodic function with the fundamental domain $[0,L_1)\times [0,L_2)\times \cdots…

Number Theory · Mathematics 2024-11-12 Kai Jiang , Shifeng Li , Pingwen Zhang

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

Computational Complexity · Computer Science 2017-12-14 Anastasios Sidiropoulos , Kritika Singhal , Vijay Sridhar

Consider the problem of drawing random variates $(X_1,\ldots,X_n)$ from a distribution where the marginal of each $X_i$ is specified, as well as the correlation between every pair $X_i$ and $X_j$. For given marginals, the…

Probability · Mathematics 2016-12-30 Mark Huber , Nevena Maric

We impose the uniform probability measure on the set of all discrete Gelfand-Tsetlin patterns of depth $n$ with the particles on row $n$ in deterministic positions. These systems equivalently describe a broad class of random tilings models,…

Probability · Mathematics 2018-07-03 Erik Duse , Anthony Metcalfe
‹ Prev 1 3 4 5 6 7 10 Next ›