Alphabeta Math

Random graphs and matrix concentration

Develop degree tails, trace and Gaussian estimates, and concentration; connect them to regular spectra, connectivity and synchronization thresholds with each input's model and asymptotic range.

1 · Prerequisites
2 · Logical flowchart

Arrows show item dependencies. A grouped prerequisite node points to items that use one or more of its members; their exact links are listed above.

3 · Items

Lemma

Dyck words and elementary Catalan growth

Lemma

An elementary sufficient budget for the synchronization criterion

Proposition

Chernoff bounds with the exact degree mean

Proposition

Trace powers, closed walks and independent edge moments

Theorem

Convex Lipschitz concentration with its coordinate metric

Theorem

A fixed-law Wigner spectral-edge input

Lemma

Entropy endpoint limits and the two monotone branches

Lemma

Feasible orders for labelled simple regular graphs

Lemma

Hamiltonian cycles as finite cyclic-order events

Lemma

Intersecting finitely many high-probability events