research
∙
08/25/2023
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
Partite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each h...
share
research
∙
04/20/2022
Approximate Sampling of Graphs with Near-P-stable Degree Intervals
The approximate uniform sampling of graph realizations with a given degr...
research
∙
09/27/2021
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
Let D = d_1, d_2, …, d_n and F = f_1, f_2,…, f_n be two sequences of pos...
research
∙
03/22/2021
A Markov chain on the solution space of edge-colorings of bipartite graphs
In this paper, we exhibit an irreducible Markov chain M on the edge k-co...
research
∙
01/06/2020
Counting Maximum Matchings in Planar Graphs Is Hard
Here we prove that counting maximum matchings in planar, bipartite graph...
research
∙
09/05/2019
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing
One of the simplest methods of generating a random graph with a given de...
research
∙
03/15/2019
