We propose a neural exploratory framework for variational problems over graphons, i.e., symmetric measurable functions $[0,1]^2 \to [0,1]$, that arise as limits of dense graph sequences. Such problems are central to two parts of the mathematical literature: extremal graph theory, which studies graph parameter optimisat...
Taeyoung Kim, Jineon Baek, Joonkyung Lee et al.· 1 citation
Algebraic combinatorics often seeks bijections that explain identities between distributions object by object. Encoding combinatorial objects as words lets automata theory study such a bijection as a word-to-word computation and measure its memory, input access, and control of output order. This refines existence quest...
Jineon Baek, Byung-Hak Hwang, Joonhyun La et al.· 0 citations
Let $H$ be a fixed $d$-regular graph with $d\ge2$, and let $t(H,\cdot)$ denote its homomorphism density. We study the upper-tail event $t(H,G(n,p))\ge r^{|E(H)|}$ for fixed $0<p<r<1$ in a dense Erd\H{o}s--R\'enyi random graph $G(n,p)$. Near the Lubetzky--Zhao replica-symmetric phase boundary and away from the exception...
Sang-Ho Lim, Seonghyuk Im, Taeyoung Kim et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.