The Variational Iterative Rotation Algorithm (VIRAL), a classical local algorithm, is evaluated and the resulting bounds exceed those recently obtained from the Quantum Approximate Optimization Algorithm (QAOA), and the range of girths covered from g=36 to g=66 is extended.
Abstract
Every 3-regular graph of girth at least $g$ has a cut containing at least a fraction $M_g$ of its edges, and the best rigorous bounds at large girth are $0.912\le \lim_{g\to\infty}M_g \le 0.92386$. Lower bounds on $M_g$ follow from the performance of local algorithms: on a graph of girth $g \ge 2p+2$ a depth-$p$ local algorithm sees the same tree around every edge, so its expected cut fraction on that tree bounds $M_g$ from below. We apply this strategy to the Variational Iterative Rotation Algorithm (VIRAL), a classical local algorithm, and evaluate it on the depth-$p$ tree for every even depth up to $p=32$. The resulting bounds exceed those recently obtained from the Quantum Approximate Optimization Algorithm (QAOA) for every $p\ge 4$, by $0.005$ to $0.011$, and they extend the range of girths covered from $g=36$ to $g=66$. Notably, at $g=66$ we obtain $M_{66} \ge 0.9127$ at $99.99999\%$ confidence level, which raises the asymptotic lower bound from $0.912$ to $0.9127$.
For a graph $G$ of order $n$, put $\sigma(G)=(\lambda_1(G)+\lambda_n(G))/n$. We determine the first three largest values of this invariant among nonbipartite distance-regular graphs of diameter three and odd girth at least seven. The unique maximizer is the folded $7$-cube, with value $1/32$; the unique second maximize...
Goodman proved a lower bound on triangle counts which, in graphon language, states that every graphon of edge density $p$ has triangle density at least $2p^2-p$. Bennett, Dudek, Lidick\'{y}, and Pikhurko established the corresponding bound for $C_5$, determining its minimum density at every Tur\'an density $p=1-1/k$ wi...
Seonghyuk Im, Taeyoung Kim, Hongseok Yang· 1 citation
This work proves the first unconditional superlinear lower bounds on the bounded-error quantum query complexity of subgraph detection, and proves an all-ones certificate from a known family when the input bits are sampled independently.
Balogh, Clemen and Lidick\'y asked how large the minimum $\ell_p$-norm of the internal-edge counts over balanced partitions of an $n$-vertex triangle-free graph can be. For each fixed $2<p<\infty$ and all sufficiently large even $n$, we determine this value exactly for bisections and characterize all extremal graphs. T...
This paper studies fundamental graph optimization problems under differential privacy (DP) and shows new, reconstruction-based lower bounds for large families of sparse graphs with expansion properties and extends lower bounds of Deng et al. (ICLR~'25) to general graphs and to approximate DP.
Jacob Imola, Rasmus Pagh, Lukas Retschmeier· 1 citation
For positive integers $n,r,t$, let $\delta(n,r,t)$ denote the maximum possible minimum degree of a balanced $r$-partite graph with parts of size $n$ and chromatic number at most $t$. Lo, Treglown and Zhao established a general upper bound for this parameter and used it, together with explicit constructions, to determin...
Yuuki Kasugai· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.