I am aiming to write a short post about each lecture in my ongoing course on *Random Graphs*. Details and logistics for the course can be found here.

As we enter the final stages of the semester, I want to discuss some extensions to the standard Erdos-Renyi random graph which has been the focus of most of the course so far. In doing so, we can revisit material that we have already covered, and discover how easily one can extend this directly to more exotic settings.

The focus of this lecture was the model of inhomogeneous random graphs (IRGs) introduced by Soderberg [Sod02] and first studied rigorously by Bollobas, Janson and Riordan [BJR07]. Soderberg and this blog post address the case where vertices have a type drawn from a finite set. BJR address the setting with more general typespaces, in particular a continuum of types. This generalisation is essential if one wants to use IRGs to model effects more sophisticated than those of the classical Erdos-Renyi model G(n,c/n), but most of the methodology is present in the finite-type setting, and avoids the operator theory language which is perhaps intimidating for a first-time reader.

**Inhomogeneous random graphs**

Throughout, is fixed. A *graph with k types* is a graph G=(V,E) together with a *type function* . We will refer to a symmetric matrix with non-negative entries as a *kernel*.

Given and a vector satisfying , and a kernel, we define the inhomogeneous random graph with k types as:

- the vertex set is [n],
- types are assigned uniformly at random to the vertices such that exactly vertices have type i.
- Conditional on these types, each edge (for ) is present, independently, with probability

*Notes on the definition:*

- Alternatively, we could assign the types so that vertices have type 1, have type 2, etc etc. This makes no difference except in terms of the notation we have to use if we want to use exchangeability arguments later.
- An alternative model considers some distribution on [k], and assigns the types of the vertices of [n] in an IID fashion according to . Essentially all the same results hold for these two models. (For example, this model with ‘random types’ can be studied by quenching the number of each type!) Often one works with whichever model seems easier for a given proof.
- Note that the edge probability given is . The exponential form has a more natural interpretation if we ever need to turn the IRGs into a process. Additionally, it avoids the requirement to treat small values of n (for which, a priori, might be greater than 1) separately.

In the above example, one can see that, roughly speaking, red vertices are more likely to be connected to each other than blue vertices. However, for both colours, they are more likely to be connected to a given vertex of the same colour than a vertex of the opposite colour. This might, for example, correspond to the kernel .

The definition given above corresponds to a *sparse* setting, where the typical vertex degrees are . Obviously, one can set up an inhomogeneous random graph in a dense regime by an identical argument.

From an applications point of view, it’s not hard to imagine that an IRG of some flavour might be a good model for many phenomena observed in reality, especially when a mean-field assumption is somewhat appropriate. The friendships of boys and girls in primary school seems a particularly resonant example, though doubtless there are many others.

One particular application is to recover the types of the vertices from the topology of the graph. That is, if you see the above picture without the colours, can you work out which vertices are red, and which are blue? (Assuming you know the kernel.) This is clearly impossible to do with anything like certainty in the sparse setting – how does one decide about isolated vertices, for example? The probabilities that a red vertex is isolated and that a blue vertex is isolated differ by a constant factor in the limit. But in the dense setting, one can achieve this with high confidence. When studying such statistical questions, these IRGs are often referred to as *stochastic block models*, and the recent survey of Abbe [Abbe] gives a very rich history of this type of problem in this setting.

**Poisson multitype branching processes**

As in the case of the classical random graph G(n,c/n), we learn a lot about the IRG by studying its local structure. Let’s assume from now on that we are given a sequence of IRGs for which , where satisfies .

Now, let be a uniformly-chosen vertex in [n]. Clearly , with the immediate mild notation abuse of viewing as a probability distribution on [k].

Then, conditional on :

- when , the number of type j neighbours of is distributed as .
- the number of type i neighbours of is distributed as .

Note that , and similarly in the case j=i, so in both cases, the number of neighbours of type j is distributed approximately as .

This motivates the following definition of a branching process tree, whose vertices have k types. Given as before, and a kernel, we define , a random tree with k types as follows:

- Declare the root to have type i with probability ;
- Then, inductively, a vertex with type i has some number of children of type j, distributed as , independently across types , and other parent vertices.

(It would be safer to define this formally as a subset of the Ulam-Harris tree endowed with a type function, or even as k coupled copies of , but for the purposes of this exposition, hopefully this is clear enough.)

(It may be helpful to think of the branching mechanism as a Poisson random measure on the type space. This definition then immediately generalises to the case where type-space is continuous.)

**Claim: ** converges in probability in the local weak sense to .

*Note: *in Lecture 6, we set up the notation of local weak convergence in considerable detail. It’s important to stress that this was established for *graphs*, not for *graphs with k types*. That said, the extension of the definition is immediate if one extends the definition of graph isomorphism to include a correct matching of types. However, rather more care is required if one is to extend the definition to the case of a continuum of types, for which one must handle the situation where two graphs with types are close if they are isomorphic as graphs, and all the types of pairs of vertices matched by the isomorphism are close. See [vdHRGCN2, Section 1.2] or our recent pre-print [CRY18] for considerably more detail.

