<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2011-11-22 11:29:45Mathematics Mathematical analysis Central limit theorem Regular graph Matrix Entropy Number theory Graph coloring Discriminant of an algebraic number field Differential forms on a Riemann surface |
Add to Reading List |
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexander Barvinok and J.A. Hartigan November 2011 Abstract. We consider the set of all graphs on n labeled vertices with prescribed![Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Cheeger’s inequality Let G be a d-regular graph with vertex set V = [n]. For a vertex](https://www.pdfsearch.io/img/edea373abceca4238ea516e25772f0ae.jpg "Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Cheeger’s inequality Let G be a d-regular graph with vertex set V = [n]. For a vertex")
