Analyzing Glauber dynamics by comparison of Markov chains
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2000/03/01
-
Journal
-
Indian UGC (journal)
-
Refrences39
-
Citations46
-
Dana Randall College of Computing and School of Mathematics, Georgia Institute of Technology, Atlanta Georgia 30332
-
Prasad Tetali School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia 30332
Abstract
Cite
Randall, Dana, and Prasad Tetali. “Analyzing Glauber Dynamics by Comparison of Markov Chains”. Journal of Mathematical Physics, vol. 41, no. 3, 2000, pp. 1598-15, https://doi.org/10.1063/1.533199.
Randall, D., & Tetali, P. (2000). Analyzing Glauber dynamics by comparison of Markov chains. Journal of Mathematical Physics, 41(3), 1598-1615. https://doi.org/10.1063/1.533199
Randall D, Tetali P. Analyzing Glauber dynamics by comparison of Markov chains. Journal of Mathematical Physics. 2000;41(3):1598-615.
Journal Categories
Science
Mathematics
Science
Physics
You May Also Like
- The “transition probability” in the state space of a ∗-algebra
- Linear transformations which preserve trace and positive semidefiniteness of operators
- Reduction of symplectic manifolds with symmetry
- Long-Time Asymptotics for the Korteweg–de Vries Equation via Nonlinear Steepest Descent
- Well-posedness for Semi-relativistic Hartree Equations of Critical Type
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Random sampling for the monomer–dimer model on a lattice | Journal of Mathematical Physics |
| 7 | 2000 |
| Fast convergence of the Glauber dynamics for sampling independent sets | 1999 | |||
| Lectures on finite Markov chains | 1997 | |||
| Approximating the number of dimer coverings of a lattice | 1996 | |||
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph | Random Structures & Algorithms |
| 104 | 1995 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations | SIAM Journal on Discrete Mathematics |
| 2024 | |
Fluctuation of the phase boundary in the six-vertex model with domain wall boundary conditions: a Monte Carlo study | Journal of Physics A: Mathematical and Theoretical |
| 1 | 2023 |
| Critical dynamical behavior of the Ising model | Physical Review E |
| 2023 | |
Mixing times of Markov chains for self‐organizing lists and biased permutations | Random Structures & Algorithms |
| 2022 | |
| Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs | Probability Theory and Related Fields |
| 1 | 2022 |
Citations Analysis
The category
Science: Mathematics 32
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Markov Chain Algorithms for Planar Lattice Structures and was published in 2001. The most recent citation comes from a 2024 study titled Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations. This article reached its peak citation in 2004, with 4 citations. It has been cited in 25 different journals. Among related journals, the Random Structures & Algorithms cited this research the most, with 9 citations. The chart below illustrates the annual citation trends for this article.