Sciweavers

PROCEDIA
2010
90views more  PROCEDIA 2010»
13 years 2 months ago
Statistical mechanics of rumour spreading in network communities
We report a preliminary investigation on interactions between networked social communities using the Ising model to
Massimo Ostilli, Eiko Yoneki, Ian X. Y. Leung, Jos...
BROADBAND
1998
13 years 5 months ago
Superposition of Markov sources and long range dependence
This paper introduces a model to study the phenomenon of long range dependence. This model consists of an infinite superposition of independent Markovian ON/OFF
Floris Geerts, Chris Blondia
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 5 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
SODA
2004
ACM
74views Algorithms» more  SODA 2004»
13 years 5 months ago
Torpid mixing of simulated tempering on the Potts model
Simulated tempering and swapping are two families of sampling algorithms in which a parameter representing temperature varies during the simulation. The hope is that this will ove...
Nayantara Bhatnagar, Dana Randall
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 5 months ago
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
Elchanan Mossel, Allan Sly
PPSN
2004
Springer
13 years 9 months ago
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes
The investigation of evolutionary algorithms as adaptation schemes has a long history starting with Holland (1975). The Ising model from physics leads to a variety of different pr...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
GECCO
2004
Springer
13 years 9 months ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer