Some exactly solvable models of urn process theory

We establish a fundamental isomorphism between discrete-time balanced urn processes and certain ordinary differential systems, which are nonlinear, autonomous, and of a simple monomial form. As a consequence, all balanced urn processes with balls of two colours are proved to be analytically solvable...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Philippe Flajolet, Philippe Dumas, Vincent Puyhaubert
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	Discrete Mathematics & Theoretical Computer Science 2006-01-01
סדרה:	Discrete Mathematics & Theoretical Computer Science
נושאים:	urn process [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co]
גישה מקוונת:	https://dmtcs.episciences.org/3506/pdf
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!