2026 Paul Balister: Mathematics Researcher – H-Index, Publications & Awards

Overview

Paul Balister is affiliated with the University of Oxford in the United Kingdom. Their research spans multiple areas within mathematics and computer science, focusing on discrete mathematics, combinatorics, and computational theory. They have a body of work that includes significant contributions to topics such as graph theory, stochastic processes, and analytic number theory.

Their frequent publication venues include:

arXiv (Cornell University)
Journal of the European Mathematical Society
Random Structures and Algorithms
Inventiones mathematicae
Acta Mathematica Academiae Scientiarum Hungaricae

Paul Balister's recent papers are:

Subcritical monotone cellular automata, 2023, Random Structures and Algorithms
On the Erdős covering problem: the density of the uncovered set, 2021, Inventiones mathematicae
Erdős covering systems, 2020, Acta Mathematica Academiae Scientiarum Hungaricae
Flat Littlewood polynomials exist, 2020, Annals of Mathematics
Improved bounds for 1-independent percolation on Zⁿ, 2025, Electronic Journal of Probability

Their collaborations include frequent co-authors:

Béla Bollobás
Robert Morris
Marius Tiba
Julian Sahasrabudhe
Alex Scott

Primary fields of study for Paul Balister are Mathematics and Computer Science. Their subfields include:

Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Statistics and Probability
Mathematical Physics
Algebra and Number Theory

They focus on several main research themes and topics, including:

Limits and Structures in Graph Theory
Stochastic processes and statistical mechanics
Markov Chains and Monte Carlo Methods
Analytic Number Theory Research
Cellular Automata and Applications
Graph Labeling and Dimension Problems
Coding theory and cryptography

Best Publications

Adjacent Vertex Distinguishing Edge-Colorings

P. N. Balister;E. Gyo dblac;J. Lehel

230
Citations
Vertex-distinguishing edge colorings of graphs

P. N. Balister;O. M. Riordan;R. H. Schelp

203
Citations
Reliable density estimates for coverage and connectivity in thin strips of finite length

Paul Balister;Béla Bollobas;Amites Sarkar;Santosh Kumar

200
Citations
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions

Robert Kozma;Marko Puljic;Paul Balister;Bela Bollobás

190
Citations
Continuum percolation with steps in the square or the disc

Paul Balister;Béla Bollobás_aff n;Mark Walters_aff n

145
Citations
Connectivity of random k -nearest-neighbour graphs

Paul Balister;Béla Bollobás;Amites Sarkar;Mark Walters

142
Citations
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks

P. Balister;Z. Zheng;S. Kumar;P. Sinha

112
Citations
Vertex distinguishing colorings of graphs with Δ(G)=2

Paul N. Balister;Béla Bollobás;Béla Bollobás;Richard H. Schelp

108
Citations
Even-hole-free graphs part I: Decomposition theorem

Michele Conforti;Gérard Cornuéjols;Ajai Kapoor;Kristina Vušković

87
Citations
Random majority percolation

Paul Balister;Béla Bollobás;J. Robert Johnson;Mark Walters

82
Citations
Packing Circuits into K N

Paul Balister

70
Citations
Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors

P. Balister;S. Kumar

69
Citations
Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics

Robert Kozma;Marko Puljic;Paul Balister;Bela Bollobas

68
Citations
Note on Nakayama’s lemma for compact $\Lambda$-modules

P. N. Balister;S. Howson

65
Citations
Subcritical -bootstrap percolation models have non-trivial phase transitions

Paul Balister;Béla Bollobás;Michał Przykucki;Paul Smith

65
Citations
Dependent percolation in two dimensions

P.N. Balister;B. Bollobás;A.M. Stacey

64
Citations
The Interlace Polynomial of Graphs at - 1

P.N. Balister;B. Bollobás;J. Cutler;L. Pebody

63
Citations
Percolation, Connectivity, Coverage and Colouring of Random Geometric Graphs

Paul Balister;Amites Sarkar;Béla Bollobás;Béla Bollobás

63
Citations
Projections, entropy and sumsets

Paul Balister;Béla Bollobás

59
Citations
Large deviations for mean field models of probabilistic cellular automata

P. Balister;B. Bollobás;R. Kozma

56
Citations

Frequent Co-Authors

Béla Bollobás University of Memphis

Oliver Riordan University of Oxford

Robert Kozma University of Memphis

Gregory Gutin Royal Holloway University of London

Zoltán Füredi University of Illinois at Urbana-Champaign

Alan S. Willsky MIT

Anima Anandkumar Nvidia (United Kingdom)

Anders Yeo University of Southern Denmark

Walter J. Freeman University of California, Berkeley

Martin Haenggi University of Notre Dame

External Links

Personal website of Paul Balister

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to numerous career paths and advanced degree options. For students looking to complement their analytical skills with business acumen, pursuing an online MBA can be a strategic step. Many programs offer accelerated timelines, so exploring the quickest online mba options can help professionals upgrade their qualifications efficiently.

For those interested in finance, combining a math background with financial expertise can be lucrative. Choosing a cheap online masters in finance program allows budget-conscious students to gain specialized knowledge without excessive costs.

Entrepreneurs and aspiring marketers may benefit from advanced marketing degrees that focus on data-driven strategies. Numerous programs balance affordability with earning potential, so reviewing marketing graduate programs can guide students toward well-paying careers.

Additionally, professionals aiming for leadership roles or academic advancement might consider pursuing the cheapest dba online programs. These doctorates emphasize research and management, complementing a strong math foundation with business expertise.