Antonio Blanca

Orcid: 0000-0002-4675-2596

According to our database1, Antonio Blanca authored at least 29 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fast and Perfect Sampling of Subgraphs and Polymer Systems.
ACM Trans. Algorithms, January, 2024

2023
On the tractability of sampling from the Potts model at low temperatures via Swendsen-Wang dynamics.
CoRR, 2023

Sampling from the Potts model at low temperatures via Swendsen-Wang dynamics.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case.
Proceedings of the Approximation, 2023

2022
The Statistics of k-mers from a Sequence Undergoing a Simple Mutation Process Without Spurious Matches.
J. Comput. Biol., 2022

The critical mean-field Chayes-Machta dynamics.
Comb. Probab. Comput., 2022

Identity Testing for High-Dimensional Distributions via Entropy Tensorization.
CoRR, 2022

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Sampling from Potts on Random Graphs of Unbounded Degree via Random-Cluster Dynamics.
Proceedings of the Approximation, 2022

2021
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models.
J. Mach. Learn. Res., 2021

Entropy decay in the Swendsen-Wang dynamics on ℤ<sup><i>d</i></sup>.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

The Swendsen-Wang Dynamics on Trees.
Proceedings of the Approximation, 2021

2020
Structure Learning of H-Colorings.
ACM Trans. Algorithms, 2020

Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs.
SIAM J. Discret. Math., 2020

Swendsen-Wang dynamics for general graphs in the tree uniqueness region.
Random Struct. Algorithms, 2020

Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models.
J. Mach. Learn. Res., 2020

Random-cluster dynamics on random graphs in tree uniqueness.
CoRR, 2020

2019
Spatial mixing and nonlocal Markov chains.
Random Struct. Algorithms, 2019

Phase Coexistence for the Hard-Core Model on ℤ2.
Comb. Probab. Comput., 2019

Random-Cluster Dynamics in Z<sup>2</sup>: Rapid Mixing with General Boundary Conditions.
Proceedings of the Approximation, 2019

2018
Spatial Mixing and Non-local Markov chains.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2016
Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$.
CoRR, 2016

Random-Cluster Dynamics in ℤ<sup>2</sup>.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Dynamics for the Mean-field Random-cluster Model.
Proceedings of the Approximation, 2015

2013
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2
CoRR, 2012

Efficient Generation ε-close to G(n,p) and Generalizations
CoRR, 2012

2011
On Universal Cycles for new Classes of Combinatorial Structures.
SIAM J. Discret. Math., 2011


  Loading...