5 citations · 26 across the 17 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018
Dynamic Sampling from Graphical Models
Weiming Feng, Nisheeth K. Vishnoi, Yitong Yin
In this paper, we study the problem of sampling from a graphical model when the model itself is changing dynamically with time. This problem derives its interest from a variety of…
cs.DS2018★ 1 cited
On Local Distributed Sampling and Counting
Weiming Feng, Yitong Yin
In classic distributed graph problems, each instance on a graph specifies a space of feasible solutions (e.g. all proper ()-list-colorings of the graph), and the task of distr…
cs.DS2018
Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors)
Weiming Feng, Thomas P. Hayes, Yitong Yin
We examine the problem of almost-uniform sampling proper -colorings of a graph whose maximum degree is . A famous result, discovered independently by Jerrum(1995) and Salas a…