Pseudorandom graph

In graph theory, a graph is said to be a pseudorandom graph if it obeys certain properties that random graphs obey with high probability. There is no concrete definition of graph pseudorandomness, but there are many reasonable characterizations of pseudorandomness one can consider.

Pseudorandom properties were first formally considered by Andrew Thomason in 1987.^[1][2] He defined a condition called "jumbledness": a graph ${\displaystyle G=(V,E)}$ is said to be ${\displaystyle (p,\alpha )}$-jumbled for real ${\displaystyle p}$ and ${\displaystyle \alpha }$ with ${\displaystyle 0<p<1\leq \alpha }$ if

${\displaystyle \left|e(U)-p{\binom {|U|}{2}}\right|\leq \alpha |U|}$

for every subset ${\displaystyle U}$ of the vertex set ${\displaystyle V}$, where ${\displaystyle e(U)}$ is the number of edges among ${\displaystyle U}$ (equivalently, the number of edges in the subgraph induced by the vertex set ${\displaystyle U}$). It can be shown that the Erdős–Rényi random graph ${\displaystyle G(n,p)}$ is almost surely ${\displaystyle (p,O({\sqrt {np}}))}$-jumbled.^[2]: 6 However, graphs with less uniformly distributed edges, for example a graph on ${\displaystyle 2n}$ vertices consisting of an ${\displaystyle n}$-vertex complete graph and ${\displaystyle n}$ completely independent vertices, are not ${\displaystyle (p,\alpha )}$-jumbled for any small ${\displaystyle \alpha }$, making jumbledness a reasonable quantifier for "random-like" properties of a graph's edge distribution.

Connection to local conditions[edit]

Thomason showed that the "jumbled" condition is implied by a simpler-to-check condition, only depending on the codegree of two vertices and not every subset of the vertex set of the graph. Letting ${\displaystyle \operatorname {codeg} (u,v)}$ be the number of common neighbors of two vertices ${\displaystyle u}$ and ${\displaystyle v}$, Thomason showed that, given a graph ${\displaystyle G}$ on ${\displaystyle n}$ vertices with minimum degree ${\displaystyle np}$, if ${\displaystyle \operatorname {codeg} (u,v)\leq np^{2}+\ell }$ for every ${\displaystyle u}$ and ${\displaystyle v}$, then ${\displaystyle G}$ is ${\displaystyle \left(p,{\sqrt {(p+\ell )n}}\,\right)}$-jumbled.^[2]: 7 This result shows how to check the jumbledness condition algorithmically in polynomial time in the number of vertices, and can be used to show pseudorandomness of specific graphs.^[2]: 7

Chung–Graham–Wilson theorem[edit]

In the spirit of the conditions considered by Thomason and their alternately global and local nature, several weaker conditions were considered by Chung, Graham, and Wilson in 1989:^[3] a graph ${\displaystyle G}$ on ${\displaystyle n}$ vertices with edge density ${\displaystyle p}$ and some ${\displaystyle \varepsilon >0}$ can satisfy each of these conditions if

• Discrepancy: for any subsets ${\displaystyle X,Y}$ of the vertex set ${\displaystyle V=V(G)}$, the number of edges between ${\displaystyle X}$ and ${\displaystyle Y}$ is within ${\displaystyle \varepsilon n^{2}}$ of ${\displaystyle p|X||Y|}$.
• Discrepancy on individual sets: for any subset ${\displaystyle X}$ of ${\displaystyle V}$, the number of edges among ${\displaystyle X}$ is within ${\displaystyle \varepsilon n^{2}}$ of ${\displaystyle p{\binom {|X|}{2}}}$.
• Subgraph counting: for every graph ${\displaystyle H}$, the number of labeled copies of ${\displaystyle H}$ among the subgraphs of ${\displaystyle G}$ is within ${\displaystyle \varepsilon n^{v(H)}}$ of ${\displaystyle p^{e(H)}n^{v(H)}}$.
• 4-cycle counting: the number of labeled ${\displaystyle 4}$-cycles among the subgraphs of ${\displaystyle G}$ is within ${\displaystyle \varepsilon n^{4}}$ of ${\displaystyle p^{4}n^{4}}$.
• Codegree: letting ${\displaystyle \operatorname {codeg} (u,v)}$ be the number of common neighbors of two vertices ${\displaystyle u}$ and ${\displaystyle v}$,

