1k citations
- A. Sopczak2 profiles61 · h 83
- B. Åsman9 profiles60 · h 98
- L. Mundim2 profiles58 · h 124
- M. Begalli5 profiles58 · h 68
- M. Besançon2 profiles58 · h 132
- Y. Arnoud2 profiles58 · h 42
- D. Wicke5 profiles57 · h 64
- P. Verdier2 profiles57 · h 114
- P. Jonsson5 profiles54 · h 54
- D. Schaile7 profiles49 · h 87
- A. Meyer3 profiles43 · h 142
- C. Bélanger-Champagne2 profiles43 · h 92
- Stockholm UniversitySE67 papers
- Joint Institute for Nuclear ResearchRU66 papers
- Centre National de la Recherche ScientifiqueFR65 papers
- University of WuppertalDE62 papers
- Iowa State UniversityUS61 papers
- Lund UniversitySE61 papers
- Charles UniversityCZ60 papers
- Lancaster UniversityGB60 papers
- Lyon 1 UniversitéFR59 papers
- Universidade do Estado do Rio de JaneiroBR59 papers
- Sorbonne UniversitéFR57 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ56 papers
Showing 2006 · math.PRShow all
3 papers · 2 filters
math.PR2006★ 62 cited
Asymptotic normality of the -core in random graphs
Svante Janson, Malwina J. Luczak
We study the -core of a random (multi)graph on vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used propertie…
math.PR2006★ 2 cited
The size of random fragmentation trees
S. Janson, R. Neininger
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who…
math.PR2006★ 41 cited
A functional limit theorem for the profile of search trees
Michael Drmota, Svante Janson, Ralph Neininger
We study the profile of random search trees including binary search trees and -ary search trees. Our main result is a functional limit theorem of the normalized profil…