Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Swendsen–Wang_algorithm> ?p ?o }
Showing triples 1 to 27 of
27
with 100 triples per page.
- Swendsen–Wang_algorithm abstract "The Swendsen–Wang algorithm is an algorithm for Monte Carlo simulation of the Ising model in which the entire sample is divided into same-spin clusters. Each cluster is then assigned a new random spin value. Compare the Wolff algorithm.It is one of the first algorithms based on global changes to the system in a single sweep of moves. The original algorithm was designed for the Ising and Potts models, and later it was generalized to other systems as well, such as the XY model by Wolff algorithm and particles of fluids. A key ingredient of the method is based on the representation of the Ising or Potts model through percolation models of connecting bonds due to Fortuin and Kasteleyn. These bonds form so-called clusters. Nearest sites of equal-spins are joined together by the bonds with a probability, P=1-exp(-2J/(kBT)), where J is the coupling constant for the ferromagnetic Ising model, T is temperature, and kB is Boltzmann constant. The clusters are then “flipped” together with equal probabilities. The method is most efficient near a second-order phase transition point, overcoming the critical slowing down.It has been generalized by Barbu and Zhu (2005) to sampling arbitrary probabilities by viewing it as a Metropolis–Hastings algorithm and computing the acceptance probability of the proposed Monte Carlo move.".
- Swendsen–Wang_algorithm wikiPageExternalLink monte-en.html.
- Swendsen–Wang_algorithm wikiPageExternalLink node69.html.
- Swendsen–Wang_algorithm wikiPageID "21888215".
- Swendsen–Wang_algorithm wikiPageLength "2244".
- Swendsen–Wang_algorithm wikiPageOutDegree "8".
- Swendsen–Wang_algorithm wikiPageRevisionID "656200349".
- Swendsen–Wang_algorithm wikiPageWikiLink Algorithm.
- Swendsen–Wang_algorithm wikiPageWikiLink Category:Monte_Carlo_methods.
- Swendsen–Wang_algorithm wikiPageWikiLink Category:Statistical_mechanics.
- Swendsen–Wang_algorithm wikiPageWikiLink Ising_model.
- Swendsen–Wang_algorithm wikiPageWikiLink Metropolis–Hastings_algorithm.
- Swendsen–Wang_algorithm wikiPageWikiLink Monte_Carlo_method.
- Swendsen–Wang_algorithm wikiPageWikiLink Monte_Carlo_simulation.
- Swendsen–Wang_algorithm wikiPageWikiLink Wolff_algorithm.
- Swendsen–Wang_algorithm wikiPageWikiLinkText "Swendsen–Wang algorithm".
- Swendsen–Wang_algorithm hasPhotoCollection Swendsen–Wang_algorithm.
- Swendsen–Wang_algorithm wikiPageUsesTemplate Template:Physics-stub.
- Swendsen–Wang_algorithm subject Category:Monte_Carlo_methods.
- Swendsen–Wang_algorithm subject Category:Statistical_mechanics.
- Swendsen–Wang_algorithm comment "The Swendsen–Wang algorithm is an algorithm for Monte Carlo simulation of the Ising model in which the entire sample is divided into same-spin clusters. Each cluster is then assigned a new random spin value. Compare the Wolff algorithm.It is one of the first algorithms based on global changes to the system in a single sweep of moves.".
- Swendsen–Wang_algorithm label "Swendsen–Wang algorithm".
- Swendsen–Wang_algorithm sameAs m.05pc7lq.
- Swendsen–Wang_algorithm sameAs Q7655875.
- Swendsen–Wang_algorithm sameAs Q7655875.
- Swendsen–Wang_algorithm wasDerivedFrom Swendsen–Wang_algorithm?oldid=656200349.
- Swendsen–Wang_algorithm isPrimaryTopicOf Swendsen–Wang_algorithm.