4 papers · 1 filter
Optimal girth-dependent bounds for the Bethe approximation of the permanent
Dingding Dong, Vishesh Jain
For an nonnegative matrix , the Bethe permanent, which is computable in deterministic polynomial time, satisfies the tight universal comparison \[\operatorname{Bethe…
Range of random -homomorphisms on weak expanders
Dingding Dong, Jinyoung Park
We prove that random -homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff…
Even-degeneracy of a random graph
Ting-Wei Chao, Dingding Dong, Zixuan Xu
A graph is even-degenerate if one can iteratively remove a vertex of even degree at each step until at most one edge remains. Recently, Janzer and Yip showed that the Erdős--Renyi…
Structure of tight (k,0)-stable graphs
Dingding Dong, Sammy Luo
We say that a graph G is -stable if removing vertices from it reduces its independence number by at most . We say that G is tight -stable if it is $(k…