26 citations · 105 across the 26 of their papers we have counts for
6 papers · 1 filter
A triangle process on regular graphs
Colin Cooper, Martin Dyer, Catherine Greenhill
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called trian…
Sampling hypergraphs with given degrees
Martin Dyer, Catherine Greenhill, Pieter Kleer +2
There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite grap…
Balanced Allocation on Hypergraphs
Catherine Greenhill, Bernard Mans, Ali Pourmiri
We consider a variation of balls-into-bins which randomly allocates balls into bins. Following Godfrey's model (SODA, 2008), we assume that each ball , , co…
Spanning trees in random regular uniform hypergraphs
Catherine Greenhill, Mikhail Isaev, Gary Liang
Let denote a uniformly random -regular -uniform hypergraph on the vertex set . We establish a threshold result for the existence of a…
On the Parameterised Complexity of Induced Multipartite Graph Parameters
Ryan L. Mann, Luke Mathieson, Catherine Greenhill
We introduce a family of graph parameters, called induced multipartite graph parameters, and study their computational complexity. First, we consider the following decision problem…
Mixing time of the switch Markov chain and stable degree sequences
Pu Gao, Catherine Greenhill
The switch chain is a well-studied Markov chain which can be used to sample approximately uniformly from the set of all graphs with a given degree sequence $\bo…