37 citations · 120 across the 35 of their papers we have counts for
4 papers · 1 filter
Spatial mixing and the connective constant: Optimal bounds
Alistair Sinclair, Piyush Srivastava, Daniel Štefankovič +1
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of ev…
Certificates in Data Structures
Yaoyu Wang, Yitong Yin
We study certificates in static data structures. In the cell-probe model, certificates are the cell probes which can uniquely identify the answer to the query. As a natural notion…
Approximate Capacities of Two-Dimensional Codes by Spatial Mixing
Yi-Kai Wang, Yitong Yin, Sheng Zhong
We apply several state-of-the-art techniques developed in recent advances of counting algorithms and statistical physics to study the spatial mixing property of the two-dimensional…
Spatial Mixing of Coloring Random Graphs
Yitong Yin
We study the strong spatial mixing (decay of correlation) property of proper -colorings of random graph with a fixed . The strong spatial mixing of coloring and r…