Convex sets arising in a variety of applications are well-defined for every relevant
dimension. Examples include the simplex and the spectraplex that correspond, respectively …

Graph covers and the Bethe free energy (BFE) have been useful theoretical tools for
producing lower bounds on a variety of counting problems in graphical models, including …

Sidorenko's conjecture states that the number of copies of a bipartite graph H in a graph G is
asymptotically minimised when G is a quasirandom graph. A notorious example where this …

Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, ie, a
quasirandom graph minimizes the density of H among all graphs with the same edge …

A Sidorenko bigraph is one whose density in a bigraphon is minimized precisely when is
constant. Several techniques in the literature to prove the Sidorenko property consist of …

For a graph H, its homomorphism density in graphs naturally extends to the space of two-
variable symmetric functions W in L^ p L p, p ≥ e (H) p≥ e (H), denoted by t (H, W). One …

The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we
approach the cut norm topology via the weak* topology (when considering a predual of L 1 …

We prove that the accumulation points of a sequence of graphs G 1, G 2, G 3,… with respect
to the cut-distance are exactly the weak⁎ limit points of subsequences of the adjacency …

We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces
(symmetric measures on the square of a standard Borel space). More generally, we define …

Graph covers and the Bethe free energy (BFE) have been useful theoretical tools for
producing lower bounds on various counting problems in graphical models, including the …