Some exactly solvable models of urn process theory
By Philippe Flajolet, Philippe Dumas, Vincent Puyhaubert. 2006
145 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/943b94b77473ebab60cc7879b21dd52e4dff3a2d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Philippe Flajolet
- Svante Janson
- Robert Sedgewick
- Robin Pemantle
- R. Stephenson
- Sourav Chatterjee
- Remco van der Hofstad
- Konstantinos Panagiotou
Citations in the corpus
- Some families of increasing planar maps (2007, unknown): “[20, p.94] (to use their results, take a 0 = 3, b 0 = 2 j − 2, σ = 2, α = 1 and replace n by n − j ).”
- Analytic Combinatorics (2009, methodology): “The system can be solved by a sequence of manipulations (this is general [225]): starting with X′′ = 2Y Y′ = 2 √ X′X2, implying X′′ √ X′ = 2X′X2,”
- Moments of Gamma type and the Brownian supremum process area (2010, methodology): “It is shown that the integral of the supremum process of Brownian motion has moments of this type, as well as a related random variable occuring in the study of hashing with linear displacement, and the general results are applied to these variables.”