The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs

Abstract

Consider the inhomogeneous Erdős-Rényi random graph (ERRG) on n vertices for which each pair i,jin {1,ldots ,n}, ine j, is connected independently by an edge with probability r_n(frac{i-1}{n},frac{j-1}{n}), where (r_n)_{nin mathbb {N}} is a sequence of graphons converging to a reference graphonr. As a generalisation of the celebrated large deviation principle (LDP) for ERRGs by Chatterjee and Varadhan (Eur J Comb 32:1000–1017, 2011), Dhara and Sen (Large deviation for uniform graphs with given degrees, 2020. arXiv:1904.07666) proved an 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 (log r, log (1- r))in L^1([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 et al. (Large deviation principle for the maximal eigenvalue of inhomogeneous Erdoös-Rényi random graphs, 2020. arXiv:2008.08367).