activity
20042020
most citedPreservation of log-concavity on summation

36 citations · 111 across the 20 of their papers we have counts for

collaborators

22 papers

math.PR2020★ 2 cited

The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees

Guillaume Conchon--Kerjan, Christina Goldschmidt

We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent , where $α…

math.PR2019★ 3 cited

Parking On A Random Rooted Plane Tree

Qizhao Chen, Christina Goldschmidt

In this paper, we investigate a parking process on a uniform random rooted plane tree with vertices. Every vertex of the tree has a parking space for a single car. Cars arrive…

math.PR2019★ 2 cited

The scaling limit of a critical random directed graph

Christina Goldschmidt, Robin Stephenson

We consider the random directed graph with vertex set in which each of the possible directed edges is present independently with probabil…

math.CO2019★ 1 cited

Moderate deviations of subgraph counts in the Erdős-Rényi random graphs and

Christina Goldschmidt, Simon Griffiths, Alex Scott

The main contribution of this article is an asymptotic expression for the rate associated with moderate deviations of subgraph counts in the Erdős-Rényi random graph . Our…

math.PR2018★ 1 cited

Stable graphs: distributions and line-breaking construction

Christina Goldschmidt, Bénédicte Haas, Delphin Sénizergues

For , the -stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given -dependent power-law tail behavior. It…

math.PR2017★ 2 cited

The spread of fire on a random multigraph

Christina Goldschmidt, Eleonora Kreačić

We study a model for the destruction of a random network by fire. Suppose that we are given a multigraph of minimum degree at least 2 having real-valued edge-lengths. We pick a uni…