Singular relaxation of a random walk in a box with a Metropolis Monte Carlo dynamics

no code implementations • 15 Mar 2023 • Alexei D. Chepelianskii, Satya N. Majumdar, Hendrik Schawe, Emmanuel Trizac

We study analytically the relaxation eigenmodes of a simple Monte Carlo algorithm, corresponding to a particle in a box which moves by uniform random jumps.

Metropolis Monte Carlo sampling: convergence, localization transition and optimality

no code implementations • 21 Jul 2022 • Alexei D. Chepelianskii, Satya N. Majumdar, Hendrik Schawe, Emmanuel Trizac

Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost.

When open mindedness hinders consensus

1 code implementation • 19 Jan 2020 • Hendrik Schawe, Laura Hernández

We perform a detailed study of the Hegselmann-Krause bounded confidence opinion dynamics model with heterogeneous confidence $\varepsilon_i$ drawn from uniform distributions in different intervals $[\varepsilon_l, \varepsilon_u]$.

Physics and Society

Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming

no code implementations • 9 Feb 2017 • Hendrik Schawe, Roman Bleim, Alexander K. Hartmann

For branch and bound algorithms, which operate in the space of feasible Boolean configurations, the empirically hardest problems are located only close to this phase transition.