An almost-bijective proof of an asymptotic property of partitions
By Alois Panholzer, Helmut Prodinger. 2007
80 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/12899bc2cdba1a4dae0c796e049cc5d3b75be0c2
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Remco van der Hofstad
- Jeffrey G. Andrews
- Svante Janson
- Martin Haenggi
- Cecilia Holmgren
- Massimo Franceschetti
- Sourav Chatterjee
- L. Lov'asz
In Computer Networks and Communications
- Jeffrey G. Andrews
- Martin Haenggi
- François Baccelli
- Massimo Franceschetti
- Olivier Dousse
- Tony Q. S. Quek
- Svante Janson
- Remco van der Hofstad
Citations in the corpus
- Random Graphs and Complex Networks (2016, background): “In [222], random trees with possibly non-linear preferential attachment are studied by relating them to continuous-time branching processes and using properties of such branching processes.”
- Stochastic geometry and random graphs for the analysis and design of wireless networks (2009, result): “the average degree of the corresponding random graph at the percolation threshold tends to 1. Alternative proofs of these spreading results also appear in [ 68 ], [69].”
- Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees (2016, background): “(Such trees are called very simple increasing trees in [89], [110].”