A large-deviations principle for all the components in a sparse inhomogeneous random graph

  title={A large-deviations principle for all the components in a sparse inhomogeneous random graph},
  author={Luisa Andreis and Wolfgang K{\"o}nig and H. T. Langhammer and Robert I. A. Patterson},
  journal={Probability Theory and Related Fields},
We study an inhomogeneous sparse random graph, $${\mathcal G }_N$$ G N , on $$[N]=\{1,\dots ,N\}$$ [ N ] = { 1 , ⋯ , N } as introduced in a seminal paper by Bollobás et al. (Random Struct Algorithms 31(1):3–122, 2007): vertices have a type (here in a compact metric space $${\mathcal S }$$ S ), and edges between different vertices occur randomly and independently over all vertex pairs, with a probability depending on the two vertex types. In the limit $$N\rightarrow… 

Large deviations for marked sparse random graphs with applications to interacting diffusions

An approximation result is an approximation result that allows one to pass from graph with marks in discrete spaces to marks in general Polish spaces and prove a large deviation principle for interacting diffusions driven by gradient evolution and on top of sparse Erd¨os-R´enyi random graphs.

Upper tail behavior of the number of triangles in random graphs with constant average degree

Let N be the number of triangles in an Erdős–Rényi graph G(n, p) on n vertices with edge density p = d/n, where d > 0 is a fixed constant. It is well known that N weakly converges to the Poisson



Large deviations of empirical neighborhood distribution in sparse random graphs

A new configuration model is introduced which allows one to sample uniform random graphs with a given neighborhood distribution, provided the latter is supported on trees, and a new class of unimodular random trees are introduced, which generalizes the usual Galton Watson tree with given degree distribution to the case of neighborhoods of arbitrary finite depth.

Some large deviation results for sparse random graphs

Summary. We obtain a large deviation principle (LDP) for the relative size of the largest connected component in a random graph with small edge probability. The rate function, which is not convex in

Connectivity of inhomogeneous random graphs

The results generalize the classical result for G(n, p), when p=clogn/n and show that, under reasonably weak assumptions, the connectivity threshold of the model can be determined.

An introduction to large deviations for random graphs

This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the

The phase transition in inhomogeneous random graphs

The “classical” random graph models, in particular G(n,p), are “homogeneous,” in the sense that the degrees (for example) tend to be concentrated around a typical value. Many graphs arising in the

Eigenvalues Outside the Bulk of Inhomogeneous Erdős–Rényi Random Graphs

In this article, an inhomogeneous Erdős–Rényi random graph on {1,…,N}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb}

Critical behavior in inhomogeneous random graphs

  • R. Hofstad
  • Mathematics
    Random Struct. Algorithms
  • 2013
It is shown that when the proportion of vertices with degree at least k is bounded above by k −�+1 for some � > 4, the largest critical connected component is of order n 2/3 , where n denotes the size of the graph.

Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists

A wide-ranging survey of general kernels of the Marcus-Lushnikov model of stochastic coalescence and the underlying deterministic approximation given by the Smoluchowski coagulation equations is attempted.