| Publication | Date of Publication | Type |
|---|
Optimal mixing via tensorization for random independent sets on arbitrary trees
Combinatorics, Probability and Computing | 2025-12-29 | Paper |
| Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model | 2025-08-06 | Paper |
| Optimal mixing via tensorization for random independent sets on arbitrary trees | 2025-01-14 | Paper |
| On the mixing time of Glauber dynamics for the hard-core and related models on \(G(n,d/n)\) | 2024-11-14 | Paper |
| Broadcasting with random matrices | 2024-11-14 | Paper |
| On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs | 2024-06-24 | Paper |
| Broadcasting with Random Matrices | 2023-02-22 | Paper |
| On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n) | 2023-02-13 | Paper |
scientific article; zbMATH DE number 7650115 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Spectral Independence Beyond Uniqueness using the topological method | 2022-11-07 | Paper |
Charting the replica symmetric phase
(available as arXiv preprint) | 2021-07-28 | Paper |
Deterministic counting of graph colourings using sequences of subgraphs
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
MCMC sampling colourings and independent sets of \(G(n, d/n)\) near uniqueness threshold
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A simple algorithm for random colouring \(G(n, d/n)\) using \((2 + \epsilon)d\) colours
(available as arXiv preprint) | 2019-05-10 | Paper |
| A simple algorithm for random colouring \(G(n, d/n)\) using \((2 + \epsilon)d\) colours | 2019-05-10 | Paper |
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
SIAM Journal on Computing | 2019-05-07 | Paper |
Local convergence of random graph colorings
Combinatorica | 2018-07-23 | Paper |
Local convergence of random graph colorings
Combinatorica | 2018-07-23 | Paper |
Charting the replica symmetric phase
Communications in Mathematical Physics | 2018-05-16 | Paper |
| Sampling random colorings of sparse random graphs | 2018-03-15 | Paper |
Sampling random colorings of sparse random graphs
(available as arXiv preprint) | 2018-03-15 | Paper |
Planting colourings silently
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
| On independent sets in random graphs | 2017-09-29 | Paper |
Reconstruction/non-reconstruction thresholds for colourings of general Galton-Watson trees
(available as arXiv preprint) | 2017-08-31 | Paper |
| Local convergence of random graph colorings | 2017-08-31 | Paper |
A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold
SIAM Journal on Computing | 2016-12-13 | Paper |
Random instances of problems in NP -- algorithms and statistical physics
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
On the chromatic number of random regular graphs
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
On independent sets in random graphs
Random Structures & Algorithms | 2015-11-13 | Paper |
Switching colouring of \(G(n,d/n)\) for sampling up to Gibbs uniqueness threshold
Algorithms - ESA 2014 | 2014-10-08 | Paper |
| Broadcasting colourings on trees. A combinatorial view | 2012-06-15 | Paper |
Sharp thresholds for Hamiltonicity in random intersection graphs
Theoretical Computer Science | 2010-10-11 | Paper |
Random sampling of colourings of sparse random graphs with a constant number of colours
Theoretical Computer Science | 2008-11-18 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs
(available as arXiv preprint) | N/A | Paper |
On sampling diluted Spin Glasses using Glauber dynamics
(available as arXiv preprint) | N/A | Paper |
