Fast sampling via spectral independence beyond bounded-degree graphs

Fast sampling via spectral independence beyond bounded-degree graphs

Show other versions (1)

Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal O(n log n) sampling algorithms on bounded-degree graphs for a large class of problems throughout the so-called uniquene...

Bibliografske podrobnosti
Main Authors:	Bezakova, I, Galanis, A, Goldberg, L, Stefankovic, D
Format:	Conference item
Jezik:	English
Izdano:	Leibniz International Proceedings in Informatics 2022

Podobne knjige/članki

Fast sampling via spectral independence beyond bounded-degree graphs
od: Bezáková, I, et al.
Izdano: (2024)

Inapproximability of the independent set polynomial in the complex plane
od: Bezakova, I, et al.
Izdano: (2018)

Inapproximability of the independent set polynomial in the complex plane
od: Bezáková, I, et al.
Izdano: (2020)

Fast mixing via polymers for random graphs with unbounded degree
od: Galanis, A, et al.
Izdano: (2022)

Fast mixing via polymers for random graphs with unbounded degree
od: Galanis, A, et al.
Izdano: (2021)

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
od: Goldberg, L, et al.
Izdano: (2015)

Approximation via correlation decay when strong spatial mixing fails
od: Bezakova, I, et al.
Izdano: (2019)

Approximation via correlation decay when strong spatial mixing fails
od: Bezakova, I, et al.
Izdano: (2016)

The complexity of approximating the matching polynomial in the complex plane
od: Bezakova, I, et al.
Izdano: (2021)

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

Implementations and the independent set polynomial below the Shearer threshold
od: Galanis, A, et al.
Izdano: (2022)

Inapproximability of the independent set polynomial below the Shearer threshold
od: Galanis, A, et al.
Izdano: (2017)

Sampling in iniqueness from the Potts and random-cluster models on random regular graphs
od: Blanca, A, et al.
Izdano: (2020)

Sampling in uniqueness from the potts and random-cluster models on random regular graphs
od: Blanca, A, et al.
Izdano: (2018)

PTAS for maximum weight independent set problem with random weights in bounded degree graphs
od: Gamarnik, David, et al.
Izdano: (2012)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
od: Goldberg, L, et al.
Izdano: (2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
od: Goldberg, L, et al.
Izdano: (2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
od: Galanis, A, et al.
Izdano: (2015)

Approximating partition functions of bounded- degree Boolean counting Constraint Satisfaction Problems
od: Galanis, A, et al.
Izdano: (2017)

Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
od: Galanis, A, et al.
Izdano: (2020)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
od: Galanis, A, et al.
Izdano: (2024)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
od: Galanis, A, et al.
Izdano: (2023)

On the treewidths of graphs of bounded degree.
od: Yinglei Song, et al.
Izdano: (2015-01-01)

Bounding Extremal Degrees of Edge-Independent Random Graphs Using Relative Entropy
od: Yilun Shang
Izdano: (2016-02-01)

Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs.
od: Péter L Erdős, et al.
Izdano: (2018-01-01)

Metastability of the Potts ferromagnet on random regular graphs
od: Coja-Oghlan, A, et al.
Izdano: (2022)

Metastability of the Potts ferromagnet on random regular graphs
od: Coja-Oghlan, A, et al.
Izdano: (2023)

Judicious partitions of bounded-degree graphs
od: Bollob�s, B, et al.
Izdano: (2004)

Acyclic colourings of graphs with bounded degree
od: Mieczyslaw Borowiecki, et al.
Izdano: (2010-01-01)

Cycle transversals in bounded degree graphs
od: Marina Groshaus, et al.
Izdano: (2011-03-01)

New Bounds For Degree Sequence Of Graphs
od: Akbar Jahanbani
Izdano: (2019-09-01)

Metric uniformization and spectral bounds for graphs
od: Kelner, Jonathan Adam, et al.
Izdano: (2012)

Bounds for the Laplacian spectral radius of graphs
od: Kamal Lochan Patra, et al.
Izdano: (2017-10-01)

Subdomination in Graphs with Upper-Bounded Vertex Degree
od: Darya Lemtyuzhnikova, et al.
Izdano: (2023-06-01)

3-Paths in Graphs with Bounded Average Degree
od: Jendrol Stanislav, et al.
Izdano: (2016-05-01)

Fast Spectral Clustering via Efficient Multilayer Anchor Graph
od: Yiwei Wei, et al.
Izdano: (2024-01-01)

New bounds on domination and independence in graphs
od: Jochen Harant, et al.
Izdano: (2023-01-01)

On Selkow’s Bound on the Independence Number of Graphs
od: Harant Jochen, et al.
Izdano: (2019-08-01)

Acyclic improper colourings of graphs with bounded maximum degree
od: Addario-Berry, L, et al.
Izdano: (2010)

A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
od: Rana Khoeilar, et al.
Izdano: (2020-12-01)