Charilaos Efthymiou

Orcid: 0000-0002-5343-3251

Affiliations:

University of Warwick, Mathematics and Computer Science, Coventry, UK
Johann Wolfgang Goethe University, Mathematics Institute, Frankfurt, Germany (habil 2018)
Georgia Institute of Technology, College of Computing, Atlanta, GA, USA

According to our database¹, Charilaos Efthymiou authored at least 27 papers between 2011 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Spectral Independence Beyond Uniqueness with. the topological method - An extended view.

[BibT_eX]

[DOI]

Charilaos Efthymiou

CoRR, 2024

On sampling diluted Spin-Glasses using Glauber Dynamics.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Kostas Zampetakis

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Broadcasting with Random Matrices.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Kostas Zampetakis

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n).

[BibT_eX]

[DOI]

Charilaos Efthymiou

Weiming Feng

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Spectral Independence Beyond Uniqueness using the topological method.

[BibT_eX]

[DOI]

Charilaos Efthymiou

CoRR, 2022

On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020

Deterministic counting of graph colourings using sequences of subgraphs.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Comb. Probab. Comput., 2020

2019

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Improved Strong Spatial Mixing for Colorings on Trees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

2018

Phase transitions and dynamics for random constraint satisfaction problems

[BibT_eX]

[DOI]

Charilaos Efthymiou

, 2018

Local Convergence of Random Graph Colorings.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Charilaos Efthymiou

Nor Jaafari

Comb., 2018

Sampling Random Colorings of Sparse Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Planting Colourings Silently.

[BibT_eX]

[DOI]

Victor Bapst

Amin Coja-Oghlan

Charilaos Efthymiou

Comb. Probab. Comput., 2017

Charting the Replica Symmetric Phase.

[BibT_eX]

[DOI]

Tobias Kapetanopoulos

Proceedings of the Approximation, 2017

2016

A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold.

[BibT_eX]

[DOI]

Charilaos Efthymiou

SIAM J. Comput., 2016

On the chromatic number of random regular graphs.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Charilaos Efthymiou

Samuel Hetterich

J. Comb. Theory B, 2016

A simple algorithm for sampling colourings of G(n, d/n) up to Gibbs Uniqueness Threshold.

[BibT_eX]

[DOI]

Charilaos Efthymiou

CoRR, 2016

2015

On independent sets in random graphs.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Charilaos Efthymiou

Random Struct. Algorithms, 2015

Random Instances of Problems in NP - Algorithms and Statistical Physics.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Proceedings of the Algorithms, Probability, Networks, and Games, 2015

Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Proceedings of the Approximation, 2015

2014

MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Switching Colouring of G(n, d/n) for Sampling up to Gibbs Uniqueness Threshold.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Proceedings of the Algorithms - ESA 2014, 2014

2013

MCMC sampling colourings and independent sets of G(n,d/n) near the uniqueness threshold

[BibT_eX]

[DOI]

Charilaos Efthymiou

CoRR, 2013

2012

Broadcasting colourings on trees. A combinatorial view

[BibT_eX]

[DOI]

Charilaos Efthymiou

CoRR, 2012

A simple algorithm for random colouring G(n, d/n) using (2 + ε)d colours.

[BibT_eX]

[DOI]

Charilaos Efthymiou

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

A simple algorithm for random colouring G(n, d/n) using (2+ε)d colours

[BibT_eX]

[DOI]

Charilaos Efthymiou

CoRR, 2011

Charilaos Efthymiou

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...