Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0707.3401

Limit laws for boolean convolutions

Jiun-Chau Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.OAmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiun-Chau Wang. 2007-07-28. Limit laws for boolean convolutions. https://arxiv.org/abs/0707.3401

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quantum Graph Theory by Example

Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in working with quantum graphs compared to classical graphs stems from the fact that they are no longer discrete objects. This makes it generally difficult to construct insightful, non-trivial examples. We present a collection of non-trivial quantum graphs that can be thought of in discrete terms, and that can be expressed in the diagrammatic formalism introduced by Musto, Reutter, and Verdon. The examples arise as the quantum graphs acted on by increasingly smaller classical matrix groups, and are parametrised by triples of matrices $(A, B, C)$. The parametrisation reveals a clean decomposition of quantum graph structure into classical and genuinely quantum components: $A$ and $C$ are described by a classical weighted graph called the strange graph, while $B$ provides a purely quantum contribution with no classical analogue. Based on this model, we give exact formulas or establish bounds for quantum graph parameters, such as the number of connected components, the chromatic number, the independence number, and the clique number. Our results provide the first large, parametric families of quantum graphs for which standard graph parameters can be computed analytically.

math.OA↗
arXiv2026

Talagrand type for noncommutative $L_1$ spaces

Let $(\mathcal{M},τ)$ be a semi-finite von Neumann algebra. We prove that $L_1(\mathcal{M})$ has Talagrand type $(1,ψ_{1,1})$, where $ψ_{1,1}(t)=t/\log(e+t)$. As an consequence, the Schatten trace class $S_1$ has Talagrand type $(1,ψ_{1,1})$, thus settled an open problem of Question 2 in Cordero-Erausquin and Eskenazis (2023). Our proof is based on the noncommutative Mazur maps initiated by Ricard.

math.OA↗