Catherine S. Greenhill

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 40

Top Topics

Monte Carlo Method

Transition Probabilities

Top Venues

Comb. Probab. Comput.

Electron. J. Comb.

Publications

Catherine S. Greenhill, Bernard Mans, Ali Pourmiri
Balanced allocation on hypergraphs. J. Comput. Syst. Sci. 138 (2023)
Catherine S. Greenhill, Mikhail Isaev, Tamás Makai, Brendan D. McKay
Degree sequences of sufficiently dense random uniform hypergraphs. Comb. Probab. Comput. 32 (2) (2023)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A triangle process on graphs with given degree sequence. CoRR (2023)
Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill
Lower Bounds on the Chromatic Number of Random Graphs. Comb. 42 (5) (2022)
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
The mixing time of switch Markov chains: A unified approach. Eur. J. Comb. 99 (2022)
Catherine S. Greenhill, Mikhail Isaev, Gary Liang
Spanning trees in random regular uniform hypergraphs. Comb. Probab. Comput. 31 (1) (2022)
Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay
Subgraph counts for dense random graphs with specified degrees. Comb. Probab. Comput. 30 (3) (2021)
Catherine S. Greenhill
Generating graphs randomly. BCC (2021)
Pu Gao, Catherine S. Greenhill
Mixing time of the switch Markov chain and stable degree sequences. Discret. Appl. Math. 291 (2021)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms 59 (2) (2021)
Haya S. Aldosari, Catherine S. Greenhill
The average number of spanning hypertrees in sparse uniform hypergraphs. Discret. Math. 344 (1) (2021)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A Triangle Process on Regular Graphs. IWOCA (2021)
Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
Sampling hypergraphs with given degrees. Discret. Math. 344 (11) (2021)
Daniel Altman, Catherine S. Greenhill, Mikhail Isaev, Reshma Ramadurai
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs. J. Comb. Theory, Ser. B 142 (2020)
Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
Sampling hypergraphs with given degrees. CoRR (2020)
Ryan L. Mann, Luke Mathieson, Catherine S. Greenhill
On the Parameterised Complexity of Induced Multipartite Graph Parameters. CoRR (2020)
Catherine S. Greenhill, Bernard Mans, Ali Pourmiri
Balanced Allocation on Dynamic Hypergraphs. APPROX-RANDOM (2020)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A triangle process on regular graphs. CoRR (2020)
Catherine S. Greenhill, Bernard Mans, Ali Pourmiri
Balanced Allocation on Dynamic Hypergraphs. CoRR (2020)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254 (2019)
Peter J. Ayre, Catherine S. Greenhill
Rigid Colorings of Hypergraphs and Contiguity. SIAM J. Discret. Math. 33 (3) (2019)
Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill
Hypergraph coloring up to condensation. Random Struct. Algorithms 54 (4) (2019)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG (2019)
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
The mixing time of the swap (switch) Markov chains: a unified approach. CoRR (2019)
Haya S. Aldosari, Catherine S. Greenhill
Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges. Eur. J. Comb. 77 (2019)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
Triangle-creation processes on cubic graphs. CoRR (2019)
Pu Gao, Catherine S. Greenhill
Uniform Generation of Spanning Regular Subgraphs of a Dense Graph. Electron. J. Comb. 26 (4) (2019)
Pu Gao, Catherine S. Greenhill
Uniform generation of spanning regular subgraphs of a dense graph. CoRR (2018)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting independent sets in graphs with bounded bipartite pathwidth. CoRR (2018)
Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill
Lower bounds on the chromatic number of random graphs. CoRR (2018)
Catherine S. Greenhill, Matteo Sfragara
The switch Markov chain for sampling irregular graphs and digraphs. Theor. Comput. Sci. 719 (2018)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
The flip Markov chain for connected regular graphs. CoRR (2017)
Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay
The average number of spanning trees in sparse graphs with given degrees. Eur. J. Comb. 63 (2017)
Catherine S. Greenhill, Matteo Sfragara
The switch Markov chain for sampling irregular graphs and digraphs. CoRR (2017)
Magnus Bordewich, Catherine S. Greenhill, Viresh Patel
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms 48 (1) (2016)
Vladimir M. Blinovsky, Catherine S. Greenhill
Asymptotic enumeration of sparse uniform hypergraphs with given degrees. Eur. J. Comb. 51 (2016)
Vladimir M. Blinovsky, Catherine S. Greenhill
Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees. Electron. J. Comb. 23 (3) (2016)
Catherine S. Greenhill
The switch Markov chain for sampling irregular graphs (Extended Abstract). SODA (2015)
Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
On the chromatic number of a random hypergraph. J. Comb. Theory, Ser. B 113 (2015)
Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill
Hypergraph coloring up to condensation. CoRR (2015)
Catherine S. Greenhill, Matthew Kwan, David Wind
On the Number of Spanning Trees in Random Regular Graphs. Electron. J. Comb. 21 (1) (2014)
Catherine S. Greenhill
The switch Markov chain for sampling irregular graphs. CoRR (2014)
Catherine S. Greenhill, Mario Ullrich
Heat-bath Markov chains have no negative eigenvalues CoRR (2013)
Magnus Bordewich, Catherine S. Greenhill, Viresh Patel
Mixing of the Glauber dynamics for the ferromagnetic Potts model CoRR (2013)
Catherine S. Greenhill, Brendan D. McKay
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees. SIAM J. Discret. Math. 27 (4) (2013)
Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
On the chromatic number of a random hypergraph CoRR (2012)
Catherine S. Greenhill
Making Markov chains less lazy CoRR (2012)
Catherine S. Greenhill
A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs. Electron. J. Comb. 18 (1) (2011)
Catherine S. Greenhill, Svante Janson, Andrzej Rucinski
On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. 19 (5-6) (2010)
E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson
Asymptotic enumeration of correlation-immune boolean functions. Cryptogr. Commun. 2 (1) (2010)
Catherine S. Greenhill, Brendan D. McKay
Random dense bipartite graphs and directed graphs with specified degrees. Random Struct. Algorithms 35 (2) (2009)
E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson
Asymptotic enumeration of correlation-immune boolean functions. IACR Cryptol. ePrint Arch. 2009 (2009)
Nicholas J. Cavenagh, Catherine S. Greenhill, Ian M. Wanless
The cycle structure of two rows in a random Latin square. Random Struct. Algorithms 33 (3) (2008)
E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of dense 0-1 matrices with specified line sums. J. Comb. Theory, Ser. A 115 (1) (2008)
Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums. Adv. Appl. Math. 41 (4) (2008)
Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald
Expansion properties of a random regular graph after random vertex deletions. Eur. J. Comb. 29 (5) (2008)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. 16 (4) (2007)
Catherine S. Greenhill, Brendan D. McKay, Xiaoji Wang
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Comb. Theory, Ser. A 113 (2) (2006)
Catherine S. Greenhill, Andrzej Rucinski
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. Electron. J. Comb. 13 (1) (2006)
Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald
The generalized acyclic edge chromatic number of random regular graphs. J. Graph Theory 53 (2) (2006)
Catherine S. Greenhill, Oleg Pikhurko
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. Graphs Comb. 21 (4) (2005)
Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
Generation of simple quadrangulations of the sphere. Discret. Math. 305 (1-3) (2005)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
Sampling regular graphs and a peer-to-peer network. SODA (2005)
Martin E. Dyer, Catherine S. Greenhill
Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms 25 (3) (2004)
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
The Relative Complexity of Approximate Counting Problems. Algorithmica 38 (3) (2004)
Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
Random Hypergraph Processes with Degree Restrictions. Graphs Comb. 20 (3) (2004)
Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald
Hamiltonian decompositions of random bipartite regular graphs. J. Comb. Theory, Ser. B 90 (2) (2004)
Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
Connectedness Of The Degree Bounded Star Process. Comb. Probab. Comput. 12 (3) (2003)
Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
Permutation Pseudographs And Contiguity. Comb. Probab. Comput. 11 (3) (2002)
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. 11 (2) (2002)
Martin E. Dyer, Catherine S. Greenhill, Michael Molloy
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. Random Struct. Algorithms 20 (1) (2002)
Catherine S. Greenhill
An Algorithm for Recognising the Exterior Square of a Multiset. LMS J. Comput. Math. 3 (2000)
Catherine S. Greenhill
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Comput. Complex. 9 (1) (2000)
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. 30 (6) (2000)
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
On the relative complexity of approximate counting problems. APPROX (2000)
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA (2000)
Martin E. Dyer, Catherine S. Greenhill
On Markov Chains for Independent Sets. J. Algorithms 35 (1) (2000)
Martin E. Dyer, Catherine S. Greenhill
The complexity of counting graph homomorphisms. Random Struct. Algorithms 17 (3-4) (2000)
Martin E. Dyer, Catherine S. Greenhill
The complexity of counting graph homomorphisms (extended abstract). SODA (2000)
Martin E. Dyer, Catherine S. Greenhill
Polynomial-time counting and sampling of two-rowed contingency tables. Theor. Comput. Sci. 246 (1-2) (2000)
Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
On Approximately Counting Colorings of Small Degree Graphs. SIAM J. Comput. 29 (2) (1999)
Martin E. Dyer, Catherine S. Greenhill
A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. ICALP (1998)
Russ Bubley, Martin E. Dyer, Catherine S. Greenhill
Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. SODA (1998)
Martin E. Dyer, Catherine S. Greenhill
A more rapidly mixing Markov chain for graph colorings. Random Struct. Algorithms 13 (3-4) (1998)
Catherine S. Greenhill
Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions. J. Symb. Comput. 20 (4) (1995)