SearcharxivSearch

arXiv · 2404.03513

A Framework for Asymptotic Limit Problems of Probabilistic Nature

Abstract

A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the limit of the arithmetic mean of its partial sums; but several classes of problems are examined in a much more general setting. The proposed framework, which aims to unify those questions and their solution, is based on the idea that to any finite multiset $E_n$, one can associate a finitely distributed atomic probability $\mu_n$; assuming $\mu_n$ tends in distribution to a probability $\mu$, it provides the tools needed to establish the desired asymptotic limit. Few examples are worked out in order to illustrate how using the framework.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michaël Bensimhoun. 2024-02-15. A Framework for Asymptotic Limit Problems of Probabilistic Nature. https://arxiv.org/abs/2404.03513

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

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO