We provide Berry-Esseen bounds for sums of operator-valued Boolean and monotone independent variables, in terms of the first moments of the summands. Our bounds are on the level of Cauchy transforms as well as the Lévy distance. As applications, we obtain quantitative bounds for the corresponding CLTs, provide a quantitative "fourth moment theorem" for monotone independent random variables including the operator-valued case, and generalize the results by Hao and Popa on matrices with Boolean entries. Our approach relies on a Lindeberg method that we develop for sums of Boolean/monotone independent random variables. Furthermore, we push this approach to the infinitesimal setting to obtain the first quantitative estimates for the operator-valued infinitesimal free, Boolean and monotone CLT.
We give a complete list of the Lebesgue-Jordan decomposition of Boolean and monotone stable distributions and a complete list of the mode of them. They are not always unimodal.
We construct several new spaces of quantum sequences and their quantum families of maps in sense of Sołtan. Then, we introduce noncommutative distributional symmetries associated with these quantum maps and study simple relations between them. We will focus on studying two kinds of noncommutative distributional symmetries: monotone spreadability and boolean spreadability. We provide an example of a spreadable sequence of random variables for which the usual unilateral shift is an unbounded map. As a result, it is natural to study bilateral sequences of random objects, which are indexed by inte…
Boolean, free and monotone cumulants as well as relations among them, have proven to be important in the study of non-commutative probability theory. Quite notably, Boolean cumulants were successfully used to study free infinite divisibility via the Boolean Bercovici--Pata bijection. On the other hand, in recent years the concept of infinitesimal non-commutative probability has been developed, together with the notion of infinitesimal cumulants which can be useful in the context of combinatorial questions. In this paper, we show that the known relations among free, Boolean and monotone cumulan…
The additive monotone (resp. boolean) unitary Brownian motion is a non-commutative stochastic process with monotone (resp. boolean) independent and stationary increments which are distributed according to the arcsine law (resp. Bernoulli law) . We introduce the monotone and booleen unitary Brownian motions and we derive a closed formula for their associated moments. This provides a description of their spectral measures. We prove that, in the monotone case, the multiplicative analog of the arcsine distribution is absolutely continuous with respect to the Haar measure on the unit circle, wherea…
We study the multiplicative convolution for c-monotone independence. This convolution unifies the monotone, Boolean and orthogonal multiplicative convolutions. We characterize convolution semigroups for the c-monotone multiplicative convolution on the unit circle. We also prove that an infinitely divisible distribution can always be embedded in a convolution semigroup. We furthermore discuss the (non)-uniqueness of such embeddings including the monotone case. Finally connections to the multiplicative Boolean convolution are discussed.
In a 1999 paper, Bercovici and Pata showed that a natural bijection between the classically, free and Boolean infinitely divisible measures held at the level of limit theorems of triangular arrays. This result was extended to include monotone convolution by the authors. In recent years, operator-valued versions of free, Boolean and monotone probability have also been developed. Belinschi, Popa and Vinnikov showed that the Bercovici-Pata bijection holds for the operator-valued versions of free and Boolean probability. In this article, we extend the bijection to include monotone probability theo…
In the present paper we define the notion of generalized cumulants which gives a universal framework for commutative, free, Boolean, and especially, monotone probability theories. The uniqueness of generalized cumulants holds for each independence, and hence, generalized cumulants are equal to the usual cumulants in the commutative, free and Boolean cases. The way we define (generalized) cumulants needs neither partition lattices nor generating functions and then will give a new viewpoint to cumulants. We define ``monotone cumulants'' in the sense of generalized cumulants and we obtain quite s…
We study $N$-ary non-commutative notions of independence, which are given by trees and which generalize free, Boolean, and monotone independence. For every rooted subtree $\mathcal{T}$ of the $N$-regular tree, we define the $\mathcal{T}$-free product of $N$ non-commutative probability spaces and we define the $\mathcal{T}$-free additive convolution of $N$ non-commutative laws. These $N$-ary convolution operations form a topological symmetric operad which includes the free, Boolean, monotone, and anti-monotone convolutions, as well as the orthogonal and subordination convolutions. Using the ope…
We study the distributional behavior for products, and for sums of boolean independent random variables in an infinitesimal triangular array. We show that the limit laws of boolean convolutions are determined by the limit laws of free convolutions, and vice versa. We further use these results to show several connections between the limiting distributional behavior of classical convolutions and that of boolean convolutions. The proof of our results is based on the analytical apparatus developed for free convolutions.
The theory of cumulants is revisited in the "Rota way", that is, by following a combinatorial Hopf algebra approach. Monotone, free, and boolean cumulants are considered as infinitesimal characters over a particular combinatorial Hopf algebra. The latter is neither commutative nor cocommutative, and has an underlying unshuffle bialgebra structure which gives rise to a shuffle product on its graded dual. The moment-cumulant relations are encoded in terms of shuffle and half-shuffle exponentials. It is then shown how to express concisely monotone, free, and boolean cumulants in terms of each oth…
We give sufficient conditions ensuring the strong ergodic property of unique mixing for $C^*$-dynamical systems arising from Yang-Baxter-Hecke quantisation. We discuss whether they can be applied to some important cases including monotone, Boson, Fermion and Boolean $C^*$-algebras in a unified version. The monotone and the Boolean cases are treated in full generality, the Bose/Fermi cases being already widely investigated. In fact, on one hand we show that the set of stationary stochastic processes are isomorphic to a segment in both the situations, on the other hand the Boolean processes enjo…
Consider a monotone Boolean function $f:\{0,1\}^n\to\{0,1\}$ and the canonical monotone coupling $\{η_p:p\in[0,1]\}$ of an element in $\{0,1\}^n$ chosen according to product measure with intensity $p\in[0,1]$. The random point $p\in[0,1]$ where $f(η_p)$ flips from $0$ to $1$ is often concentrated near a particular point, thus exhibiting a threshold phenomenon. For a sequence of such Boolean functions, we peer closely into this threshold window and consider, for large $n$, the limiting distribution (properly normalized to be nondegenerate) of this random point where the Boolean function switche…
A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with $\E_p[f] = \eps$ and $\E_q[f] = 1-\eps$ then $q-p \to 0$ as $n \to \infty$. Here $\E_p$ denotes the product probability measure on $\{0,1\}^n$ where each coordinate takes the value $1$ independently with probability $p$. The fact that symmetric functions undergo sharp thresholds is important in the study of random graphs and constraint satisfaction problems as well…
Bercovici and Pata showed that the correspondence between classically, freely, and Boolean infinitely divisible distributions holds on the level of limit theorems. We extend this correspondence also to distributions infinitely divisible with respect to the additive monotone convolution. Because of non-commutativity of this convolution, we use a new technique based on the Chernoff product formula. In fact, the correspondence between the Boolean and monotone limit theorems extends from probability measures to positive measures of total weight at most one. Finally, we study this correspondence fo…
We define a product of algebraic probability spaces equipped with two states. This product is called a conditionally monotone product. This product is a new example of independence in non-commutative probability theory and unifies the monotone and Boolean products, and moreover, the orthogonal product. Then we define the associated cumulants and calculate the limit distributions in central limit theorem and Poisson's law of small numbers. We also prove a combinatorial moment-cumulant formula using monotone partitions. We investigate some other topics such as infinite divisibility for the addit…
We study Boolean stable laws, $\mathbf{b}_{α,ρ}$, with stability index $α$ and asymmetry parameter $ρ$. We show that the classical scale mixture of $\mathbf{b}_{α,ρ}$ coincides with a free mixture and also a monotone mixture of $\mathbf{b}_{α,ρ}$. For this purpose we define the multiplicative monotone convolution of probability measures, one is supported on the positive real line and the other is arbitrary. We prove that any scale mixture of $\mathbf{b}_{α,ρ}$ is both classically and freely infinitely divisible for $α\leq1/2$ and also for some $α>1/2$. Furthermore, we show the multiplicative i…
We introduce a new notion of influence for symmetric convex sets over Gaussian space, which we term "convex influence". We show that this new notion of influence shares many of the familiar properties of influences of variables for monotone Boolean functions $f: \{\pm1\}^n \to \{\pm1\}.$ Our main results for convex influences give Gaussian space analogues of many important results on influences for monotone Boolean functions. These include (robust) characterizations of extremal functions, the Poincaré inequality, the Kahn-Kalai-Linial theorem, a sharp threshold theorem of Kalai, a stability ve…
We introduce a class of independence relations, which include free, Boolean and monotone independence, in operator valued probability. We show that this class of independence relations have a matricial extension property so that we can easily study their associated convolutions via Voiculescu's fully matricial function theory. Based the matricial extension property, we show that many results can be generalized to multi-variable cases. Besides free, Boolean and monotone independence convolutions, we will focus on two important convolutions, which are orthogonal and subordination additive convol…
Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F. Oravecz. We characterize the property of independent constants from a combinatorial point of view, based on cumulants and set partitions. This characterization also holds for the operator-valued extension. Our considerations lead rather directly to very mild variations of boolean and monotone cumulants, where constants are now independent. These alternative probabi…
The purpose of this expository note is to give the proof of a theorem of Bourgain with some additional details and updated notation. The theorem first appeared as an appendix to the breakthrough paper by Friedgut, \emph{Sharp Thresholds of graph properties and the $k$-SAT Problem}. Throughout, we use notation and definitions akin to those in O'Donnell's book, \emph{Analysis of Boolean Functions}.
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties of a complex under this measure. We are able to determine or present bounds for a number of topological and combinatorial properties. We also study the random pure simplicial complex of dimension $d$, generated by letting any subset of size $d+1$ of a set of $n$ vertices be a facet with probability $p$ and considering the simplicial complex generated by thes…
Hillclimbing is an essential part of any optimization algorithm. An important benchmark for hillclimbing algorithms on pseudo-Boolean functions $f: \{0,1\}^n \to \mathbb{R}$ are (strictly) montone functions, on which a surprising number of hillclimbers fail to be efficient. For example, the $(1+1)$-Evolutionary Algorithm is a standard hillclimber which flips each bit independently with probability $c/n$ in each round. Perhaps surprisingly, this algorithm shows a phase transition: it optimizes any monotone pseudo-boolean function in quasilinear time if $c<1$, but there are monotone functions fo…
Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of symmetric monotone properties is improved. This follows from a new lower bound on the maximal influence of a variable on a Boolean function. The method of proof is based on a well-known logarithmic Sobolev inequality on $\{0,1\}^n$. This new bound is shown to be asymptotically optimal.
Division of Science, NYU Abu Dhabi（纽约大学阿布扎比分校科学系）；Center for Interdisciplinary Data Science and AI, NYUAD Research Institute（NYUAD研究院跨学科数据科学与人工智能中心）；Courant Institute of Mathematical Sciences, New York University（纽约大学库朗数学科学研究所）
We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the structure of monotone set properties that do not exhibit sharp thresholds. Our result generalizes the core of Friedgut's seminal work [Ehud Friedgut. Sharp thresholds of graph properties, and the k-sat problem. J. Amer. Math. Soc., 12(4):1017-1054, 1999.] on properties of random graphs to the setting of arbitrary Boolean functions on general product probabil…
We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about the behaviour of the function when the input bits are not completely independent, but only k-wise independent, i.e. every subset of k bits is independent? more precisely, how high should k be so that any k-wise independent distribution "fools" the function, i.e. causes it to behave nearly the same as when the bits are completely independent? We analyze sever…
A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of squares of influences in $f$ is close to zero then $f$ must be noise sensitive. We show a quantitative version of this result which does not depend on $n$, and prove that it is tight for certain parameters. Our results hold also for a general product measure $μ_p$ on the discrete cube, as long as $\log 1/p \ll \log n$. We note that in [BKS], a quantitative relatio…
