Approximate counting via complex zero-free regions and spectral independence

Approximate counting via complex zero-free regions and spectral independence

<p>This thesis investigates fundamental problems in approximate counting that arise in the field of statistical mechanics. Building upon recent advancements in the area, our research aims to enhance our understanding of the computational complexity of sampling from the Ising and Potts models,...

Fuld beskrivelse

Bibliografiske detaljer
Hovedforfatter:	Herrera Poyatos, A
Andre forfattere:	Goldberg, L
Format:	Thesis
Sprog:	English
Udgivet:	2023
Fag:	Computational complexity

Lignende værker

On the complexity of counting homomorphisms under surjectivity constraints
af: Focke, J
Udgivet: (2020)

The complexity of approximately counting retractions to square-free graphs
af: Focke, J, et al.
Udgivet: (2021)

The complexity of approximating the complex-valued Potts model
af: Galanis, A, et al.
Udgivet: (2022)

Approximate cycles count in undirected graphs
af: Maytham Safar, et al.
Udgivet: (2014-04-01)

Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
af: Branislav Rehak, et al.
Udgivet: (2022-01-01)

Approximate Counting via the Poisson-Laplace-Mellin Method
af: Michael Fuchs, et al.
Udgivet: (2012-01-01)

The complexity of approximating the complex-valued Ising model on bounded degree graphs
af: Galanis, A, et al.
Udgivet: (2022)

Counting Independent Sets Using the Bethe Approximation
af: Chandrasekaran, Venkat, et al.
Udgivet: (2011)

Scalable Spectral Clustering With Nyström Approximation: Practical and Theoretical Aspects
af: Farhad Pourkamali-Anaraki
Udgivet: (2020-01-01)

The complexity of approximately counting retractions
af: Focke, J, et al.
Udgivet: (2020)

The complexity of approximately counting retractions
af: Focke, J, et al.
Udgivet: (2019)

Complex approximation /
af: Aupetit, Bernard, et al.
Udgivet: (1980)

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity
af: Zoe Leyva-Acosta, et al.
Udgivet: (2024-09-01)

Computational and approximate solutions of complex nonlinear Fokas–Lenells equation arising in optical fiber
af: Mostafa M.A. Khater, et al.
Udgivet: (2021-06-01)

Complexity Hierarchies and Higher-order Cons-free Term Rewriting
af: Cynthia Kop, et al.
Udgivet: (2017-08-01)

An overview on polynomial approximation of NP-hard problems
af: Paschos Vangelis Th.
Udgivet: (2009-01-01)

Optimal estimatiopn in approximation theory
af: 315787 Michelli, Charles A., et al.
Udgivet: (1977)

Faster exponential-time algorithms for approximately counting independent sets
af: Goldberg, L, et al.
Udgivet: (2021)

List Approximation for Increasing Kolmogorov Complexity
af: Marius Zimand
Udgivet: (2021-12-01)

ESTIMATION OF SOFTWARE COMPLEXITY OF CALCULATION OF AUTOREGRESSION COEFFICIENTS AT DIGITAL SPECTRAL ANALYSIS
af: Andrey Zuev, et al.
Udgivet: (2022-03-01)

Interpolation and approximation by rational functions in the complex domain /
af: 349555 Walsh, J. L.
Udgivet: (1969)

Complexity explained /
af: 298158
Udgivet: (2008)

Microwave Synthesis Under Solvent-Free Conditions and Spectral Studies of Some Mesoporphyrinic Complexes
af: Rica Boscencu
Udgivet: (2012-05-01)

Descriptive Complexity for Counting Complexity Classes
af: Marcelo Arenas, et al.
Udgivet: (2020-02-01)

Information-based complexity /
af: Traub, J. F. (Joseph Frederick), 1932-, et al.
Udgivet: (1988)

(Hyper)Graph Embedding and Classification via Simplicial Complexes
af: Alessio Martino, et al.
Udgivet: (2019-10-01)

Aluminium(I) anion-supported zero-valent palladium complexes
af: Yan, Chenting, et al.
Udgivet: (2024)

Complex Noise-Resistant Zeroing Neural Network for Computing Complex Time-Dependent Lyapunov Equation
af: Bolin Liao, et al.
Udgivet: (2022-08-01)

Separating quantum communication and approximate rank
af: Anshu, Anurag, et al.
Udgivet: (2018)

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
af: Hubie Chen, et al.
Udgivet: (2013-03-01)

The computational complexity of algebraic and numeric problems /
af: 306616 Borodin, Allan, et al.
Udgivet: (1975)

Theory of Complexity: Definitions, Models, and Applications /
af: Lopez-Ruiz, Ricardo, editor
Udgivet: (2021)

Computational complexity : a modern approach /
af: 440361 Arora, Sanjeev, et al.
Udgivet: (2009)

Automata, computability and complexity : theory and applications /
af: 233695 Rich, Elaine
Udgivet: (2008)

Computational complexity : a quantitative perspective /
af: 434047 Zimand, Marius
Udgivet: (2004)

Complexity and cryptography : an introduction /
af: 415062 Talbot, John, et al.
Udgivet: (2006)

Zero-inflated regression models with an application to vehicle theft count data
af: Zulkifli, Malina, et al.
Udgivet: (2012)

Approximability results for the $p$-centdian and the converse centdian problems
af: Yen Hung Chen
Udgivet: (2022-11-01)

Uncertainty and surprise in complex systems : questions on working with the unexpected /
af: McDaniel, Reuben R., et al.
Udgivet: (2005)

Computational complexity of vector maximisation over discrete sets/
af: 236988 Walker, John
Udgivet: (1995)