317 research outputs found
Subgraph densities in signed graphons and the local Sidorenko conjecture
We prove inequalities between the densities of various bipartite subgraphs in
signed graphs and graphons. One of the main inequalities is that the density of
any bipartite graph with girth r cannot exceed the density of the r-cycle. This
study is motivated by Sidorenko's conjecture, which states that the density of
a bipartite graph F with m edges in any graph G is at least the m-th power of
the edge density of G. Another way of stating this is that the graph G with
given edge density minimizing the number of copies of F is, asymptotically, a
random graph. We prove that this is true locally, i.e., for graphs G that are
"close" to a random graph.Comment: 20 page
The automorphism group of a graphon
We study the automorphism group of graphons (graph limits). We prove that
after an appropriate "standardization" of the graphon, the automorphism group
is compact. Furthermore, we characterize the orbits of the automorphism group
on -tuples of points. Among applications we study the graph algebras defined
by finite rank graphons and the space of node-transitive graphons.Comment: 29 pages, 2 figure
- âŠ