English
Related papers

Related papers: Asymptotic enumeration of correlation-immune boole…

200 papers

Consider a point-to-point communication system in which the transmitter holds a binary message of length $m$ and transmits a corresponding codeword of length $n$. The receiver's goal is to recover a Boolean function of that message, where…

Information Theory · Computer Science 2026-04-17 Jingge Zhu , Matthias Frey

There is a substantial literature on testing for the equality of the cumulative incidence functions associated with one specific cause in a competing risks setting across several populations against specific or all alternatives. In this…

Statistics Theory · Mathematics 2008-12-18 Hammou El Barmi , Subhash Kochar , Hari Mukerjee

We calculate the asymptotic behaviour of correlation functions as a function of the microscopic parameters for a Bose-Fermi mixture with repulsive interaction in one dimension. For two cases, namely polarized and unpolarized fermions the…

Strongly Correlated Electrons · Physics 2007-05-23 Holger Frahm , Guillaume Palacios

In this paper we study correlation measures introduced in \cite{emme_asymptotic_2017}. Denote by $\mu_a(d)$ the asymptotic density of the set $\mathcal{E}_{a,d}=\{n \in \mathbb{N}, \ s_2(n+a)-s_2(n)=d\}$ (where $s_2$ is the sum-of-digits…

Dynamical Systems · Mathematics 2018-10-29 Jordan Emme , Pascal Hubert

Quantile regression is a powerful tool for detecting exposure-outcome associations given covariates across different parts of the outcome's distribution, but has two major limitations when the aim is to infer the effect of an exposure.…

We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…

Probability · Mathematics 2007-05-23 Gregory Freiman , Boris Granovsky

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

Number Theory · Mathematics 2016-07-27 Titus Hilberdink , László Tóth

This paper focuses on a semiparametric regression model in which the response variable is explained by the sum of two components. One of them is parametric (linear), the corresponding explanatory variable is measured with additive error and…

Methodology · Statistics 2024-11-20 Silvia Novo , Germán Aneiros , Philippe Vieu

We derive asymptotic estimates for the coefficient of $z^{k}$ in $\left( f\left( z\right) \right) ^{n}$ when $n\rightarrow \infty $ and $k$ is of order $n^{\delta }$, where $0<\delta <1,$ and $f\left( z\right) $ is a power series satisfying…

Classical Analysis and ODEs · Mathematics 2023-07-19 Valerio De Angelis

We introduce an index for measuring the influence of the k-th smallest variable on a pseudo-Boolean function. This index is defined from a weighted least squares approximation of the function by linear combinations of order statistic…

Optimization and Control · Mathematics 2012-05-01 Jean-Luc Marichal , Pierre Mathonet

This paper illustrates asymptotic properties for a response-adaptive design generated by a two-color, randomly reinforced urn model. The design considered is optimal in the sense that it assigns patients to the best treatment, with…

Statistics Theory · Mathematics 2009-04-03 Caterina May , Nancy Flournoy

We determine a connection between the weight of a Boolean function and the total weight of its first-order derivatives. The relationship established is used to study some cryptographic properties of Boolean functions. We establish a…

Cryptography and Security · Computer Science 2023-05-02 Augustine Musukwa

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Data Structures and Algorithms · Computer Science 2015-04-08 Ishay Haviv , Oded Regev

Our interest is in the scaled joint distribution associated with $k$-increasing subsequences for random involutions with a prescribed number of fixed points. We proceed by specifying in terms of correlation functions the same distribution…

Combinatorics · Mathematics 2007-05-23 Peter J. Forrester , Taro Nagao , Eric M. Rains

This paper develops asymptotic theory of integrals of empirical quantile functions with respect to random weight functions, which is an extension of classical $L$-statistics. They appear when sample trimming or Winsorization is applied to…

Statistics Theory · Mathematics 2019-10-18 Tetsuya Kaji

How many $k$-SAT functions on $n$ boolean variables are there? What does a typical such function look like? Bollob\'as, Brightwell, and Leader conjectured that, for each fixed $k \ge 2$, the number of $k$-SAT functions on $n$ variables is…

Combinatorics · Mathematics 2022-04-26 Dingding Dong , Nitya Mani , Yufei Zhao

Strongly consistent estimates are shown, via relative frequency, for the probability of "white balls" inside a dichotomous urn when such a probability is an arbitrary continuous time dependent function over a bounded time interval. The…

Methodology · Statistics 2017-09-20 Silvano Fiorin

Asymptotic expansion of a variation with anticipative weights is derived by the theory of asymptotic expansion for Skorohod integrals having a mixed normal limit. The expansion formula is expressed with the quasi-torsion, quasi-tangent and…

Probability · Mathematics 2021-01-05 Nakahiro Yoshida

We give a non-adaptive algorithm that makes $2^{\tilde{O}(\sqrt{k\log(1/\varepsilon_2 - \varepsilon_1)})}$ queries to a Boolean function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$ and distinguishes between $f$ being $\varepsilon_1$-close to some…

Data Structures and Algorithms · Computer Science 2024-04-23 Shivam Nadimpalli , Shyamal Patel

Motivated by applications in bioinformatics, we consider the word collector problem, i.e. the expected number of calls to a random weighted generator of words of length $n$ before the full collection is obtained. The originality of this…

Discrete Mathematics · Computer Science 2012-04-18 Jérémie Du Boisberranger , Danièle Gardy , Yann Ponty