The large deviation principle for inhomogeneous Erdős-Rényi random graphs

From MaRDI portal
(Redirected from Publication:6161583)



Abstract: Consider the inhomogeneous ErdH{o}s-R'enyi random graph (ERRG) on n vertices for which each pair i,jin1,ldots,n, ieqj is connected independently by an edge with probability rn(fraci−1n,fracj−1n), where (rn)ninmathbbN is a sequence of graphons converging to a reference graphon r. As a generalization of the celebrated LDP for ERRGs by Chatterjee and Varadhan (2010), Dhara and Sen (2019) proved a large deviation principle (LDP) for a sequence of such graphs under the assumption that r is bounded away from 0 and 1, and with a rate function in the form of a lower semi-continuous envelope. We further extend the results by Dhara and Sen. We relax the conditions on the reference graphon to logr,log(1−r)inL1([0,1]2). We also show that, under this condition, their rate function equals a different, more tractable rate function. We then apply these results to the large deviation principle for the largest eigenvalue of inhomogeneous ERRGs and weaken the conditions for part of the analysis of the rate function by Chakrabarty, Hazra, Den Hollander and Sfragara (2020).












This page was built for publication: The large deviation principle for inhomogeneous Erdős-Rényi random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161583)