AN ELEMENTARY APPROACH TO COMPONENT SIZES IN CRITICAL RANDOM GRAPHS

Umberto de Ambroggio

Research output: Contribution to journalArticlepeer-review

Abstract

In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our method to a model of a random intersection graph, a random graph obtained through p-bond percolation on a general d-regular graph, and a model of an inhomogeneous random graph.

Original languageEnglish
Pages (from-to)1228-1242
Number of pages15
JournalJournal of Applied Probability
Volume59
Issue number4
Early online date11 Nov 2022
DOIs
Publication statusPublished - 24 Dec 2022

Keywords

  • ballot theorem
  • Random walk

ASJC Scopus subject areas

  • Statistics and Probability
  • Mathematics(all)
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'AN ELEMENTARY APPROACH TO COMPONENT SIZES IN CRITICAL RANDOM GRAPHS'. Together they form a unique fingerprint.

Cite this