39 citations · 82 across the 10 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 2 cited
Swap connectivity for two graph spaces between simple and pseudo graphs and disconnectivity for triangle constraints
Joel Nishimura
With sufficient time, double edge-swap Markov chain Monte Carlo (MCMC) methods are able to sample uniformly at random from many different and important graph spaces. For instance,…
math.CO2017★ 7 cited
The connectivity of graphs of graphs with self-loops and a given degree sequence
Joel Nishimura
`Double edge swaps' transform one graph into another while preserving the graph's degree sequence, and have thus been used in a number of popular Markov chain Monte Carlo (MCMC) sa…