- Home
- Best Scientists - Mathematics
- Alistair Sinclair

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
39
Citations
11,611
113
World Ranking
1434
National Ranking
641

Computer Science
D-index
39
Citations
11,598
110
World Ranking
5945
National Ranking
2868

- Algebra
- Combinatorics
- Mathematical analysis

Alistair Sinclair spends much of his time researching Combinatorics, Markov chain, Discrete mathematics, Time complexity and Computing the permanent. His Combinatorics study incorporates themes from Proper equilibrium, Upper and lower bounds and Lattice. His Markov chain research is multidisciplinary, incorporating elements of Algorithm, Multi-commodity flow problem, Mathematical optimization and Mixing.

His research brings together the fields of Degree and Discrete mathematics. Alistair Sinclair has researched Time complexity in several fields, including Integer lattice, Rate of convergence and Counting problem. As a part of the same scientific study, Alistair Sinclair usually deals with the Computing the permanent, concentrating on Minimax approximation algorithm and frequently concerns with Polynomial-time approximation scheme, Polynomial time approximation algorithm and Scheme.

- Approximating the permanent (685 citations)
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries (671 citations)
- Approximate counting, uniform generation and rapidly mixing Markov chains (649 citations)

His primary areas of investigation include Discrete mathematics, Combinatorics, Ising model, Markov chain and Time complexity. His Discrete mathematics research includes themes of Polynomial, Approximation algorithm and Partition function. His study in Combinatorics is interdisciplinary in nature, drawing from both Probability distribution, Upper and lower bounds and Matrix.

His research in Ising model tackles topics such as Bounded function which are related to areas like Degree and Gibbs measure. His research investigates the connection between Markov chain and topics such as Mixing that intersect with issues in Mean field theory. His Time complexity research integrates issues from Rate of convergence, Graph and Counting problem.

- Discrete mathematics (48.67%)
- Combinatorics (48.67%)
- Ising model (24.67%)

- Ising model (24.67%)
- Combinatorics (48.67%)
- Discrete mathematics (48.67%)

His primary scientific interests are in Ising model, Combinatorics, Discrete mathematics, Markov chain and Phase transition. His Ising model study incorporates themes from Integer lattice, Partition function, Pure mathematics and Random graph. The Combinatorics study combines topics in areas such as Matrix and Preconditioner.

Alistair Sinclair has included themes like Local search and Degree in his Discrete mathematics study. His biological study spans a wide range of topics, including Potts model and Statistical physics. Alistair Sinclair combines subjects such as Upper and lower bounds and Lattice with his study of Phase transition.

- Approximation Algorithms for Two-State Anti-Ferromagnetic Spin Systems on Bounded Degree Graphs (60 citations)
- The Ising Partition Function: Zeros and Deterministic Approximation (24 citations)
- Spatial mixing and the connective constant: optimal bounds (21 citations)

- Algebra
- Combinatorics
- Mathematical analysis

Ising model, Combinatorics, Partition function, Lambda and Bounded function are his primary areas of study. He interconnects Discrete mathematics and Phase transition in the investigation of issues within Ising model. In the subject of general Combinatorics, his work in Randomized algorithm is often linked to Glauber, thereby combining diverse domains of study.

His Partition function study integrates concerns from other disciplines, such as Approximation algorithm, Pure mathematics and Extension. As a member of one scientific family, Alistair Sinclair mostly works in the field of Mixing, focusing on Mathematical physics and, on occasion, Markov chain and Random graph. The Markov chain study which covers Polynomial that intersects with Graph coloring and Time complexity.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Optimal speedup of Las Vegas algorithms

M. Luby;A. Sinclair;D. Zuckerman.

symposium on the theory of computing **(1993)**

1245 Citations

Approximating the permanent

M. Jerrum;Alistair Sinclair.

SIAM Journal on Computing **(1989)**

1130 Citations

Approximate counting, uniform generation and rapidly mixing Markov chains

Alistair Sinclair;Mark Jerrum.

Information & Computation **(1989)**

1044 Citations

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

Mark Jerrum;Alistair Sinclair;Eric Vigoda.

Journal of the ACM **(2004)**

883 Citations

Polynomial-time approximation algorithms for the Ising model

Mark Jerrum;Alistair Sinclair.

SIAM Journal on Computing **(1993)**

848 Citations

The Markov chain Monte Carlo method: an approach to approximate counting and integration

Mark Jerrum;Alistair Sinclair.

Approximation algorithms for NP-hard problems **(1996)**

763 Citations

Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

Alistair Sinclair.

Combinatorics, Probability & Computing **(1992)**

683 Citations

Algorithms for Random Generation and Counting: A Markov Chain Approach

Alistair Sinclair.

**(1993)**

497 Citations

Convergence to approximate Nash equilibria in congestion games

Steve Chien;Alistair Sinclair.

Games and Economic Behavior **(2011)**

325 Citations

Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved

Mark Jerrum;Alistair Sinclair.

symposium on the theory of computing **(1988)**

293 Citations

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

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of California, Santa Barbara

Queen Mary University of London

Hebrew University of Jerusalem

BitRipple

Carnegie Mellon University

California Institute of Technology

National and Kapodistrian University of Athens

Santa Clara University

Tel Aviv University

The University of Texas at Austin

Nankai University

Tianjin University of Science and Technology

Poznań University of Technology

Guangzhou Institutes of Biomedicine and Health

Gifu Pharmaceutical University

Cedars-Sinai Medical Center

Cranfield University

Boston College

University of Minnesota

Vita-Salute San Raffaele University

Erasmus University Rotterdam

Chang Gung Memorial Hospital

German Cancer Research Center

University of Georgia

University of North Carolina at Chapel Hill

University of Warsaw

Something went wrong. Please try again later.