Mark Jerrum
Impact in
- Statistics and Probability top 0.05%
- Markov Chains and Monte Carlo Methods
-
- Limits and Structures in Graph Theory
Papers in
-
- Markov Chains and Monte Carlo Methods 93
-
- Stochastic processes and statistical mechanics 47
- Co-authors
- Alistair Sinclair (10 shared papers)Leslie Ann Goldberg (52 shared papers)Leslie Gabriel Valiant (2 shared papers)Vijay V. Vazirani (2 shared papers)Martin Dyer (31 shared papers)ALAN M. FRIEZE (8 shared papers)Paul W. Goldberg (3 shared papers)Yoram Hirshfeld (4 shared papers)
- Journals
- SIAM Journal on Computing (15 papers)Journal of Computer and System Sciences (7 papers)Theoretical Computer Science (6 papers)Combinatorics Probability Computing (6 papers)Random Structures and Algorithms (6 papers)
- Partner nations
- United KingdomUnited StatesAustralia
In The Last Decade
Mark Jerrum
144 papers receiving 5.7k citations
Mark Jerrum's Hit Papers
Peers
Comparison fields: 5 of 106
- Statistics and Probability 3.1k
- Discrete Mathematics and Combinatorics 693
- Mathematical Physics 1.5k
- Computational Theory and Mathematics 2.6k
- Computational Mathematics 70
Countries citing papers authored by Mark Jerrum
This map shows the geographic impact of Mark Jerrum's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mark Jerrum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Jerrum more than expected).
Fields of papers citing papers by Mark Jerrum
This network shows the impact of papers produced by Mark Jerrum. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mark Jerrum. The network helps show where Mark Jerrum may publish in the future.
Co-authors
The 25 scholars most cited alongside Mark Jerrum, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 148 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Random generation of combinatorial structures from a uniform distribution Hit paper breakdown → | 1986 | 652 |
| 2 | 1989 | 508 | |
| 3 | 1989 | 481 | |
| 4 | 1993 | 352 | |
| 5 | The Markov chain Monte Carlo method: an approach to approximate counting and integration | 1996 | 342 |
| 6 | 1986 | 221 | |
| 7 | 1995 | 193 | |
| 8 | 1992 | 189 | |
| 9 | 1988 | 145 | |
| 10 | Counting, Sampling and Integrating: Algorithms and Complexity | 2003 | 142 |
| 11 | 2003 | 122 | |
| 12 | 1985 | 110 | |
| 13 | 1996 | 109 | |
| 14 | 2003 | 104 | |
| 15 | 1993 | 95 | |
| 16 | 1987 | 92 | |
| 17 | 1998 | 91 | |
| 18 | 2002 | 87 | |
| 19 | 1990 | 84 | |
| 20 | 1990 | 80 |
About Mark Jerrum
Mark Jerrum is a scholar working on Statistics and Probability, Mathematical Physics, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 148 papers that have together received 6.2k indexed citations. Recurring topics across this work include Markov Chains and Monte Carlo Methods (93 papers), Stochastic processes and statistical mechanics (47 papers), Advanced Graph Theory Research (27 papers), Complexity and Algorithms in Graphs (25 papers), Theoretical and Computational Physics (17 papers), Limits and Structures in Graph Theory (17 papers), Machine Learning and Algorithms (15 papers) and Algorithms and Data Compression (13 papers). The work is most often cited by research in Statistics and Probability (3.1k citations), Discrete Mathematics and Combinatorics (693 citations), Mathematical Physics (1.5k citations), Computational Theory and Mathematics (2.6k citations) and Computational Mathematics (70 citations). Mark Jerrum has collaborated with scholars based in United Kingdom, United States and Australia. Frequent co-authors include Alistair Sinclair, Leslie Ann Goldberg, Leslie Gabriel Valiant, Vijay V. Vazirani, Martin Dyer, ALAN M. FRIEZE, Paul W. Goldberg, Yoram Hirshfeld, Gregory B. Sorkin and Faron Moller. Their work appears in journals such as SIAM Journal on Computing, Journal of Computer and System Sciences, Theoretical Computer Science, Combinatorics Probability Computing and Random Structures and Algorithms.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.