◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Sinclair

30 papers hereh-index 358.5k citations136 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4
  • middle author13
  • last author13

Across the 30 of 30 papers where every author was matched, so the position is known.

fields
  • math.PR13
  • cs.DM6
  • cs.CC4
  • cs.DS4
  • math-ph2
  • math.ST1
same name
  • A. Sinclair — 39 papers, h 14
  • A. Sinclair — 21 papers, h 27
  • A. Sinclair — 4 papers, h 16
  • A. Sinclair — 2 papers, h 3
  • A. Sinclair — 1 paper, h 6
  • A. Sinclair — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20032026
most citedGlauber dynamics on trees:Boundary conditions and mixing time

88 citations · 293 across the 27 of their papers we have counts for

collaborators
Showing cs.CCShow all

4 papers · 1 filter

cs.CC2019★ 12 cited

Correlation decay and partition function zeros: Algorithms and phase transitions

Jingcheng Liu, Alistair Sinclair, Piyush Srivastava

We explore connections between the phenomenon of correlation decay and the location of Lee-Yang and Fisher zeros for various spin systems. In particular we show that, in many insta…

cs.CC2012★ 1 cited

Lee-Yang theorems and the complexity of computing averages

Alistair Sinclair, Piyush Srivastava

We study the complexity of computing average quantities related to spin systems, such as the mean magnetization and susceptibility in the ferromagnetic Ising model, and the average…

cs.CC2011★ 7 cited

Almost Settling the Hardness of Noncommutative Determinant

Steve Chien, Prahladh Harsha, Alistair Sinclair +1

In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, "over which algebras, is the det…

cs.CC2007

On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas

Elitza Maneva, Alistair Sinclair

We study the structure of satisfying assignments of a random 3-SAT formula. In particular, we show that a random formula of density 4.453 or higher almost surely has no non-trivial…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.