#### Filter Results:

#### Publication Year

2012

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Philippe Rigollet, Mark Cerenzia, Youssef El Moujahid, Georgina Hall, Jan-Christian Hütter, Gautam Kamath +8 others
- 2015

Preface These lecture notes were written for the course 18.S997: High Dimensional Statistics at MIT. They build on a set of notes that was prepared at Princeton University in 2013-14. Over the past decade, statistics have undergone drastic changes with the development of high-dimensional statistical inference. Indeed, on each individual , more and more… (More)

A binary vertex coloring (labeling) f : V (G) → Z 2 of a graph G is said to be friendly if the number of vertices labeled 0 is almost the same as the number of vertices labeled 1. This friendly labeling induces an edge labeling f * : E(G) → Z 2 defined by f * (uv) = f (u)f (v) for all uv ∈ E(G). Let e f (i) = |{uv ∈ E(G) : f * (uv) = i}| be the number of… (More)

- ‹
- 1
- ›