English
Related papers

Related papers: Fractional Vs. Expectation Thresholds: Random Supp…

200 papers

The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…

Number Theory · Mathematics 2020-07-16 Nikos Frantzikinakis

We show that the imperceptibility of several existing linguistic steganographic systems (Fang et al., 2017; Yang et al., 2018) relies on implicit assumptions on statistical behaviors of fluent text. We formally analyze them and empirically…

Computation and Language · Computer Science 2019-07-31 Falcon Z. Dai , Zheng Cai

This work extends Favard-type spectral representations for banded matrices $T$ beyond the bounded setting. It assumes that, for every $N\in\mathbb N_0$, there exists a shift $s_N\ge 0$ such that the shifted truncation $A_N:= T^{[N]}+s_N…

Classical Analysis and ODEs · Mathematics 2026-02-04 Amílcar Branquinho , Ana Foulquié-Moreno , Manuel Mañas

We consider an even probability distribution on the $d$-dimensional Euclidean space with the property that it assigns measure zero to any hyperplane through the origin. Given $N$ independent random vectors with this distribution, under the…

Probability · Mathematics 2020-12-24 Daniel Hug , Rolf Schneider

Attributes which are infrequently expressed in a population can require weeks or months of counting to reach statistical significance. But replacement in a stable population increases long-term counts to a degree determined by the…

Computational Geometry · Computer Science 2018-08-21 Aubrey G. Jaffer , Martin S. Jaffer

Query evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of approximation algorithms, and particularly of combined FPRASes,…

Databases · Computer Science 2025-12-17 Antoine Amarilli , Timothy van Bremen , Octave Gaspard , Kuldeep S. Meel

We investigate the behaviour of solutions of a fractional semilinear partial differential equation that models the evolution of an interface in a random medium. We show a pinning result and apply it to the related homogenizing process.

Analysis of PDEs · Mathematics 2019-03-13 Patrick Dondl , Martin Jesenko

This paper is concerned with inference in threshold regression models when the practitioners do not know whether at the threshold point the true specification has a kink or a jump. We nest previous works that assume either continuity or…

Statistics Theory · Mathematics 2020-01-15 Javier Hidalgo , Jungyoon Lee , Myung Hwan Seo

In science, as in life, `surprises' can be adequately appreciated only in the presence of a null model, what we expect a priori. In physics, theories sometimes express the values of dimensionless physical constants as combinations of…

Popular Physics · Physics 2016-03-02 Ariel Amir , Mikhail Lemeshko , Tadashi Tokieda

Conditional Kendall's tau is a measure of dependence between two random variables, conditionally on some covariates. We assume a regression-type relationship between conditional Kendall's tau and some covariates, in a parametric setting…

Statistics Theory · Mathematics 2018-11-21 Alexis Derumigny , Jean-David Fermanian

Expected shortfall is defined as the average over the tail below (or above) a certain quantile of a probability distribution. Expected shortfall regression provides powerful tools for learning the relationship between a response variable…

Methodology · Statistics 2025-01-03 Shushu Zhang , Xuming He , Kean Ming Tan , Wen-Xin Zhou

We prove that a pointwise fractional Hardy inequality implies a fractional Hardy inequality, defined via a Gagliardo-type seminorm. The proof consists of two main parts. The first one is to characterize the pointwise fractional Hardy…

Classical Analysis and ODEs · Mathematics 2024-04-09 Lizaveta Ihnatsyeva , Kaushik Mohanta , Antti V. Vähäkangas

Bayesian and frequentist criteria fundamentally differ, but often posterior and sampling distributions agree asymptotically (e.g., Gaussian with same covariance). For the corresponding single-draw experiment, we characterize the frequentist…

Statistics Theory · Mathematics 2024-07-04 David M. Kaplan , Longhao Zhuo

Statistical machine learning theory often tries to give generalization guarantees of machine learning models. Those models naturally underlie some fluctuation, as they are based on a data sample. If we were unlucky, and gathered a sample…

Machine Learning · Computer Science 2022-11-21 Alexander Mey

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…

Combinatorics · Mathematics 2012-02-01 Noga Alon , Peter Frankl , Hao Huang , Vojtech Rodl , Andrzej Rucinski , Benny Sudakov

We discuss in detail the asymptotic distribution of sample expectiles. First, we show uniform consistency under the assumption of a finite mean. In case of a finite second moment, we show that for expectiles other then the mean, only the…

Methodology · Statistics 2016-07-14 Hajo Holzmann , Bernhard Klar

Predictions in the form of sets of probability distributions, so-called credal sets, provide a suitable means to represent a learner's epistemic uncertainty. In this paper, we propose a theoretically grounded approach to credal prediction…

Machine Learning · Statistics 2025-12-16 Timo Löhr , Paul Hofman , Felix Mohr , Eyke Hüllermeier

In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…

Combinatorics · Mathematics 2018-05-09 A. V. Burkin , M. E. Zhukovskii

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

Classical Analysis and ODEs · Mathematics 2017-08-18 Ben Krause , Pavel Zorin-Kranich

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian of all $r$-uniform hypergraphs of fixed size $m$ is realised by the initial segment of the colexicographic order. In particular, in the principal case $m=\binom{t}{r}$…

Combinatorics · Mathematics 2017-10-11 Mykhaylo Tyomkyn
‹ Prev 1 4 5 6 7 8 10 Next ›