${\displaystyle \sum _{u,v\in V}{\big |}\operatorname {codeg} (u,v)-p^{2}n{\big |}\leq \varepsilon n^{3}.}$

• Eigenvalue bounding: If ${\displaystyle \lambda _{1}\geq \lambda _{2}\geq \cdots \geq \lambda _{n}}$ are the eigenvalues of the adjacency matrix of ${\displaystyle G}$, then ${\displaystyle \lambda _{1}}$ is within ${\displaystyle \varepsilon n}$ of ${\displaystyle pn}$ and ${\displaystyle \max \left(\left|\lambda _{2}\right|,\left|\lambda _{n}\right|\right)\leq \varepsilon n}$.

These conditions may all be stated in terms of a sequence of graphs ${\displaystyle \{G_{n}\}}$ where ${\displaystyle G_{n}}$ is on ${\displaystyle n}$ vertices with ${\displaystyle (p+o(1)){\binom {n}{2}}}$ edges. For example, the 4-cycle counting condition becomes that the number of copies of any graph ${\displaystyle H}$ in ${\displaystyle G_{n}}$ is ${\displaystyle \left(p^{e(H)}+o(1)\right)e^{v(H)}}$ as ${\displaystyle n\to \infty }$, and the discrepancy condition becomes that ${\displaystyle \left|e(X,Y)-p|X||Y|\right|=o(n^{2})}$, using little-o notation.

A pivotal result about graph pseudorandomness is the Chung–Graham–Wilson theorem, which states that many of the above conditions are equivalent, up to polynomial changes in ${\displaystyle \varepsilon }$^[3]. A sequence of graphs which satisfies those conditions is called quasi-random. It is considered particularly surprising^[2]: 9 that the weak condition of having the "correct" 4-cycle density implies the other seemingly much stronger pseudorandomness conditions. Graphs such as the 4-cycle, the density of which in a sequence of graphs is sufficient to test the quasi-randomness of the sequence, are known as forcing graphs.

Some implications in the Chung–Graham–Wilson theorem are clear by the definitions of the conditions: the discrepancy on individual sets condition is simply the special case of the discrepancy condition for ${\displaystyle Y=X}$, and 4-cycle counting is a special case of subgraph counting. In addition, the graph counting lemma, a straightforward generalization of the triangle counting lemma, implies that the discrepancy condition implies subgraph counting.

The fact that 4-cycle counting implies the codegree condition can be proven by a technique similar to the second-moment method. Firstly, the sum of codegrees can be upper-bounded:

${\displaystyle \sum _{u,v\in G}\operatorname {codeg} (u,v)=\sum _{x\in G}\deg(x)^{2}\geq n\left({\frac {2e(G)}{n}}\right)^{2}=\left(p^{2}+o(1)\right)n^{3}.}$

Given 4-cycles, the sum of squares of codegrees is bounded:

${\displaystyle \sum _{u,v}\operatorname {codeg} (u,v)^{2}={\text{Number of labeled copies of }}C_{4}+o(n^{4})\leq \left(p^{4}+o(1)\right)n^{4}.}$

Therefore, the Cauchy–Schwarz inequality gives

${\displaystyle \sum _{u,v\in G}|\operatorname {codeg} (u,v)-p^{2}n|\leq n\left(\sum _{u,v\in G}\left(\operatorname {codeg} (u,v)-p^{2}n\right)^{2}\right)^{1/2},}$

