Related papers: A tame sequence of transitive Boolean functions

A nonnegative real function $f$ is said to be bell-shaped if it converges to zero at $\pm\infty$ and the $n$th derivative of $f$ changes sign $n$ times for every $n = 0, 1, 2, \ldots$ In a similar way, we may say that a nonnegative sequence…

Let $\xi$ n , n $\in$ N be a sequence of i.i.d. random variables with values in Z. The associated random walk on Z is S(n) = $\xi$ 1 + $\times$ $\times$ $\times$ + $\xi$ n+1 and the corresponding "reflected walk" on N 0 is the Markov chain…

We consider a nearest-neighbor, one dimensional random walk $\{X_n\}_{n\geq0}$ in a random i.i.d. environment, in the regime where the walk is transient but with zero speed, so that $X_n$ is of order $n^s$ for some $s<1$. Under the quenched…

An extremal point of a positive threshold Boolean function $f$ is either a maximal zero or a minimal one. It is known that if $f$ depends on all its variables, then the set of its extremal points completely specifies $f$ within the universe…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where basically $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that $X_1$ is…

We consider a one dimensional random walk in a random environment (RWRE) with a positive speed $\lim_{n\to\infty}\frac{X_n}{n}=v_\alpha>0$. Gantert and Zeitouni showed that if the environment has both positive and negative local drifts then…

Let $f$ be an inner function with $f(0)=0$ which is not a rotation and let $f^{n}$ be its $n$-th iterate. Let $\{a_{n}\}$ be a sequence of complex numbers. We prove that the series $\sum a_{n}f^{n}(\xi)$ converges at almost every point…

Consider a heavy-tailed branching process (denoted by $Z_{n}$) in random environments, under the condition which infers that $\mathbb{E}\log m(\xi_{0})=\infty$. We show that (1) there exists no proper $c_{n}$ such that $\{Z_{n}/c_{n}\}$ has…

We consider a sequence $(\xi_n)_{n\ge1}$ of $i.i.d.$ random values living in the domain of attraction of an extreme value distribution. For such sequence, there exists $(a_n)$ and $(b_n)$, with $a_n>0$ and $b_n\in\ER$ for every $n\ge 1$,…

We study the probability of Boolean functions with small max influence to become constant under random restrictions. Let $f$ be a Boolean function such that the variance of $f$ is $\Omega(1)$ and all its individual influences are bounded by…

We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…

The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…

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…

We consider certain Fibonacci-like sequences $(X_n)_{n\geq 0}$ perturbed with a random noise. Our main result is that $\frac{1}{X_n}\sum_{k=0}^{n-1}X_k$ converges in distribution, as $n$ goes to infinity, to a random variable $W$ with…

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…

We obtain functional central limit theorems for both discrete time expressions of the form $1/\sqrt{N}\sum_{n=1}^{[Nt]}(F(X(q_1(n)),\ldots, X(q_{\ell}(n)))-\bar{F})$ and similar expressions in the continuous time where the sum is replaced…

We identify the weights $wt(f_n)$ of a family $\{f_n\}$ of rotation symmetric Boolean functions with the cardinalities of the sets of $n$-periodic points of a finite-type shift, recovering the second author's result that said weights…

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…