Why the Rich Get Richer? On the Balancedness of Random Partition Models
Changwoo J. Lee, Huiyan Sang
Abstract
Random partition models are widely used in Bayesian methods for various clustering tasks, such as mixture models, topic models, and community detection problems. While the number of clusters induced by random partition models has been studied extensively, another important model property regarding the balancedness of partition has been largely neglected. We formulate a framework to define and theoretically study the balancedness of exchangeable random partition models, by analyzing how a model assigns probabilities to partitions with different levels of balancedness. We demonstrate that the "rich-getricher" characteristic of many existing popular random partition models is an inevitable consequence of two common assumptions: productform exchangeability and projectivity. We propose a principled way to compare the balancedness of random partition models, which gives a better understanding of what model works better and what doesn't for different applications. We also introduce the "rich-get-poorer" random partition models and illustrate their application to entity resolution tasks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7dc49a50-11c2-4db4-bdc8-4253f2eb750dCited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Element-free probability distributions and random partitionsVictor Blanchi, Hugo PaquetLICS 2024
- Thinned random measures for sparse graphs with overlapping communitiesFederica Zoe Ricci, Michele Guindani, Erik B. SudderthNeurIPS 2022 · 4 citations
- Weak Recovery, Hypothesis Testing, and Mutual Information in Stochastic Block Models and Planted Factor GraphsElchanan Mossel, Allan Sly, Youngtak SohnSTOC 2025 · 3 citations
- Rapidly Mixing Multiple-try Metropolis Algorithms for Model Selection ProblemsHyunwoong Chang, Changwoo J. Lee, Zhao Tang Luo, Huiyan Sang et al.NeurIPS 2022 · 10 citations
- Balanced Spanning Tree Distributions Have Separation FairnessHarry Chen, Kamesh Munagala, Govind S. SankarSODA 2026
