Related papers: Monotone and Boolean Convolutions for Non-compactl…
We introduce the boolean convolution for probability measures on the unit circle. Roughly speaking, it describes the distribution of the product of two boolean independent unitary random variables. We find an analogue of the characteristic…
In this thesis we study convolutions that arise from noncommutative probability theory. We prove several regularity results for free convolutions, and for measures in partially defined one-parameter free convolution semigroups. We discuss…
Recently, Bercovici has introduced multiplicative convolutions based on Muraki's monotone independence and shown that these convolution of probability measures correspond to the composition of some function of their Cauchy transforms. We…
We introduce and study a new type of convolution of probability measures called the orthogonal convolution, which is related to the monotone convolution. Using this convolution, we derive alternating decompositions of the free additive…
We extend to arbitrary measures results of Bao, Erd\"os, Schnelli, Moreillon, and Ji on the connectedness of the supports of additive convolutions of measures on \mathbb{R} and of free multiplicative convolutions of measures on…
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…
The wrapping transformation $W$ is a homomorphism from the semigroup of probability measures on the real line, with the convolution operation, to the semigroup of probability measures on the circle, with the multiplicative convolution…
In this article we study the influence of regularly varying probability measures on additive and multiplicative Boolean convolutions. We introduce the notion of Boolean subexponentiality (for additive Boolean convolution), which extends the…
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.…
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…
A probability distribution over the Boolean cube is monotone if flipping the value of a coordinate from zero to one can only increase the probability of an element. Given samples of an unknown monotone distribution over the Boolean cube, we…
We investigate variance bounds under symmetry constraints in classical, free, and Boolean probability, focusing on Bernoulli distributions and their noncommutative analogues, projections with trace \(p\). We show that symmetrizers under…
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…
We develop analytic tools for studying the free multiplicative convolution of any measure on the real line and any measure on the nonnegative real line. More precisely, we construct the subordination functions and the $S$-transform of an…
It is shown that the free multiplicative convolution of two nondegenerate probability measures on the unit circle has no continuous singular part relative to arclength measure. Analogous results have long been known for free additive…
This paper studies the problem of testing whether a function is monotone from a nonparametric Bayesian perspective. Two new families of tests are constructed. The first uses constrained smoothing splines, together with a hierarchical…
Characterization problems in free probability are studied here. Using subordination of free additive and free multiplicative convolutions we generalize some known characterizations in free probability to random variables with unbounded…
Monotone Boolean functions are a structurally important class of Boolean functions, but their restricted form imposes strong limitations on achievable nonlinearity. In this paper, we investigate whether evolutionary computation can evolve…
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p…
Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our…