The stable-labeling variational asymptotic conjecture

Fix an rr-graph HH with maximum degree Δ\Delta, and let ρH(δ)\rho_H(\delta) be the infimum of the volumes of compatible collections of mixed hubs that respect stable labelings and satisfy the source's condition PH(S,c)1+δP_H(\mathcal{S},c)\ge 1+\delta. Let Gn\mathcal{G}_n be the class of edge-weighted rr-graphs on [n][n], let IpI_p be the variational cost, and let t(H,Gn)t(H,G_n) be the homomorphism density.

Stable-labeling variational asymptotic conjecture. If nn\to\infty and p=p(n)p=p(n) satisfies n1/Δp1n^{-1/\Delta}\ll p\ll 1, then

min{Ip(Gn):GnGn, t(H,Gn)(1+δ)pE(H)}1r!nrpΔρH(δ)log(1/p).\min\{I_p(G_n):G_n\in\mathcal{G}_n,\ t(H,G_n)\ge (1+\delta)p^{|E(H)|}\}\sim \frac{1}{r!}n^r p^\Delta\rho_H(\delta)\log(1/p).

This is the formal asymptotic version of the preceding stable-labeling mixed-hub proposal. The supplied text does not provide a proof or resolution.

Sources & referencesView supporting material

Primary source

Yang P. Liu and Yufei Zhao, “On the upper tail problem for random hypergraphs”, arXiv:1910.02916 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.