On the public citation graph

Counting independent sets up to the tree threshold

https://doi.org/10.1145/1132516.1132538
0 signed · 393 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1098-2418(199605)8:3<199::aid-rsa4>3.0.co;2-topenalex-snapshot
A new lower bound for the critical probability of site percolation on the square lattice
inferredcites →https://doi.org/10.1002/rsa.20004openalex-snapshot
Mixing in time and space for lattice spin systems: A combinatorial view
inferredcites →https://doi.org/10.1002/rsa.v24:4openalex-snapshot
inferredcites →https://doi.org/10.1006/jagm.1999.1071openalex-snapshot
On Markov Chains for Independent Sets
inferredcites →https://doi.org/10.1007/978-1-4899-6653-7_20openalex-snapshot
Constructive Criterion for the Uniqueness of Gibbs Field
inferredcites →https://doi.org/10.1007/bf01016786openalex-snapshot
Vasserstein distances in two-state systems
inferredcites →https://doi.org/10.1007/bf01208821openalex-snapshot
Phase diagram of the two-dimensional Ising antiferromagnet (computer-assisted proof)
inferredcites →https://doi.org/10.1007/bf02096629openalex-snapshot
The logarithmic sobolev inequality for discrete spin systems on a lattice
inferredcites →https://doi.org/10.1007/bf02101929openalex-snapshot
Approach to equilibrium of Glauber dynamics in the one phase region
inferredcites →https://doi.org/10.1007/pl00008792openalex-snapshot
Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields
inferredcites →https://doi.org/10.1007/s10955-004-2055-4openalex-snapshot
The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lov�sz Local Lemma
inferredcites →https://doi.org/10.1016/0304-4149(94)90132-5openalex-snapshot
Percolation and the hard-core lattice gas model
inferredcites →https://doi.org/10.1023/a:1004573003122openalex-snapshot
inferredcites →https://doi.org/10.1023/a:1004592103315openalex-snapshot
Nonmonotonic behavior in hard-core and Widom-Rowlinson models
inferredcites →https://doi.org/10.1103/physrev.114.45openalex-snapshot
Excluded-Volume Problem and the Ising Model of Ferromagnetism
inferredcites →https://doi.org/10.1109/focs.2004.63openalex-snapshot
Strong Spatial Mixing for Lattice Graphs with Fewer Colours
inferredcites →https://doi.org/10.1109/sffcs.1999.814593openalex-snapshot
On counting independent sets in sparse graphs
inferredcites →https://doi.org/10.1111/j.2517-6161.1985.tb01367.xopenalex-snapshot
Stochastic Models of Computer Communication Systems
inferredcites →https://doi.org/10.1137/s0097539704445470openalex-snapshot
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
inferredcites →https://doi.org/10.1145/258533.258663openalex-snapshot
Approximately counting up to four (extended abstract)
inferredcites →https://doi.org/10.1214/105051606000000330openalex-snapshot
Coupling with the stationary distribution and improved sampling for colorings and independent sets
inferredcites →https://doi.org/10.1214/aop/1176996347openalex-snapshot
Markov Random Fields on an Infinite Tree
inferredcites →https://doi.org/10.2139/ssrn.882101openalex-snapshot
A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand
inferredcites →https://doi.org/10.37236/1552openalex-snapshot
A Note on the Glauber Dynamics for Sampling Independent Sets
inferredcites →https://doi.org/10.48550/arxiv.cond-mat/0004231openalex-snapshot
A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models
inferredcites →https://doi.org/10.5555/982792.982857openalex-snapshot
Fast mixing for independent sets, colorings and other models on trees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4142187openalex-extracted
Polymer Dynamics Via Cliques: New Conditions for Approximations
inferred← citeshttps://doi.org/10.1002/cpa.21489openalex-snapshot
Cutoff for General Spin Systems with Arbitrary Boundary Conditions
inferred← citeshttps://doi.org/10.1002/net.21805openalex-snapshot
On the analysis of independent sets via multilevel splitting
inferred← citeshttps://doi.org/10.1002/rsa.20223openalex-snapshot
Sampling independent sets in the discrete torus
inferred← citeshttps://doi.org/10.1002/rsa.20243openalex-snapshot
On systematic scan for sampling H‐colorings of the path
inferred← citeshttps://doi.org/10.1002/rsa.20276openalex-snapshot
Rapid mixing of Gibbs sampling on graphs that are sparse on average
inferred← citeshttps://doi.org/10.1002/rsa.20414openalex-snapshot
Left and right convergence of graphs with bounded degree
inferred← citeshttps://doi.org/10.1002/rsa.20479openalex-snapshot
Improved inapproximability results for counting independent sets in the hard‐core model
inferred← citeshttps://doi.org/10.1002/rsa.20518openalex-snapshot
Strong spatial mixing of list coloring of graphs
inferred← citeshttps://doi.org/10.1002/rsa.20830openalex-snapshot
Rapid mixing of hypergraph independent sets
inferred← citeshttps://doi.org/10.1002/rsa.20844openalex-snapshot
Spatial Mixing and Non-local Markov chains
inferred← citeshttps://doi.org/10.1002/rsa.20858openalex-snapshot
Swendsen‐Wang dynamics for general graphs in the tree uniqueness region
inferred← citeshttps://doi.org/10.1002/rsa.20928openalex-snapshot
Tight bounds for popping algorithms
inferred← citeshttps://doi.org/10.1002/rsa.20968openalex-snapshot
Fast algorithms at low temperatures via Markov chains†
inferred← citeshttps://doi.org/10.1002/rsa.21003openalex-snapshot
Counting independent sets in graphs with bounded bipartite pathwidth
inferred← citeshttps://doi.org/10.1002/rsa.21079openalex-snapshot
Perfect sampling from spatial mixing
inferred← citeshttps://doi.org/10.1002/rsa.21083openalex-snapshot
Correlation decay and the absence of zeros property of partition functions
inferred← citeshttps://doi.org/10.1002/rsa.21131openalex-snapshot
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
inferred← citeshttps://doi.org/10.1002/rsa.21145openalex-snapshot
Approximately counting independent sets in bipartite graphs via graph containers
inferred← citeshttps://doi.org/10.1002/rsa.70013openalex-snapshot
On the Replica Symmetric Solution in General Diluted Spin Glasses
inferred← citeshttps://doi.org/10.1002/rsa.70018openalex-snapshot
Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs
inferred← citeshttps://doi.org/10.1002/rsa.70041openalex-snapshot
A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders
inferred← citeshttps://doi.org/10.1002/rsa.70044openalex-snapshot
Counting Independent Sets in Percolated Graphs via the Ising Model
inferred← citeshttps://doi.org/10.1002/rsa.v35:1openalex-snapshot
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_750openalex-snapshot
Approximating the Partition Function of Two-Spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_23openalex-snapshot
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_54openalex-snapshot
Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_37openalex-snapshot
The Hardness of Sampling Connected Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_22openalex-snapshot
Algorithms for Hard-Constraint Point Processes via Discretization
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_25openalex-snapshot
Exact Distributed Sampling
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_33openalex-snapshot
Approximate Counting of Matchings in (3,3)-Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_30openalex-snapshot
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_20openalex-snapshot
Some algorithmic applications of partition functions in combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_7openalex-snapshot
Computing the Partition Function of a Polynomial on the Boolean Cube
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_2openalex-snapshot
An FPTAS for the Volume of Some $$\mathcal{V}$$-polytopes—It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_14openalex-snapshot
On the Connection between Interval Size Functions and Path Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_18openalex-snapshot
Exponential Time Complexity of Weighted Counting of Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_48openalex-snapshot
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_1-2openalex-snapshot
Abelian Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_750-1openalex-snapshot
Approximating the Partition Function of Two-Spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_30openalex-snapshot
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_27openalex-snapshot
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_44openalex-snapshot
Improved FPTAS for Multi-spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_48openalex-snapshot
Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_14openalex-snapshot
Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_65openalex-snapshot
FPTAS for Weighted Fibonacci Gates and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_89openalex-snapshot
Spatial Mixing of Coloring Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_54openalex-snapshot
FPTAS for Counting Weighted Edge Covers
inferred← citeshttps://doi.org/10.1007/s00037-016-0137-8openalex-snapshot
On the connection between interval size functions and path counting
inferred← citeshttps://doi.org/10.1007/s00037-022-00226-5openalex-snapshot
Zeros and approximations of Holant polynomials on the complex plane
inferred← citeshttps://doi.org/10.1007/s00220-014-2036-7openalex-snapshot
Lee–Yang Theorems and the Complexity of Computing Averages
inferred← citeshttps://doi.org/10.1007/s00220-022-04559-8openalex-snapshot
Analyticity for Classical Gasses via Recursion
inferred← citeshttps://doi.org/10.1007/s00220-024-05214-0openalex-snapshot
Potential-Weighted Connective Constants and Uniqueness of Gibbs Measures
inferred← citeshttps://doi.org/10.1007/s00220-026-05623-3openalex-snapshot
Pirogov–Sinai Theory for the Hard-Core Model Beyond Lattices
inferred← citeshttps://doi.org/10.1007/s00440-007-0131-9openalex-snapshot
On the hardness of sampling independent sets beyond the tree threshold
inferred← citeshttps://doi.org/10.1007/s00440-009-0222-xopenalex-snapshot
Gibbs rapidly samples colorings of G(n, d/n)
inferred← citeshttps://doi.org/10.1007/s00440-012-0421-8openalex-snapshot
Improved mixing condition on the grid for counting and sampling independent sets
inferred← citeshttps://doi.org/10.1007/s00440-016-0708-2openalex-snapshot
Spatial mixing and the connective constant: optimal bounds
inferred← citeshttps://doi.org/10.1007/s00440-019-00928-yopenalex-snapshot
Algorithmic Pirogov-Sinai theory
inferred← citeshttps://doi.org/10.1007/s00440-023-01190-zopenalex-snapshot
Absence of zeros implies strong spatial mixing
inferred← citeshttps://doi.org/10.1007/s00446-018-0332-8openalex-snapshot
What can be sampled locally?
inferred← citeshttps://doi.org/10.1007/s00453-015-0096-5openalex-snapshot
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution
inferred← citeshttps://doi.org/10.1007/s00454-026-00824-yopenalex-snapshot
Approximating the Volume of a Truncated Relaxation of the Independence Polytope
inferred← citeshttps://doi.org/10.1007/s00493-016-3506-7openalex-snapshot
Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits
inferred← citeshttps://doi.org/10.1007/s10955-009-9849-3openalex-snapshot
Sequential Cavity Method for Computing Free Energy and Surface Pressure
inferred← citeshttps://doi.org/10.1007/s10955-014-0947-5openalex-snapshot
Approximation Algorithms for Two-State Anti-Ferromagnetic Spin Systems on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/s10955-018-1959-3openalex-snapshot
Gibbs Measures Over Locally Tree-Like Graphs and Percolative Entropy Over Infinite Regular Trees
inferred← citeshttps://doi.org/10.1007/s10955-018-2199-2openalex-snapshot
The Ising Partition Function: Zeros and Deterministic Approximation
inferred← citeshttps://doi.org/10.1007/s10955-021-02831-0openalex-snapshot
Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
inferred← citeshttps://doi.org/10.1007/s10955-022-02969-5openalex-snapshot
Strong Spatial Mixing for Repulsive Point Processes
inferred← citeshttps://doi.org/10.1007/s10955-023-03145-zopenalex-snapshot
Uniqueness of the Gibbs Measure for the Anti-ferromagnetic Potts Model on the Infinite $$\Delta $$-Regular Tree for Large $$\Delta $$
inferred← citeshttps://doi.org/10.1007/s10955-025-03435-8openalex-snapshot
Analyticity for Locally Stable Hard-Core Gases via Recursion
inferred← citeshttps://doi.org/10.1007/s11511-010-0046-7openalex-snapshot
The mean field traveling salesman and related problems
inferred← citeshttps://doi.org/10.1007/s11854-020-0140-5openalex-snapshot
An SMB approach for pressure representation in amenable virtually orderable groups
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.03.004openalex-snapshot
Approximating the volume of unions and intersections of high-dimensional geometric objects
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.002openalex-snapshot
Approximately counting paths and cycles in a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.036openalex-snapshot
A faster FPTAS for counting two-rowed contingency tables
inferred← citeshttps://doi.org/10.1016/j.disc.2018.06.033openalex-snapshot
On trees with real-rooted independence polynomial
inferred← citeshttps://doi.org/10.1016/j.enbuild.2014.10.069openalex-snapshot
Robust model-based fault diagnosis for air handling units
inferred← citeshttps://doi.org/10.1016/j.endm.2017.07.061openalex-snapshot
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
inferred← citeshttps://doi.org/10.1016/j.ic.2011.12.007openalex-snapshot
The complexity of approximating bounded-degree Boolean #CSP
inferred← citeshttps://doi.org/10.1016/j.ic.2016.07.003openalex-snapshot
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ic.2019.02.001openalex-snapshot
Counting hypergraph matchings up to uniqueness threshold
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105340openalex-snapshot
Two-state spin systems with negative interactions
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.04.012openalex-snapshot
Approximating partition functions of the two-state spin system
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.05.002openalex-snapshot
A deterministic approximation algorithm for computing the permanent of a 0,1 matrix
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.007openalex-snapshot
Approximating the partition function of planar two-state spin systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.009openalex-snapshot
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.09.002openalex-snapshot
A dichotomy for bounded degree graph homomorphisms with nonnegative weights
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.10.001openalex-snapshot
Dismantlability, connectedness, and mixing in relational structures
inferred← citeshttps://doi.org/10.1016/j.jda.2010.10.002openalex-snapshot
Correlation decay and deterministic FPTAS for counting colorings of a graph
inferred← citeshttps://doi.org/10.1016/j.ress.2018.06.005openalex-snapshot
Finding minimum node separators: A Markov chain Monte Carlo method
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.008openalex-snapshot
Random sampling of colourings of sparse random graphs with a constant number of colours
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.040openalex-snapshot
Sublinear-time algorithms for monomer–dimer systems on bounded degree graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.017openalex-snapshot
Total variation discrepancy of deterministic random walks for ergodic Markov chains
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.029openalex-snapshot
An FPTAS for the volume of some V -polytopes — It is hard to compute the volume of the intersection of two cross-polytopes
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.009openalex-snapshot
Faster exponential-time algorithms for approximately counting independent sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.10.025openalex-snapshot
Implementations and the independent set polynomial below the Shearer threshold
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114940openalex-snapshot
The complexity of ferromagnetic 2-spin systems on bounded degree graphs
inferred← citeshttps://doi.org/10.1017/9781108899727openalex-snapshot
An Introduction to Symbolic Dynamics and Coding
inferred← citeshttps://doi.org/10.1017/9781108899727.001openalex-snapshot
Preface to the First Edition
inferred← citeshttps://doi.org/10.1017/9781108899727.002openalex-snapshot
Preface to the Second Edition
inferred← citeshttps://doi.org/10.1017/9781108899727.003openalex-snapshot
Shift Spaces
inferred← citeshttps://doi.org/10.1017/9781108899727.004openalex-snapshot
Shifts of Finite Type
inferred← citeshttps://doi.org/10.1017/9781108899727.005openalex-snapshot
Sofic Shifts
inferred← citeshttps://doi.org/10.1017/9781108899727.006openalex-snapshot
Entropy
inferred← citeshttps://doi.org/10.1017/9781108899727.007openalex-snapshot
Finite-State Codes
inferred← citeshttps://doi.org/10.1017/9781108899727.008openalex-snapshot
Shifts as Dynamical Systems
inferred← citeshttps://doi.org/10.1017/9781108899727.009openalex-snapshot
Conjugacy
inferred← citeshttps://doi.org/10.1017/9781108899727.010openalex-snapshot
Finite-to-One Codes and Finite Equivalence
inferred← citeshttps://doi.org/10.1017/9781108899727.011openalex-snapshot
Degrees of Codes and Almost Conjugacy
inferred← citeshttps://doi.org/10.1017/9781108899727.012openalex-snapshot
Embeddings and Factor Codes
inferred← citeshttps://doi.org/10.1017/9781108899727.013openalex-snapshot
Realization
inferred← citeshttps://doi.org/10.1017/9781108899727.014openalex-snapshot
Equal Entropy Factors
inferred← citeshttps://doi.org/10.1017/9781108899727.015openalex-snapshot
Guide to Advanced Topics
inferred← citeshttps://doi.org/10.1017/9781108899727.016openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108899727.017openalex-snapshot
Addendum Bibliography
inferred← citeshttps://doi.org/10.1017/9781108899727.018openalex-snapshot
Notation Index
inferred← citeshttps://doi.org/10.1017/9781108899727.019openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1017/etds.2016.107openalex-snapshot
The topological strong spatial mixing property and new conditions for pressure approximation
inferred← citeshttps://doi.org/10.1017/etds.2023.38openalex-snapshot
Counting independent sets in amenable groups
inferred← citeshttps://doi.org/10.1017/jpr.2024.102openalex-snapshot
Perturbation analysis of Markov chain Monte Carlo for graphical models
inferred← citeshttps://doi.org/10.1017/s0021900200007075openalex-snapshot
Branching Process Approach for 2-Sat Thresholds
inferred← citeshttps://doi.org/10.1017/s030500412300052xopenalex-snapshot
Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial
inferred← citeshttps://doi.org/10.1017/s096354830900981xopenalex-snapshot
A Spectral Approach to Analysing Belief Propagation for 3-Colouring
inferred← citeshttps://doi.org/10.1017/s0963548312000296openalex-snapshot
A Graph Polynomial for Independent Sets of Bipartite Graphs
inferred← citeshttps://doi.org/10.1017/s0963548315000401openalex-snapshot
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
inferred← citeshttps://doi.org/10.1017/s0963548318000238openalex-snapshot
Phase Coexistence for the Hard-Core Model on ℤ 2
inferred← citeshttps://doi.org/10.1017/s0963548320000255openalex-snapshot
Deterministic counting of graph colourings using sequences of subgraphs
inferred← citeshttps://doi.org/10.1017/s0963548322000207openalex-snapshot
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree
inferred← citeshttps://doi.org/10.1017/s0963548323000330openalex-snapshot
On the zeroes of hypergraph independence polynomials
inferred← citeshttps://doi.org/10.1017/s0963548324000282openalex-snapshot
Sampling repulsive Gibbs point processes using random graphs
inferred← citeshttps://doi.org/10.1017/s0963548324000464openalex-snapshot
Hypergraph independence polynomials with a zero close to the origin
inferred← citeshttps://doi.org/10.1017/s0963548325100163openalex-snapshot
Glauber dynamics for the hard-core model on bounded-degree $H$ -free graphs
inferred← citeshttps://doi.org/10.1017/s0963548326100558openalex-snapshot
Computing volume of a polytope and integrals in high dimensions deterministically
inferred← citeshttps://doi.org/10.1063/1.5082552openalex-snapshot
Fisher zeros and correlation decay in the Ising model
inferred← citeshttps://doi.org/10.1063/5.0013689openalex-snapshot
Efficient algorithms for approximating quantum partition functions
inferred← citeshttps://doi.org/10.1080/01411594.2026.2636801openalex-snapshot
Phase transitions in the three-state Hard-Core model with competing interactions on the Cayley tree
inferred← citeshttps://doi.org/10.1088/1742-5468/abcaf0openalex-snapshot
Gauges, loops, and polynomials for partition functions of graphical models
inferred← citeshttps://doi.org/10.1103/physrevlett.124.220601openalex-snapshot
Clustering of Conditional Mutual Information for Quantum Gibbs States above a Threshold Temperature
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483471openalex-snapshot
Greedy learning of graphical models with small girth
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028584openalex-snapshot
Learning Graphical Models From the Glauber Dynamics
inferred← citeshttps://doi.org/10.1109/case.2011.6042511openalex-snapshot
Marginal analysis on binary pairwise Gibbs random fields
inferred← citeshttps://doi.org/10.1109/dcoss.2011.5982153openalex-snapshot
A distributed deterministic approximation algorithm for data association
inferred← citeshttps://doi.org/10.1109/focs.2007.4389491openalex-snapshot
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
inferred← citeshttps://doi.org/10.1109/focs.2007.67openalex-snapshot
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
inferred← citeshttps://doi.org/10.1109/focs.2007.8openalex-snapshot
Sparse Random Linear Codes are Locally Decodable and Testable
inferred← citeshttps://doi.org/10.1109/focs.2010.34openalex-snapshot
Computational Transition at the Uniqueness Threshold
inferred← citeshttps://doi.org/10.1109/focs.2011.32openalex-snapshot
An FPTAS for #Knapsack and Related Counting Problems
inferred← citeshttps://doi.org/10.1109/focs.2011.45openalex-snapshot
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets
inferred← citeshttps://doi.org/10.1109/focs.2012.56openalex-snapshot
The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs
inferred← citeshttps://doi.org/10.1109/focs.2013.40openalex-snapshot
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant
inferred← citeshttps://doi.org/10.1109/focs.2016.80openalex-snapshot
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
inferred← citeshttps://doi.org/10.1109/focs.2017.95openalex-snapshot
The Ising Partition Function: Zeros and Deterministic Approximation
inferred← citeshttps://doi.org/10.1109/focs.2019.00085openalex-snapshot
A Deterministic Algorithm for Counting Colorings with 2-Delta Colors
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00106openalex-snapshot
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00124openalex-snapshot
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00125openalex-snapshot
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00127openalex-snapshot
The complexity of approximating averages on bounded-degree graphs
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00022openalex-snapshot
Rapid mixing of Glauber dynamics via spectral independence for all degrees
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00023openalex-snapshot
Spectral Independence via Stability and Applications to Holant-Type Problems
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00062openalex-snapshot
Optimal mixing for two-state anti-ferromagnetic spin systems
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00101openalex-snapshot
Optimal mixing of the down-up walk on independent sets of a given size
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00120openalex-snapshot
Towards derandomising Markov chain Monte Carlo
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00121openalex-snapshot
Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract)
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00019openalex-snapshot
A Sampling Lovász Local Lemma for Large Domain Sizes
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00020openalex-snapshot
Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00068openalex-snapshot
High-Temperature Gibbs States are Unentangled and Efficiently Preparable
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935185openalex-snapshot
Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling
inferred← citeshttps://doi.org/10.1109/isit.2014.6874995openalex-snapshot
Approximate capacities of two-dimensional codes by spatial mixing
inferred← citeshttps://doi.org/10.1109/ita.2010.5454076openalex-snapshot
Iterative decoding beyond belief propagation
inferred← citeshttps://doi.org/10.1109/itw.2007.4313078openalex-snapshot
Approximate message-passing inference algorithm
inferred← citeshttps://doi.org/10.1109/tcns.2018.2843164openalex-snapshot
Locality in Network Optimization
inferred← citeshttps://doi.org/10.1109/tit.2012.2204032openalex-snapshot
Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling
inferred← citeshttps://doi.org/10.1109/tst.2014.6867521openalex-snapshot
Counting problems in parameterized complexity
inferred← citeshttps://doi.org/10.1112/jlms.12056openalex-snapshot
Independent sets, matchings, and occupancy fractions
inferred← citeshttps://doi.org/10.1112/jlms.12286openalex-snapshot
Location of zeros for the partition function of the Ising model on bounded degree graphs
inferred← citeshttps://doi.org/10.1112/s1461157000001492openalex-snapshot
Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice
inferred← citeshttps://doi.org/10.1137/090767145openalex-snapshot
Counting Independent Sets Using the Bethe Approximation
inferred← citeshttps://doi.org/10.1137/1.9781611973037.9openalex-snapshot
Approximate Counting of Matchings in Sparse Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611973075.23openalex-snapshot
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973099.74openalex-snapshot
Approximate Counting via Correlation Decay in Spin Systems
inferred← citeshttps://doi.org/10.1137/1.9781611973099.75openalex-snapshot
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973105.4openalex-snapshot
Approximate Counting via Correlation Decay on Planar Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973105.5openalex-snapshot
Correlation Decay up to Uniqueness in Spin Systems
inferred← citeshttps://doi.org/10.1137/1.9781611973402.22openalex-snapshot
MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold
inferred← citeshttps://doi.org/10.1137/1.9781611973402.25openalex-snapshot
A Simple FPTAS for Counting Edge Covers
inferred← citeshttps://doi.org/10.1137/1.9781611973730.101openalex-snapshot
FPTAS for Counting Monotone CNF
inferred← citeshttps://doi.org/10.1137/1.9781611973730.102openalex-snapshot
Spatial mixing and the connective constant: Optimal bounds
inferred← citeshttps://doi.org/10.1137/1.9781611974324.13openalex-snapshot
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch34openalex-snapshot
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.117openalex-snapshot
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975031.102openalex-snapshot
Computing the Independence Polynomial: from the Tree Threshold down to the Roots
inferred← citeshttps://doi.org/10.1137/1.9781611975482.135openalex-snapshot
Algorithms for #BIS-hard problems on expander graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975994.11openalex-snapshot
Zeros of ferromagnetic 2-spin systems
inferred← citeshttps://doi.org/10.1137/1.9781611975994.88openalex-snapshot
Counting independent sets in unbalanced bipartite graphs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.127openalex-snapshot
Distributed Metropolis Sampler with Optimal Parallelism
inferred← citeshttps://doi.org/10.1137/1.9781611976465.95openalex-snapshot
Rapid Mixing from Spectral Independence beyond the Boolean Domain
inferred← citeshttps://doi.org/10.1137/1.9781611977073.24openalex-snapshot
Approximately counting independent sets in bipartite graphs via graph containers
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch29openalex-snapshot
On complex roots of the independence polynomial
showing the first 200 of 367
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.