2000 character limit reached
Cyclic independence: Boolean and monotone (2204.00072v2)
Published 31 Mar 2022 in math.PR and math.OA
Abstract: 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 for convolutions, limit theorems for sums of independent random variables, and also classify infinitely divisible distributions with respect to cyclic-Boolean convolution. Finally, we provide applications to the eigenvalues of the adjacency matrices of iterated star products of graphs and also iterated comb products of graphs.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.