English
Related papers

Related papers: Asymptotic enumeration of correlation-immune boole…

200 papers

In this paper we obtain the average sensitivity of the laced Boolean functions. This confirms a conjecture of Shparlinski. We also compute the weights of the laced Boolean functions and show that they are almost balanced.

Information Theory · Computer Science 2011-08-24 Jiyou Li

Normal copula with a correlation coefficient between $-1$ and $1$ is tail independent and so it severely underestimates extreme probabilities. By letting the correlation coefficient in a normal copula depend on the sample size, H\"usler and…

Methodology · Statistics 2016-05-04 Xin Liao , Liang Peng , Zuoxiang Peng , Yanting Zheng

Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theory in the domain of Boolean functions with low polynomial…

Computational Complexity · Computer Science 2021-07-26 Subhamoy Maitra , Chandra Sekhar Mukherjee , Pantelimon Stanica , Deng Tang

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

Probability · Mathematics 2012-06-21 Itai Benjamini , Oded Schramm , David B. Wilson

We examine the sum of modified Bessel functions with argument depending non-linearly on the summation index given by \[S_{\nu,p}(a)=\sum_{n\geq 1} (an^p/2)^{-\nu} K_\nu(an^p)\qquad (a>0,\ 0\leq\nu<1)\] as the parameter $a\to 0+$, where $p$…

Classical Analysis and ODEs · Mathematics 2019-05-02 R B Paris

Let $D_n$ denote the set of monotone Boolean functions with $n$ variables. Elements of $D_n$ can be represented as strings of bits of length $2^n$. Two elements of $D_0$ are represented as 0 and 1 and any element $g\in D_n$, with $n>0$, is…

Combinatorics · Mathematics 2023-10-20 Bartłomiej Pawelski , Andrzej Szepietowski

We propose a nonparametric method for estimating the conditional quantile function that admits a generalized additive specification with an unknown link function. This model nests single-index, additive, and multiplicative quantile…

Statistics Theory · Mathematics 2023-06-07 Yebin Cheng , Jan G. De Gooijer

In observational studies, potential confounders may distort the causal relationship between an exposure and an outcome. However, under some conditions, a causal dose-response curve can be recovered using the G-computation formula. Most…

Methodology · Statistics 2019-12-18 Ted Westling , Peter Gilbert , Marco Carone

A prescription is presented for a new and practical correlation coefficient, $\phi_K$, based on several refinements to Pearson's hypothesis test of independence of two variables. The combined features of $\phi_K$ form an advantage over…

Methodology · Statistics 2019-03-12 M. Baak , R. Koopman , H. Snoek , S. Klous

We present a simple result that allows us to evaluate the asymptotic order of the remainder of a partial asymptotic expansion of the quantile function $h(u)$ as $u\to 0^+$ or $1^-$. This is focussed on important univariate distributions…

Statistics Theory · Mathematics 2017-08-10 Thomas Fung , Eugene Seneta

In this paper, a robust non-parametric measure of statistical dependence, or correlation, between two random variables is presented. The proposed coefficient is a permutation-like statistic that quantifies how much the observed sample S_n :…

Methodology · Statistics 2020-07-27 Rami Mahdi

The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…

Commutative Algebra · Mathematics 2020-11-03 Le Tuan Hoa

Recurrence quantification analysis is a method for measuring the complexity of dynamical systems. Recurrence determinism is a fundamental characteristic of it, closely related to correlation sum. In this paper, we study asymptotic behavior…

Dynamical Systems · Mathematics 2023-04-05 Michaela Mihoková

NK-Kauffman networks {\cal L}^N_K are a subset of the Boolean functions on N Boolean variables to themselves, \Lambda_N = {\xi: \IZ_2^N \to \IZ_2^N}. To each NK-Kauffman network it is possible to assign a unique Boolean function on N…

Quantitative Methods · Quantitative Biology 2015-05-13 Federico Zertuche

Let $\mathbb{N}$ be the set of all nonnegative integers. For any positive integer $k$ and any subset $A$ of nonnegative integers, let $r_{1,k}(A,n)$ be the number of solutions $(a_1,a_2)$ to the equation $n=a_1+ka_2$. In 2016, Qu proved…

Number Theory · Mathematics 2023-09-12 Shi--Qiang Chen , Yuchen Ding , Xiaodong Lü , Yuhan Zhang

From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of {\em algebraic immunity} (AI) was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary…

Cryptography and Security · Computer Science 2007-05-23 Hao Chen , Jianhua Li

For each positive integer $k$, let $\mathscr{A}_k$ be the set of all positive integers $n$ such that $\gcd(n, F_n) = k$, where $F_n$ denotes the $n$th Fibonacci number. We prove that the asymptotic density of $\mathscr{A}_k$ exists and is…

Number Theory · Mathematics 2020-12-15 Carlo Sanna , Emanuele Tron

A long-standing problem in quantum mesoscopic physics is which operator order corresponds to noise expressions like <I(-\omega)I(\omega)>, where I(\omega) is the measured current at frequency \omega. Symmetrized order describes a classical…

Quantum Physics · Physics 2013-06-26 Adam Bednorz , Christoph Bruder , Bertrand Reulet , Wolfgang Belzig

Let $K_n$ be the convex hull of i.i.d. random variables distributed according to the standard normal distribution on $\R^d$. We establish variance asymptotics as $n \to \infty$ for the re-scaled intrinsic volumes and $k$-face functionals of…

Probability · Mathematics 2014-09-30 Pierre Calka , J. E. Yukich

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

Probability · Mathematics 2015-12-31 Aviad Rubinstein , Muli Safra