Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 63 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 33 tok/s Pro
GPT-4o 106 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 440 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Limit theorems for classical, freely and Boolean max-infinitely divisible distributions (1907.11996v4)

Published 28 Jul 2019 in math.PR and math.FA

Abstract: We investigate a Belinschi-Nica type semigroup for free and Boolean max-convolutions. We prove that this semigroup at time one connects limit theorems for freely and Boolean max-infinitely divisible distributions. Moreover, we also construct a max-analogue of Boolean-classical Bercovici-Pata bijection, establishing the equivalence of limit theorems for Boolean and classical max-infinitely divisible distributions.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube