
TL;DR
This paper derives formulas for the probability that a rational number belongs to a random ratio set formed from a randomly chosen subset of integers, extending previous results and exploring related graph connectivity considerations.
Contribution
It provides a generalized formula for membership probabilities in random ratio sets and links these probabilities to graph connectivity analysis.
Findings
Derived a formula for the probability that a rational number is in the ratio set.
Extended previous results by Cilleruelo and Guijarro-Ordóñez.
Connected membership probabilities to graph component analysis.
Abstract
Let be a random set constructed by picking independently each element of with probability . We give a formula for the probability that a rational number belong to the random ratio set . This generalizes a previous result of Cilleruelo and Guijarro-Ord\'o\~nez. Moreover, we make some considerations about formulas for the probability of the event , where are rational numbers, showing that they are related to the study of the connected components of certain graphs. In particular, we give formulas for the probability that for some , where is a finite or cofinite set of positive integers with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Mathematical Dynamics and Fractals · Algorithms and Data Compression