which can be expanded out using our bounds on the first and second moments of ${\displaystyle \operatorname {codeg} }$ to give the desired bound. A proof that the codegree condition implies the discrepancy condition can be done by a similar, albeit trickier, computation involving the Cauchy–Schwarz inequality.

The eigenvalue condition and the 4-cycle condition can be related by noting that the number of labeled 4-cycles in ${\displaystyle G}$ is, up to ${\displaystyle o(1)}$ stemming from degenerate 4-cycles, ${\displaystyle \operatorname {tr} \left(A_{G}^{4}\right)}$, where ${\displaystyle A_{G}}$ is the adjacency matrix of ${\displaystyle G}$. The two conditions can then be shown to be equivalent by invocation of the Courant–Fischer theorem.^[3]

Connections to graph regularity[edit]

The concept of graphs that act like random graphs connects strongly to the concept of graph regularity used in the Szemerédi regularity lemma. For ${\displaystyle \varepsilon >0}$, a pair of vertex sets ${\displaystyle X,Y}$ is called ${\displaystyle \varepsilon }$-regular, if for all subsets ${\displaystyle A\subset X,B\subset Y}$ satisfying ${\displaystyle |A|\geq \varepsilon |X|,|B|\geq \varepsilon |Y|}$, it holds that

${\displaystyle \left|d(X,Y)-d(A,B)\right|\leq \varepsilon ,}$

where ${\displaystyle d(X,Y)}$ denotes the edge density between ${\displaystyle X}$ and ${\displaystyle Y}$: the number of edges between ${\displaystyle X}$ and ${\displaystyle Y}$ divided by ${\displaystyle |X||Y|}$. This condition implies a bipartite analogue of the discrepancy condition, and essentially states that the edges between ${\displaystyle A}$ and ${\displaystyle B}$ behave in a "random-like" fashion. In addition, it was shown by Miklós Simonovits and Vera T. Sós in 1991 that a graph satisfies the above weak pseudorandomness conditions used in the Chung–Graham–Wilson theorem if and only if it possesses a Szemerédi partition where nearly all densities are close to the edge density of the whole graph.^[4]

Sparse pseudorandomness[edit]

Chung–Graham–Wilson theorem analogues[edit]

The Chung–Graham–Wilson theorem, specifically the implication of subgraph counting from discrepancy, does not follow for sequences of graphs with edge density approaching ${\displaystyle 0}$, or, for example, the common case of ${\displaystyle d}$-regular graphs on ${\displaystyle n}$ vertices as ${\displaystyle n\to \infty }$. The following sparse analogues of the discrepancy and eigenvalue bounding conditions are commonly considered:

• Sparse discrepancy: for any subsets ${\displaystyle X,Y}$ of the vertex set ${\displaystyle V=V(G)}$, the number of edges between ${\displaystyle X}$ and ${\displaystyle Y}$ is within ${\displaystyle \varepsilon dn}$ of ${\displaystyle {\frac {d}{n}}|X||Y|}$.
• Sparse eigenvalue bounding: If ${\displaystyle \lambda _{1}\geq \lambda _{2}\geq \cdots \geq \lambda _{n}}$ are the eigenvalues of the adjacency matrix of ${\displaystyle G}$, then ${\displaystyle \max \left(\left|\lambda _{2}\right|,\left|\lambda _{n}\right|\right)\leq \varepsilon d}$.

It is generally true that this eigenvalue condition implies the corresponding discrepancy condition, but the reverse is not true: the disjoint union of a random large ${\displaystyle d}$-regular graph and a ${\displaystyle d+1}$-vertex complete graph has two eigenvalues of exactly ${\displaystyle d}$ but is likely to satisfy the discrepancy property. However, as proven by David Conlon and Yufei Zhao in 2017, slight variants of the discrepancy and eigenvalue conditions for ${\displaystyle d}$-regular Cayley graphs are equivalent up to linear scaling in ${\displaystyle \varepsilon }$.^[5] One direction of this follows from the expander mixing lemma, while the other requires the assumption that the graph is a Cayley graph and uses the Grothendieck inequality.

