Uniform High Order Factorial Moment Bounds for the Critical Erdős-Rényi Component Process
Wen Sun
Abstract
We give a finite n enumerative derivation of the local surplus marked point process form of Aldous's critical window limit for the Erdős-Rényi random graph. For pn=n-1+λn-4/3, let Ξn place an atom at the rescaled size and surplus of each component. Exact component enumeration yields the limiting factorial correlation densities and the uniform bound \[ E[(Ξn(K))q] CKq e-cKq3, q1, \] for every compact marked window K, uniformly in admissible n. The cubic order is optimal for the limiting factorial measures, and the estimate persists after summing over all surpluses on compact size intervals. It yields overcrowding and local exponential moment bounds, quantitative truncation of the finite n Laplace functional expansion, and local point process convergence. Using the Janson-Spencer Palm description and a classical all excess estimate, we also recover ordered 2 component size convergence.
Create a lesson
Related papers
On Solutions to Graphon McKean-Vlasov SDEs of Nemytskii-type
Sebastian Grube, Guodong Pang, Michael Röckner
Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics
Seonwoo Kim, Sanha Lee, Insuk Seo
On the telegrapher's signals of sticky local times
F. Colantoni, M. D'Ovidio
p-roughness of paths and invariance of p-th variation
Rama Cont
Exponential convergence of Sinkhorn algorithm for entropy martingale optimal transport
Anna Kazeykina, Zhenjie Ren, Hecheng Wang
Delocalisation and scaling limit for the disordered long-range Discrete Gaussian Chain
Christopher Chalhoub, Paul Dario, Corentin Faipeur et al.