**Survival probabilities, Perron-Frobenius theorem**

Recall that for G(n,c/n), we have a phase transition around the critical value c=1, with major qualitative changes in the properties of the graph, in particular the emergence of a unique giant component occupying a positive proportion of the vertices for c>1. The goal for the rest of the lecture is to characterise whether a sequence of sparse IRGs exhibits sub/supercritical behaviour, in terms of .

First, we recall a classical result about positive matrices, which may be unfamiliar to anyone approaching this random graphs course without a full mathematical background in linear algebra.

**Theorem (Perron – 1907): **Let be a strictly positive k x k matrix. Then such that is a *simple* eigenvalue of A, and all other eigenvalues satisfy . We call the *principal eigenvalue* or *Perron root* of A. Furthermore, the left-eigenvector (or right-eigenvector) corresponding to may be normalised such that all its components are strictly positive.

**Proof: **One can use Brouwer’s fixed point theorem, among many other methods.

*Note:* This is relevant to the existence of equilibrium distributions for (finite) Markov chains. (Though there are easier arguments to demonstrate this existence.) A very old post on this blog gives a rather obscure proof using linear programming in this special case of stochastic matrices.

**Frobenius (1912 etc):** gives further results in the case of non-negative matrices. For the purposes of an initial study of IRGs, one can assume that all relevant results hold so long as the kernel is *irreducible*. This can be characterised by the existence of some m for which has all entries strictly positive. In the graph setting, this says that there could exist paths between all pairs of types.

The punchline is that, as in the homogeneous setting of G(n,c/n), the presence of a giant component in the random graph, and the survival of the corresponding branching process, are essentially the same problem. We won’t explore the connection between these in detail during this course (not least because this is a single lecture), but this motivates focusing on the following theorem. Firstly, since it will be relevant repeatedly, this post borrows the following notation from [Yeo18]: let be the matrix which gives the expected offspring counts in .

**Theorem: **

*Notes*: The content of this theorem is first proved in Section 5 of [BJR07] in, as discussed earlier, the setting of more general type-spaces.

In other words, the principal eigenvalue of plays the same role as c in G(n,c/n) in determining criticality. I think this is a genuinely cool result, and will outline a proof now.

**Proof: **We start with the subcritical and critical settings , for which we have to show that is almost surely finite.

It’s useful to study the survival probability conditional on the type of the root, with a view to finding some sort of recursion, just as in the original monotype setting. (Throughout this argument, we suppress the notational dependence on except when necessary for clarity.) We set

Then the vector must satisfy

(*)

since the tree survives if, and only if, the root has at least one child (of any type) for which the subtree rooted there survives.

Linearising the RHS, we obtain

and this inequality is strict in at least one coordinate if . In fact, if is irreducible and , one can then show that the inequality is strict in all coordinates if . Intuitively, this doesn’t feel possible for a matrix whose ‘largest’ eigenvalue is at most 1, but it’s hard to turn this into an argument using eg a basis of eigenvectors. However, this does contradict the Collatz-Wielandt characterisation of the Perron root (see here) and so we conclude that there are no non-zero solutions to (*), and thus the survival probability is zero in subcriticality and criticality.

(As demanded in the main exercise for this lecture, one can show directly that in the subcritical setting when that , which certainly also implies the result.)

*Supercritical case* .

For this, we will show that the equation (*) has a strictly positive solution. It’s not a priori clear that the survival probabilities should correspond to the maximal solution. I will omit this here because, modulo a change of notation, it’s covered very clearly in Lemma 5.6 of [BJR07], and is intuitively motivated by the corresponding result in the monotype case.

Motivated by (*), introduce the function by

so that (*) becomes . Note that f is *increasing*, in the sense that

Now, let be some right-eigenvector of corresponding to the principal eigenvalue , normalised to have positive components. We will study as .

and so for small enough, we have

So, writing , , we have . By compactness, we must have with . Since f is continuous, we may take a limit on both sides of the equality , to obtain , and thus we have found a strictly positive solution to (*), as required.

**References**

[Abbe] – Community detection and stochastic block models

[BJR07] – Bollobas, Janson, Riordan – 2007 – The phase transition in inhomogeneous random graphs

[CRY18] – Crane, Rath, Yeo – 2018+ – Age evolution in the mean field forest fire model via multitype branching process

[Sod02] – Soderberg – 2002 – General formalism for inhomogeneous random graphs

[vdHRGCN2] – van der Hofstad – Random graphs and complex networks, Volume II

[Yeo18] – Yeo – 2018+ – Frozen percolation with k types