Unified Theory: From Selective Multiset Combinatorics to Graphon Limits

Read full text Summarise with VIRAT
Authors: Tatsuya Nakano
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Project Description: This project presents a unified mathematical framework connecting discrete combinatorics, Bayesian statistics, and graph limit theory. Key Contributions: * Combinatorial Foundation: We introduce "Selective Multiset Combination," which decomposes the classical multiset coefficient $\binom{n+k-1}{k}$ based on the number of active categories. Stochastic Limits: We prove that this discrete model serves as a finite foundation for the Dirichlet and Poisson-Dirichlet distributions through continuous stars-and-bars limit theorems. Graphon Application: We extend these results to the theory of Graphons, establishing a functorial correspondence between exchangeable partitions and block graphons , and characterizing the structure of extreme graphons. This body of work provides a bridge between finite occupancy models and infinite-dimensional limit structures in modern probability and combinatorics.

Fields of Study & Subjects

Probability and Statistical Research Advanced Combinatorial Mathematics Limits and Structures in Graph Theory

Publication details

Journal / source
OSF Preprints (OSF Preprints)
Publication date
1 January 2026
Language
EN
Document type
Preprint