Consequences of eigenvalue bounding[edit]

A ${\displaystyle d}$-regular graph ${\displaystyle G}$ on ${\displaystyle n}$ vertices is called an ${\displaystyle (n,d,\lambda )}$-graph if, letting the eigenvalues of the adjacency matrix of ${\displaystyle G}$ be ${\displaystyle d=\lambda _{1}\geq \lambda _{2}\geq \cdots \geq \lambda _{n}}$, ${\displaystyle \max \left(\left|\lambda _{2}\right|,\left|\lambda _{n}\right|\right)\leq \lambda }$. The Alon-Boppana bound gives that ${\displaystyle \max \left(\left|\lambda _{2}\right|,\left|\lambda _{n}\right|\right)\geq 2{\sqrt {d-1}}-o(1)}$ (where the ${\displaystyle o(1)}$ term is as ${\displaystyle n\to \infty }$), and Joel Friedman proved that a random ${\displaystyle d}$-regular graph on ${\displaystyle n}$ vertices is ${\displaystyle (n,d,\lambda )}$ for ${\displaystyle \lambda =2{\sqrt {d-1}}+o(1)}$.^[6] In this sense, how much ${\displaystyle \lambda }$ exceeds ${\displaystyle 2{\sqrt {d-1}}}$ is a general measure of the non-randomness of a graph. There are graphs with ${\displaystyle \lambda \leq 2{\sqrt {d-1}}}$, which are termed Ramanujan graphs. They have been studied extensively and there are a number of open problems relating to their existence and commonness.

Given an ${\displaystyle (n,d,\lambda )}$ graph for small ${\displaystyle \lambda }$, many standard graph-theoretic quantities can be bounded to near what one would expect from a random graph. In particular, the size of ${\displaystyle \lambda }$ has a direct effect on subset edge density discrepancies via the expander mixing lemma. Other examples are as follows, letting ${\displaystyle G}$ be an ${\displaystyle (n,d,\lambda )}$ graph:

• If ${\displaystyle d\leq {\frac {n}{2}}}$, the vertex-connectivity ${\displaystyle \kappa (G)}$ of ${\displaystyle G}$ satisfies ${\displaystyle \kappa (G)\geq d-{\frac {36\lambda ^{2}}{d}}.}$^[7]
• If ${\displaystyle \lambda \leq d-2}$, ${\displaystyle G}$ is ${\displaystyle d}$ edge-connected. If ${\displaystyle n}$ is even, ${\displaystyle G}$ contains a perfect matching.^[2]: 32
• The maximum cut of ${\displaystyle G}$ is at most ${\displaystyle {\frac {n(d+\lambda )}{4}}}$.^[2]: 33
• The largest independent subset of a subset ${\displaystyle U\subset V(G)}$ in ${\displaystyle G}$ is of size at least ${\displaystyle {\frac {n}{2(d-\lambda )}}\ln \left({\frac {|U|(d-\lambda )}{n(\lambda +1)}}+1\right).}$^[8]
• The chromatic number of ${\displaystyle G}$ is at most ${\displaystyle {\frac {6(d-\lambda )}{\ln \left({\frac {d+1}{\lambda +1}}\right)}}.}$^[8]

Connections to the Green–Tao theorem[edit]

Pseudorandom graphs factor prominently in the proof of the Green–Tao theorem. The theorem is proven by transferring Szemerédi's theorem, the statement that a set of positive integers with positive natural density contains arbitrarily long arithmetic progressions, to the sparse setting (as the primes have natural density ${\displaystyle 0}$ in the integers). The transference to sparse sets requires that the sets behave pseudorandomly, in the sense that corresponding graphs and hypergraphs have the correct subgraph densities for some fixed set of small (hyper)subgraphs.^[9] It is then shown that a suitable superset of the prime numbers, called pseudoprimes, in which the primes are dense obeys these pseudorandomness conditions, completing the proof.

References[edit]