Charilaos Efthymiou

47 papers A* 10A 2Journal 29Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
On sampling diluted Spin-Glasses with unbounded interactions.
CoRR
Charilaos Efthymiou, Kostas Zampetakis
2026 A* conf
On sampling two spin models using the local connective constant.
SODA
Charilaos Efthymiou
2025 J jnl
Optimal mixing via tensorization for random independent sets on arbitrary trees.
Comb. Probab. Comput.
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2024 J jnl
On sampling diluted Spin Glasses using Glauber dynamics.
CoRR
Charilaos Efthymiou, Kostas Zampetakis
2024 A* conf
On sampling diluted Spin-Glasses using Glauber Dynamics.
COLT
Charilaos Efthymiou, Kostas Zampetakis
2024 J jnl
On sampling two spin models using the local connective constant.
CoRR
Charilaos Efthymiou
2023 A* conf
Broadcasting with Random Matrices.
ICALP
Charilaos Efthymiou, Kostas Zampetakis
2023 J jnl
Broadcasting with Random Matrices.
CoRR
Charilaos Efthymiou, Kostas Zampetakis
2023 A* conf
On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n).
ICALP
Charilaos Efthymiou, Weiming Feng
2023 J jnl
On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n, d/n).
CoRR
Charilaos Efthymiou, Weiming Feng
2023 A conf
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees.
APPROX/RANDOM
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2023 J jnl
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees.
CoRR
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2022 A* conf
On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs.
ICALP
Charilaos Efthymiou
2022 J jnl
Spectral Independence Beyond Uniqueness using the topological method.
CoRR
Charilaos Efthymiou
2020 J jnl
Deterministic counting of graph colourings using sequences of subgraphs.
Comb. Probab. Comput.
Charilaos Efthymiou
2020 J jnl
On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs.
CoRR
Charilaos Efthymiou
2019 J jnl
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.
SIAM J. Comput.
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
2019 — conf
Improved Strong Spatial Mixing for Colorings on Trees.
APPROX-RANDOM
Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2019 J jnl
Improved Strong Spatial Mixing for Colorings on Trees.
CoRR
Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2018 J jnl
Local Convergence of Random Graph Colorings.
Comb.
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari
2018 — book
Phase transitions and dynamics for random constraint satisfaction problems
Charilaos Efthymiou
2018 A* conf
Sampling Random Colorings of Sparse Random Graphs.
SODA
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2017 — conf
Charting the Replica Symmetric Phase.
APPROX-RANDOM
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos
2017 J jnl
Charting the replica symmetric phase.
CoRR
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos
2017 J jnl
Planting Colourings Silently.
Comb. Probab. Comput.
Victor Bapst, Amin Coja-Oghlan, Charilaos Efthymiou
2017 J jnl
Sampling Random Colorings of Sparse Random Graphs.
CoRR
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2016 J jnl
A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold.
SIAM J. Comput.
Charilaos Efthymiou
2016 J jnl
A simple algorithm for sampling colourings of G(n, d/n) up to Gibbs Uniqueness Threshold.
CoRR
Charilaos Efthymiou
2016 A* conf
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.
FOCS
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
2016 J jnl
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.
CoRR
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
2016 J jnl
On the chromatic number of random regular graphs.
J. Comb. Theory B
Amin Coja-Oghlan, Charilaos Efthymiou, Samuel Hetterich
2015 — conf
Local Convergence of Random Graph Colorings.
APPROX-RANDOM
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari
2015 J jnl
Local convergence of random graph colorings.
CoRR
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari
2015 J jnl
On independent sets in random graphs.
Random Struct. Algorithms
Amin Coja-Oghlan, Charilaos Efthymiou
2015 — conf
Random Instances of Problems in NP - Algorithms and Statistical Physics.
Algorithms, Probability, Networks, and Games
Charilaos Efthymiou
2015 — conf
Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees.
APPROX-RANDOM
Charilaos Efthymiou
2014 A* conf
MCMC sampling colourings and independent sets of
SODA
Charilaos Efthymiou
2014 J jnl
Planting colourings silently.
CoRR
Victor Bapst, Amin Coja-Oghlan, Charilaos Efthymiou
2014 J jnl
Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees.
CoRR
Charilaos Efthymiou
2014 A conf
Switching Colouring of G(n, d/n) for Sampling up to Gibbs Uniqueness Threshold.
ESA
Charilaos Efthymiou
2013 J jnl
MCMC sampling colourings and independent sets of G(n,d/n) near the uniqueness threshold
CoRR
Charilaos Efthymiou
2012 A* conf
A simple algorithm for random colouring
SODA
Charilaos Efthymiou
2012 J jnl
Broadcasting colourings on trees. A combinatorial view
CoRR
Charilaos Efthymiou
2011 J jnl
A simple algorithm for random colouring G(n, d/n) using (2+ε)d colours
CoRR
Charilaos Efthymiou
2011 A* conf
On independent sets in random graphs.
SODA
Amin Coja-Oghlan, Charilaos Efthymiou
2010 J jnl
On independent sets in random graphs
CoRR
Amin Coja-Oghlan, Charilaos Efthymiou
2009 J jnl
Deterministic counting of graph colourings using sequences of subgraphs
CoRR
Charilaos Efthymiou