Related papers: Monotone and Boolean Convolutions for Non-compactl…
We develop the complex-analytic viewpoint on the tree convolutions studied by the second author and Weihua Liu in "An operad of non-commutative independences defined by trees" (Dissertationes Mathematicae, 2020, doi:10.4064/dm797-6-2020),…
Let $\mathcal{M}$ be the set of Borel probability measures on $\mathbb{R}$. We denote by $\mu^{\mathrm{ac}}$ the absolutely continuous part of $\mu\in\mathcal{M}$. The purpose of this paper is to investigate the supports and regularity for…
A univariate continuous function can always be decomposed as the sum of a non-increasing function and a non-decreasing one. Based on this property, we propose a non-parametric regression method that combines two spline-fitted monotone…
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…
We give a $\mathrm{poly}(\log n, 1/\epsilon)$-query adaptive algorithm for testing whether an unknown Boolean function $f: \{-1,1\}^n \to \{-1,1\}$, which is promised to be a halfspace, is monotone versus $\epsilon$-far from monotone. Since…
In [5], O. Bauer interpreted the chordal Loewner equation in terms of non-commutative probability theory. We follow this perspective and identify the chordal Loewner equations as the non-autonomous versions of evolution equations for…
We prove that the free additive convolution of two Borel probability measures supported on the real line can have a component that is singular continuous with respect to the Lebesgue measure on the real line only if one of the two measures…
The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…
This paper deals with three major types of convergence of probability measures on metric spaces: weak convergence, setwise converges, and convergence in the total variation. First, it describes and compares necessary and sufficient…
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…
Challenging research in various fields has driven a wide range of methodological advances in variable selection for regression models with high-dimensional predictors. In comparison, selection of nonlinear functions in models with additive…
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…
Combinatorial mixed valuations associated to translation-invariant valuations on polytopes are introduced. In contrast to the construction of mixed valuations via polarization, combinatorial mixed valuations reflect and often inherit…
We use the theory of fully matricial, or non-commutative, functions to investigate infinite divisibility and limit theorems in operator-valued non-commutative probability. Our main result is an operator-valued analogue of the Bercovici-Pata…
The Principle of Complementarity of Probabilities based on of noncommutative probability is introduced.
In this paper, we study the supports of measures in multiplicative free semigroups on the positive real line and on the unit circle. We provide formulas for the density of the absolutely continuous parts of measures in these semigroups. The…
We report an inconsistency found in probability theory (also referred to as measure-theoretic probability). For probability measures induced by real-valued random variables, we deduce an "equality" such that one side of the "equality" is a…
Suppose that we are interested in the average causal effect of a binary treatment on an outcome when this relationship is confounded by a binary confounder. Suppose that the confounder is unobserved but a nondifferential proxy of it is…
A number of complexity measures for Boolean functions have previously been introduced. These include (1) sensitivity, (2) block sensitivity, (3) witness complexity, (4) subcube partition complexity and (5) algorithmic complexity. Each of…
Parameter identification problems are formulated in a probabilistic language, where the randomness reflects the uncertainty about the knowledge of the true values. This setting allows conceptually easily to incorporate new information, e.g.…