Guillem Perarnau

1. Improved Bounds for Randomly Sampling Colorings via Linear Programming
   2018/10/30 by Sitan Chen, Chen, Sitan, Michelle Delcourt +7 · 2 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Machine Learning and Algorithms #Markov Chains and Monte Carlo Methods #Mathematical Physics (math-ph) #Probability (math.PR)
2. The Lonely Runner Conjecture turns 60
   2024/09/30 by Guillem Perarnau, Perarnau, Guillem, Oriol Serra +1 · 4 citations
   Computer Science · #Computability, Logic, AI Algorithms #Advanced Graph Theory Research #Artificial Intelligence in Games
3. A Rainbow Dirac's Theorem
   2018/09/17 by Matthew Coulson, Coulson, Matthew, Guillem Perarnau +1 · 3 citations
   Mathematics · Engineering · #Limits and Structures in Graph Theory #graph theory and CDMA systems #Finite Group Theory Research
4. Correlation among runners and some results on the Lonely Runner\n Conjecture
   2014/07/12 by Guillem Perarnau, Perarnau, Guillem, Oriol Serra +1 · 1 citation
   Computer Science · Mathematics · #Artificial Intelligence in Games #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Mathematical Dynamics and Fractals #Number Theory (math.NT)
5. The diameter of the directed configuration model
   2020/03/10 by Xing Shi Cai, Cai, Xing Shi, Guillem Perarnau +1 · 1 citation
   Mathematics · Physics and Astronomy · #60C05 #Complex Network Analysis Techniques #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.3 #Probability (math.PR) #Random Matrices and Applications #Stochastic processes and statistical mechanics
6. Rankings in directed configuration models with heavy tailed in-degrees
   2021/04/16 by Xing Shi Cai, Pietro Caputo, Cai, Xing Shi +5 · 1 citation
   Mathematics · Physics and Astronomy · #60C05 #Combinatorics (math.CO) #Complex Network Analysis Techniques #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #Stochastic processes and statistical mechanics
7. An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
   2025/01/20 by Lucas De Meyer, De Meyer, Lucas, František Kardoš +5 · 1 citation
   Computer Science · #Machine Learning and Algorithms