Metraipolis › archive › dc_c67c459d388d
Chinese restaurant process — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Chinese_restaurant_process
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T20:41:13.330Z
- SHA-256 of the archived text
9b08d2d02cf91e6381caa4a66ec4243f0b56e18e16ee6185b44ce06fd4cdd06a- Stable URL of this page
https://metraipolis.com/documento/dc_c67c459d388d
How to cite
Chinese restaurant process — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Chinese_restaurant_process (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c67c459d388d (Metraipolis archive dc_c67c459d388d, sha256 9b08d2d02cf91e6381caa4a66ec4243f0b56e18e16ee6185b44ce06fd4cdd06a)
BibTeX
@misc{dcc67c459d388d,
title = {Chinese restaurant process — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Chinese_restaurant_process},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c67c459d388d; sha256 9b08d2d02cf91e6381caa4a66ec4243f0b56e18e16ee6185b44ce06fd4cdd06a},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Chinese_restaurant_process. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In probability theory, the Chinese restaurant process is a discrete-time stochastic process, analogous to seating customers at tables in a restaurant. Imagine a restaurant with an infinite number of circular tables, each with infinite capacity. Customer 1 sits at the first table. The next customer either sits at the same table as customer 1, or the next table. This continues, with each customer choosing to either sit at an occupied table with a probability proportional to the number of customers already there (i.e., they are more likely to sit at a table with many customers than few), or an unoccupied table. At time n, the n customers have been partitioned among m ≤ n tables (or blocks of the partition). The results of this process are exchangeable, meaning the order in which the customers sit does not affect the probability of the final distribution. This property greatly simplifies a number of problems in population genetics, linguistic analysis, and image recognition. The restaurant analogy first appeared in a 1985 write-up by David Aldous, where it was attributed to Jim Pitman (who additionally credits Lester Dubins). An equivalent partition process was published a year earlier by Fred Hoppe, using an "urn scheme" akin to Pólya's urn. In comparison with Hoppe's urn model, the Chinese restaurant process has the advantage that it naturally lends itself to describing random permutations via their cycle structure, in addition to describing random partitions. Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «Bayesian statistics»). Fonte: Wikipedia in inglese, voce «Chinese restaurant process» — https://en.wikipedia.org/wiki/Chinese_restaurant_process Wikidata Q4407236 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4407236 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Chinese_restaurant_process?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1373894105, consultata il 2026-10-07T19:51:23.748Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d98657454caada5ad0784bb4e346cf833b83ea42ec60f6c0d95f70d9b8fde831