English
Related papers

Related papers: Asymptotic enumeration of correlation-immune boole…

200 papers

Thesis is devoted to the application of cumulant analysis in the estimation of impulse response functions for continuous time-invariant linear systems, including systems with inner noises. The main assumption of the work is the second-order…

Statistics Theory · Mathematics 2020-05-26 Irina Blazhievska

In this article, we study nonparametric inference for a covariate-adjusted regression function. This parameter captures the average association between a continuous exposure and an outcome after adjusting for other covariates. In…

Methodology · Statistics 2023-12-18 Kenta Takatsu , Ted Westling

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…

Discrete Mathematics · Computer Science 2019-11-14 Joel Friedman , David Kohler

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

Number Theory · Mathematics 2025-03-06 Javier Pliego , Yu-Chen Sun , Mengdi Wang

In [Temme N.M., Special functions. An introduction to the classical functions of mathematical physics, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1996, Section 11.3.3.1] a uniform asymptotic expansion for the…

Classical Analysis and ODEs · Mathematics 2016-10-26 Gergő Nemes , Adri B. Olde Daalhuis

For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…

Number Theory · Mathematics 2016-04-13 V. L. Chernyshev , D. S. Minenkov , V. E. Nazaikinskii

A conjunctive Boolean network (CBN) is a finite state dynamical system, whose variables take values from a binary set, and the value update rule for each variable is a Boolean function consisting only of logic AND operations. We investigate…

Dynamical Systems · Mathematics 2019-07-11 Xudong Chen , Zuguang Gao , Tamer Başar

The insurance model when the amount of claims depends on the state of the insured person (healthy, ill, or dead) and claims are connected in a Markov chain is investigated. The signed compound Poisson approximation is applied to the…

Probability · Mathematics 2020-01-13 Gabija Liaudanskaitė , Vydas Čekanavičius

We discuss avoidance of sure loss and coherence results for semicopulas and standardized functions, i.e., for grounded, 1-increasing functions with value $1$ at $(1,1,\ldots, 1)$. We characterize the existence of a $k$-increasing…

In two-dimensional statistical physics, correlation functions of the O(N) and Potts models may be written as sums over configurations of non-intersecting loops. We define sums associated to a large class of combinatorial maps (also known as…

High Energy Physics - Theory · Physics 2023-10-11 Linnea Grans-Samuelsson , Jesper Lykke Jacobsen , Rongvoram Nivesvivat , Sylvain Ribault , Hubert Saleur

We study the volatility of the output of a Boolean function when the input bits undergo a natural dynamics. For $n = 1,2,\ldots$, let $f_n:\{0,1\}^{m_n} \ra \{0,1\}$ be a Boolean function and $X^{(n)}(t)=(X_1(t),\ldots,X_{m_n}(t))_{t \in…

Probability · Mathematics 2015-07-14 Johan Jonasson Jeffrey E. Steif

We address the challenge of estimation in the context of constant linear effect models with dense functional responses. In this framework, the conditional expectation of the response curve is represented by a linear combination of…

Methodology · Statistics 2024-10-07 Pratim Guha Niyogi , Ping-Shou Zhong

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

Computational Complexity · Computer Science 2015-08-12 Parikshit Gopalan , Noam Nisan , Rocco A. Servedio , Kunal Talwar , Avi Wigderson

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

Computational Complexity · Computer Science 2021-02-24 Guoliang Xu , Daowen Qiu

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

Combinatorics · Mathematics 2026-05-01 Ben Green , Mehtaab Sawhney

In this paper, we propose a general framework for the asymptotic analysis of node-based verification-based algorithms. In our analysis we tend the signal length $n$ to infinity. We also let the number of non-zero elements of the signal $k$…

Information Theory · Computer Science 2010-01-14 Yaser Eftekhari , Amir H. Banihashemi , Ioannis Lambadaris

In this paper some cryptographic properties of Boolean functions, including weight, balancedness and nonlinearity, are studied, particularly focusing on splitting functions and cubic Boolean functions. Moreover, we present some quantities…

Cryptography and Security · Computer Science 2024-06-17 Augustine Musukwa , Massimiliano Sala , Marco Zaninelli

Let $\alpha_n(\cdot)=P\bigl(X_{n+1}\in\cdot\mid X_1,\ldots,X_n\bigr)$ be the predictive distributions of a sequence $(X_1,X_2,\ldots)$ of $p$-dimensional random vectors. Suppose $$\alpha_n= \mathcal{N} _p (M_n,Q_n)$$ where…

Statistics Theory · Mathematics 2024-09-17 Samuele Garelli , Fabrizio Leisen , Luca Pratelli , Pietro Rigo

We give an algorithm for learning symmetric k-juntas (boolean functions of $n$ boolean variables which depend only on an unknown set of $k$ of these variables) in the PAC model under the uniform distribution, which runs in time n^{O(k/\log…

Combinatorics · Mathematics 2007-05-23 Mihail N. Kolountzakis , Evangelos Markakis , Aranyak Mehta

We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let $X^n$ be i.i.d. Bernoulli(1/2), and let $Y^n$ be the result of passing $X^n$ through a…

Information Theory · Computer Science 2013-07-16 Gowtham R. Kumar , Thomas A. Courtade
‹ Prev 1 4 5 6 7 8 10 Next ›