The Probability of Non-Intersection of Two Equi-Size Random Sets

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-16

This paper derives an exact expression for the probability of two equal-size random sets having no common elements and shows its close approximation to the binomial distribution.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-16 · read from full text

This preprint studies two random sets of equal size k drawn uniformly from integers in [1, M] and derives an exact expression for the probability that the two sets have no elements in common, under the condition 2k ≤ M. The author compares the exact result to a “familiar binomial” approximation and finds that the binomial solution is accurate up to terms of order 1/M^2. The main limitation is that the work is purely mathematical and assumes the stated random-set sampling model rather than any biological data-generating process. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract Consider two sets of equal length k , each element of which is sampled from a uniformly-distributed set of integers in the range [1, M] with 2 k ≤ M . This paper derives an exact expression for the probability that there will be no ele- ments in common between the two sets, and compares this to what is obtained from the familiar binomial distribution. It is shown that the binomial solution is accurate to the order of 1/M 2 , which is expected to be adequate for practical purposes.
Full text 8,629 characters · extracted from preprint-html · click to expand
The Probability of Non-Intersection of Two Equi-Size Random Sets | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article The Probability of Non-Intersection of Two Equi-Size Random Sets Paul F. Easthope This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8822184/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Consider two sets of equal length k , each element of which is sampled from a uniformly-distributed set of integers in the range [1, M] with 2 k ≤ M . This paper derives an exact expression for the probability that there will be no ele- ments in common between the two sets, and compares this to what is obtained from the familiar binomial distribution. It is shown that the binomial solution is accurate to the order of 1/M 2 , which is expected to be adequate for practical purposes. Applied Mathematics Probability random sets ancestor probabilities Full Text Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-8822184","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":587728495,"identity":"af6af12e-1692-4144-abf3-bbd1927a899a","order_by":0,"name":"Paul F. Easthope","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA3klEQVRIiWNgGAWjYLACxgYGBjYG5gNgBnHgIFgLWwKJWhgYeAyI02LO3p34+eOOusQ+/jPfJH7usJFjYD98dAM+LZY9ZzdLHDxzOLGN4ew2yd4zacYMPGlpN/BpMbiRu0HiYNuB3DbG3m0SvG2HExskeMzwa7n/dvOPg211uW3MPM8k/xKl5QbvNqAtzLltbDxs0kTZYtmTu83ibNvh+jYeNmNr2bY0YzZCfjFnP7v5RmVbnbF8/+GHN9+22cjxsx8+ht9hSGwWCRDJhk85uhbmD4RUj4JRMApGwcgEAAIzT4WjEXC7AAAAAElFTkSuQmCC","orcid":"https://orcid.org/0000-0003-1174-8148","institution":"","correspondingAuthor":true,"prefix":"","firstName":"Paul","middleName":"F.","lastName":"Easthope","suffix":""}],"badges":[],"createdAt":"2026-02-08 14:18:51","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-8822184/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8822184/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":102298014,"identity":"8611ef54-ef97-42c8-a12d-610e9b4e84ad","added_by":"auto","created_at":"2026-02-10 10:30:08","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":292441,"visible":true,"origin":"","legend":"","description":"","filename":"probabilitynonintersectionrandomsets.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8822184/v1_covered_539e3469-997e-4b2c-ab1b-863f8c840926.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eThe Probability of Non-Intersection of Two Equi-Size Random Sets\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Probability, random sets, ancestor probabilities","lastPublishedDoi":"10.21203/rs.3.rs-8822184/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8822184/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eConsider two sets of equal length \u003cem\u003e\u003cstrong\u003ek\u003c/strong\u003e\u003c/em\u003e, each element of which is sampled from a uniformly-distributed set of integers in the range \u003cstrong\u003e[1, M] \u003c/strong\u003ewith \u003cstrong\u003e2\u003c/strong\u003e\u003cem\u003e\u003cstrong\u003ek\u003c/strong\u003e\u003c/em\u003e\u003cstrong\u003e ≤ \u003c/strong\u003e\u003cem\u003e\u003cstrong\u003eM\u003c/strong\u003e\u003c/em\u003e. This paper derives an exact expression for the probability that there will be no ele- ments in common between the two sets, and compares this to what is obtained from the familiar binomial distribution. It is shown that the binomial solution is accurate to the order of \u003cem\u003e1/M\u003c/em\u003e\u003csup\u003e\u003cem\u003e2\u003c/em\u003e\u003c/sup\u003e, which is expected to be adequate for practical purposes.\u003c/p\u003e","manuscriptTitle":"The Probability of Non-Intersection of Two Equi-Size Random Sets","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-02-10 09:37:34","doi":"10.21203/rs.3.rs-8822184/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"e9f9dc47-29d8-4326-932f-883bc0aff86a","owner":[],"postedDate":"February 10th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":62530072,"name":"Applied Mathematics"}],"tags":[],"updatedAt":"2026-02-10T09:37:34+00:00","versionOfRecord":[],"versionCreatedAt":"2026-02-10 09:37:34","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8822184","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8822184","identity":"rs-8822184","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-27T02:00:06.600101+00:00
License: CC-BY-4.0