On the moderate deviation principles in the sparse multi-type Erdos R\'enyi random graph

Abstract

This paper investigate the sparse multi-type Erdos R\'enyi random graphs studied in S\"oderberg~soderberg2002general and also Bollob\'as et al.~bollobas2007phase. Although the corresponding central limit results are currently unknown, we establish moderate deviation principles for the size of the largest connected component, the number of specific types of connected components, and the total number of connected components. The associated rate functions are provided explicitly. As a byproduct of this work, we present the law of large numbers for the total number of connected components. Our proof methodology relies on representing the multi-type random graph using a conditional multi-dimensional compound Poisson process. We also discuss the properties of related multi-type branching processes and the properties of the matrices in the rate functions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…