Catherine Greenhill
#66,894
Most Influential Person Now
Australian mathematician
Catherine Greenhill's AcademicInfluence.com Rankings
Catherine Greenhillmathematics Degrees
Mathematics
#3726
World Rank
#5439
Historical Rank
Measure Theory
#3823
World Rank
#4507
Historical Rank
Download Badge
Mathematics
Why Is Catherine Greenhill Influential?
(Suggest an Edit or Addition)According to Wikipedia, Catherine Greenhill is an Australian mathematician known for her research on random graphs, combinatorial enumeration and Markov chains. She is a professor of mathematics in the School of Mathematics and Statistics at the University of New South Wales, and an editor-in-chief of the Electronic Journal of Combinatorics.
Catherine Greenhill's Published Works
Published Works
- The complexity of counting graph homomorphisms (2000) (242)
- On Markov Chains for Independent Sets (2000) (150)
- Sampling regular graphs and a peer-to-peer network (2005) (149)
- On the relative complexity of approximate counting problems (2000) (135)
- The Relative Complexity of Approximate Counting Problems (2000) (134)
- Generation of simple quadrangulations of the sphere (2005) (90)
- The complexity of counting colourings and independent sets in sparse graphs and hypergraphs (2000) (83)
- Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums (2006) (73)
- A more rapidly mixing Markov chain for graph colorings (1998) (72)
- Networks within networks: using multiple link types to examine network structure and identify key actors in a drug trafficking operation (2015) (53)
- On Approximately Counting Colorings of Small Degree Graphs (1999) (53)
- The Use of Actor-Level Attributes and Centrality Measures to Identify Key Actors (2015) (49)
- Asymptotic enumeration of dense 0-1 matrices with specified line sums (2006) (49)
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums (2007) (46)
- A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs (2011) (45)
- Surveys in Combinatorics, 1999: Random Walks on Combinatorial Objects (1999) (44)
- Polynomial-time counting and sampling of two-rowed contingency tables (2000) (44)
- The switch Markov chain for sampling irregular graphs (Extended Abstract) (2014) (42)
- An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings (2001) (41)
- Beating the 2Δ bound for approximately counting colourings: a computer-assisted proof of rapid mixing (1998) (40)
- On the chromatic number of a random hypergraph (2012) (38)
- The switch Markov chain for sampling irregular graphs and digraphs (2017) (35)
- Criminal network vulnerabilities and adaptations (2017) (33)
- Dismantling Criminal Networks: Can Node Attributes Play a Role? (2013) (32)
- Permutation Pseudographs and Contiguity (2002) (31)
- Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs (2005) (29)
- Mixing of the Glauber dynamics for the ferromagnetic Potts model (2013) (26)
- The cycle structure of two rows in a random Latin square (2008) (25)
- Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs (2002) (24)
- Hypergraph coloring up to condensation (2015) (24)
- On the Number of Perfect Matchings in Random Lifts (2009) (24)
- The complexity of counting graph homomorphisms (extended abstract) (2000) (24)
- The average number of spanning trees in sparse graphs with given degrees (2016) (24)
- Convergence of the Iterated Prisoner's Dilemma Game (2002) (23)
- Corrigendum: The complexity of counting graph homomorphisms (2004) (22)
- Structure and eigenvalues of heat-bath Markov chains (2013) (19)
- Corrigendum: Sampling regular graphs and a peer-to-peer network (2012) (19)
- Random dense bipartite graphs and directed graphs with specified degrees (2007) (18)
- The mixing time of switch Markov chains: A unified approach (2019) (15)
- Asymptotic Enumeration of Sparse Multigraphs with Given Degrees (2013) (14)
- The flip Markov chain for connected regular graphs (2017) (14)
- Neighbour-Distinguishing Edge Colourings of Random Regular Graphs (2006) (14)
- Expansion properties of a random regular graph after random vertex deletions (2007) (13)
- Sampling hypergraphs with given degrees (2020) (13)
- Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees (2014) (13)
- The generalized acyclic edge chromatic number of random regular graphs (2006) (11)
- Asymptotic enumeration of sparse uniform hypergraphs with given degrees (2013) (11)
- Some #P-completeness Proofs for Colourings and Independent Sets (1997) (11)
- The mixing time of the swap (switch) Markov chains: a unified approach (2019) (11)
- Random Hypergraph Processes with Degree Restrictions (2004) (10)
- Asymptotic enumeration of correlation-immune boolean functions (2009) (9)
- A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables (1998) (8)
- Hamiltonian decompositions of random bipartite regular graphs (2004) (8)
- On the Number of Spanning Trees in Random Regular Graphs (2013) (8)
- Mixing time of the switch Markov chain and stable degree sequences (2020) (8)
- 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005) (2002) (7)
- Generating graphs randomly (2021) (6)
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs (2016) (6)
- Making Markov chains less lazy (2012) (5)
- An algorithm for recognising the exterior square of a matrix (1999) (5)
- An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract) (2000) (5)
- Counting independent sets in graphs with bounded bipartite pathwidth (2018) (4)
- Subgraph counts for dense random graphs with specified degrees (2018) (4)
- Rigid Colorings of Hypergraphs and Contiguity (2018) (4)
- A Genuinely Polynomial-time Algorithm for Sampling Two-rowed Contingency Tables (extended Abstract) (1998) (4)
- Balanced Allocation on Dynamic Hypergraphs (2020) (4)
- Counting loopy graphs with given degrees (2011) (3)
- Spanning trees in random regular uniform hypergraphs (2020) (3)
- Connectedness of the Degree Bounded Star Process (2003) (3)
- Uniform generation of spanning regular subgraphs of a dense graph (2018) (3)
- Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (2018) (3)
- Lower bounds on the chromatic number of random graphs (2018) (2)
- An Algorithm for Recognising the Exterior Square of a Multiset (2000) (2)
- Heat-bath Markov chains have no negative eigenvalues (2013) (2)
- Triangle-creation processes on cubic graphs (2019) (2)
- The average number of spanning hypertrees in sparse uniform hypergraphs (2019) (1)
- Catherine Greenhill the Cycle Double Cover Conjecture (2005) (1)
- Threshold functions for substructures in random subsets of finite vector spaces (2018) (1)
- On the Parameterised Complexity of Induced Multipartite Graph Parameters (2020) (1)
- A triangle process on regular graphs (2020) (1)
- Workshop on Algebraic, Number Theoretic and Graph Theoretic Aspects of Dynamical Systems (2015) (0)
- A triangle process on graphs with given degree sequence (2023) (0)
- Degree sequences of sufficiently dense random uniform hypergraphs (2021) (0)
- Threshold functions for patterns in random subsets of finite vector spaces (2018) (0)
- Stein's Method (2014) (0)
- Balanced Allocation on Hypergraphs (2020) (0)
- The complexity of counting graph homomorphismsDRAFT : 1 April 1999 (1999) (0)
- C O ] 1 3 A ug 2 01 8 Rigid colourings of hypergraphs and contiguity (2018) (0)
- Mixing time of the swap Markov chain and P-stability (2019) (0)
- Multiplexity in a drug trafficking network: Using multiple types of directed ties to illuminate network structure (2013) (0)
- Aharoni Beyond Hall ’ s Theorem – independent systems of representatives ( p 1 ) Chair : Wanless (2012) (0)
- Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions (1995) (0)
This paper list is powered by the following services:
Other Resources About Catherine Greenhill
What Schools Are Affiliated With Catherine Greenhill?
Catherine Greenhill is affiliated with the following schools: