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 database1, Charilaos Efthymiou authored at least 26 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2023
Broadcasting with Random Matrices.
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).
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees.
Proceedings of the Approximation, 2023

2022
Spectral Independence Beyond Uniqueness using the topological method.
CoRR, 2022

On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020
Deterministic counting of graph colourings using sequences of subgraphs.
Comb. Probab. Comput., 2020

2019
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.
SIAM J. Comput., 2019

Improved Strong Spatial Mixing for Colorings on Trees.
Proceedings of the Approximation, 2019

2018
Phase transitions and dynamics for random constraint satisfaction problems
, 2018

Local Convergence of Random Graph Colorings.
Comb., 2018

Sampling Random Colorings of Sparse Random Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Planting Colourings Silently.
Comb. Probab. Comput., 2017

Charting the Replica Symmetric Phase.
Proceedings of the Approximation, 2017

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

On the chromatic number of random regular graphs.
J. Comb. Theory, Ser. B, 2016

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

2015
On independent sets in random graphs.
Random Struct. Algorithms, 2015

Random Instances of Problems in NP - Algorithms and Statistical Physics.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees.
Proceedings of the Approximation, 2015

2014
MCMC sampling colourings and independent sets of <i>G</i>(<i>n, d</i>/<i>n</i>) near uniqueness threshold.
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.
Proceedings of the Algorithms - ESA 2014, 2014

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

2012
Broadcasting colourings on trees. A combinatorial view
CoRR, 2012

A simple algorithm for random colouring <i>G</i>(<i>n, d/n</i>) using (2 + ε)<i>d</i> colours.
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
CoRR, 2011


  Loading...