Seuraa
Christina Goldschmidt
Christina Goldschmidt
Professor of Probability
Vahvistettu sähköpostiosoite verkkotunnuksessa stats.ox.ac.uk - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
The continuum limit of critical random graphs
L Addario-Berry, N Broutin, C Goldschmidt
Probability Theory and Related Fields 152 (3), 367-406, 2012
1632012
The scaling limit of the minimum spanning tree of the complete graph
L Addario-Berry, N Broutin, C Goldschmidt, G Miermont
1122017
Random recursive trees and the Bolthausen-Sznitman coalesent
C Goldschmidt, J Martin
1122005
Critical random graphs: limiting constructions and distributional properties
L Addario-Berry, N Broutin, C Goldschmidt
712010
Quantum Heisenberg models and their probabilistic representations
C Goldschmidt, D Ueltschi, P Windridge
Entropy and the quantum II, Contemp. Math 552, 177-224, 2011
622011
Asymptotics of the allele frequency spectrum associated with the Bolthausen-Sznitman coalescent
AL Basdevant, C Goldschmidt
442008
A line-breaking construction of the stable trees
C Goldschmidt, B Haas
422015
Coagulation-Fragmentation Duality, Poisson: Dirichlet Distributions and Random Recursive Trees
R Dong, C Goldschmidt, JB Martin
The Annals of Applied Probability, 1733-1750, 2006
422006
Preservation of log-concavity on summation
O Johnson, C Goldschmidt
ESAIM: Probability and Statistics 10, 206-215, 2006
392006
The stable graph: the metric space scaling limit of a critical random graph with iid power-law degrees
C Goldschmidt
arXiv preprint arXiv:2002.04954, 2020
33*2020
Parking on a random tree
C Goldschmidt, M Przykucki
Combinatorics, Probability and Computing 28 (1), 23-45, 2019
332019
Behavior near the extinction time in self-similar fragmentations I: The stable case
C Goldschmidt, B Haas
Annales de l'IHP Probabilités et statistiques 46 (2), 338-368, 2010
272010
Dual random fragmentation and coagulation and an application to the genealogy of Yule processes
J Bertoin, C Goldschmidt
Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and …, 2004
272004
Critical random hypergraphs: the emergence of a giant set of identifiable vertices
C Goldschmidt
202005
Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺 (𝑛, 𝑚) and 𝐺 (𝑛, 𝑝)
C Goldschmidt, S Griffiths, A Scott
Transactions of the American Mathematical Society 373 (8), 5517-5585, 2020
172020
The Brownian continuum random tree as the unique solution to a fixed point equation
M Albenque, C Goldschmidt
172015
The scaling limit of a critical random directed graph
C Goldschmidt, R Stephenson
arXiv preprint arXiv:1905.05397, 2019
162019
Stable graphs: distributions and line-breaking construction
C Goldschmidt, B Haas, D Sénizergues
arXiv preprint arXiv:1811.06940, 2018
162018
Voronoi tessellations in the CRT and continuum random maps of finite excess
L Addario-Berry, O Angel, G Chapuy, É Fusy, C Goldschmidt
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
152018
Parking on a random rooted plane tree
Q Chen, C Goldschmidt
112021
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20