Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Q5159424 - MaRDI portal

No label defined (Q5159424)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7415095

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7415095

Statements

scholarly article

0 references

0 references

0 references

Daniel Štefanković

0 references

0 references

publication date

27 October 2021

0 references

full work available at URL

https://arxiv.org/abs/2004.10805

0 references

https://jmlr.csail.mit.edu/papers/v22/20-1162.html

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

distribution testing

0 references

identity testing

0 references

graphical models

0 references

restricted Boltzmann machines

0 references

Potts model

0 references

MaRDI profile type

MaRDI publication profile

0 references

Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models

0 references

Dynamics for the mean-field random-cluster model

0 references

The Complexity of Distinguishing Markov Random Fields

0 references

The random-cluster model on the complete graph

0 references

Efficiently Learning Ising Models on Arbitrary Graphs

0 references

Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms

0 references

Learning restricted Boltzmann machines via influence maximization

0 references

The expressibility of functions on the boolean domain, with applications to counting CSPs

0 references

\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region

0 references

The complexity of approximating conservative counting CSPs

0 references

The worm process for the Ising model is rapidly mixing

0 references

Information Theory and Statistics: A Tutorial

0 references

Glauber dynamics for the mean-field Potts model

0 references

Testing Ising Models

0 references

Continuity of the phase transition for planar random-cluster and Potts models with \({1 \leq q \leq 4}\)

0 references

The relative complexity of approximate counting problems

0 references

An approximation trichotomy for Boolean \#CSP

0 references

Swendsen-Wang Algorithm on the Mean-Field Potts Model

0 references

Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard

0 references

Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results

0 references

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models

0 references

0 references

Gibbs measures and phase transitions.

0 references

Exponentially slow mixing in the mean-field Swendsen-Wang dynamics

0 references

The Complexity of Ferromagnetic Ising with Local Fields

0 references

Approximating the Partition Function of the Ferromagnetic Potts Model

0 references

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

0 references

The Random-Cluster Model

0 references

Random cluster dynamics for the Ising model is rapidly mixing

0 references

Training Products of Experts by Minimizing Contrastive Divergence

0 references

A Fast Learning Algorithm for Deep Belief Nets

0 references

Polynomial-Time Approximation Algorithms for the Ising Model

0 references

Random generation of combinatorial structures from a uniform distribution

0 references

The phase transition in the cluster‐scaled model of a random graph

0 references

Computational implications of reducing data to sufficient statistics

0 references

0 references

0 references

Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions

0 references

Adaptive simulated annealing: A near-optimal connection between sampling and counting

0 references

The Complexity of Counting in Sparse, Regular, and Planar Graphs

0 references

The Complexity of Enumeration and Reliability Problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5159424

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5159424&oldid=36725931"