AbstractThe so-called swapping algorithm was designed to simulate from spin glass distributions, among others. In this note we show that it mixes rapidly, in a very simple disordered system, the Hopfield model with two patterns
We discuss a non-reversible, lifted Markov-chain Monte Carlo (MCMC) algorithm for particle systems i...
nuloVile review some recent rigorous results in the theory of neural networks, and in particular on ...
We prove a large deviation principle for the finite dimensional marginals of the Gibbs distribution ...
The so-called swapping algorithm was designed to simulate from spin glass distributions, among other...
Abstract. In this note we show that the so-called Swapping algorithm mixes slowly in two simple diso...
We study a "two-pattern" Hopfield model with Gaussian disorder. We find that there are infinitely ma...
Simulated tempering and swapping are two families of sampling algorithms in which a parameter repres...
We study the Hopfield model of an autoassociative memory on a random graph on N vertices where the p...
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on g...
We investigate the fluctuations of the order parameter in the Hopfield model of spin glasses and neu...
In this paper we study the relationships between two Markov Chain Monte Carlo algorithms--the Swappi...
AbstractIn this paper we study the relationships between two Markov Chain Monte Carlo algorithms—the...
We obtain upper bounds on the spectral gap of Markov chains constructed by parallel and simulated te...
We review some recent rigorous results in the theory of neural networks, and in particular on the th...
In this paper, we relate the coupling of Markov chains, at the basis of perfect sampling methods, wi...
We discuss a non-reversible, lifted Markov-chain Monte Carlo (MCMC) algorithm for particle systems i...
nuloVile review some recent rigorous results in the theory of neural networks, and in particular on ...
We prove a large deviation principle for the finite dimensional marginals of the Gibbs distribution ...
The so-called swapping algorithm was designed to simulate from spin glass distributions, among other...
Abstract. In this note we show that the so-called Swapping algorithm mixes slowly in two simple diso...
We study a "two-pattern" Hopfield model with Gaussian disorder. We find that there are infinitely ma...
Simulated tempering and swapping are two families of sampling algorithms in which a parameter repres...
We study the Hopfield model of an autoassociative memory on a random graph on N vertices where the p...
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on g...
We investigate the fluctuations of the order parameter in the Hopfield model of spin glasses and neu...
In this paper we study the relationships between two Markov Chain Monte Carlo algorithms--the Swappi...
AbstractIn this paper we study the relationships between two Markov Chain Monte Carlo algorithms—the...
We obtain upper bounds on the spectral gap of Markov chains constructed by parallel and simulated te...
We review some recent rigorous results in the theory of neural networks, and in particular on the th...
In this paper, we relate the coupling of Markov chains, at the basis of perfect sampling methods, wi...
We discuss a non-reversible, lifted Markov-chain Monte Carlo (MCMC) algorithm for particle systems i...
nuloVile review some recent rigorous results in the theory of neural networks, and in particular on ...
We prove a large deviation principle for the finite dimensional marginals of the Gibbs distribution ...
DOI
Add to ORKG