**Problem of the Week**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

**Math Club**

You are here: Homepage » Seminars - Academic year 2023-24 » Combinatorics Seminar » Alexander Engström (Berkeley)

seminars:comb:abstract.201010eng

Statisticians model large graphs used in the social sciences by counting small subgraphs of different types. For example, let us for every graph on one thousand vertices count the number of triangles and the number of four-cycles. Then plot the dots on an integer grid with the numbers of triangles and four-cycles as the axes. The convex hull of the dots is a polytope whose geometry determines how well one can carry out a maximum likelihood estimate in a corresponding exponential random graph model.

In an ongoing project with Patrik Noren, I study polytopes of this type in larger dimensions. Since many conjectures and theorems by Erdös and coauthors can be restated as facts about particular such polytopes, a complete understanding of the facets is probably unattainable. But we can show that they kind of look like cyclic polytopes containing curvy zonotopes.

seminars/comb/abstract.201010eng.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported