Clustering and Mixing Times for Segregation Models on ℤ2
暂无分享,去创建一个
[1] Dana Randall,et al. Sampling spin configurations of an Ising system , 1999, SODA '99.
[2] George Barmpalias,et al. Digital morphogenesis via Schelling segregation , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[3] Dana Randall,et al. Convergence rates of Markov chains for some self-assembly and non-saturated Ising models , 2009, Theor. Comput. Sci..
[4] Alistair Sinclair,et al. Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.
[5] Dana Randall,et al. Sampling biased lattice configurations using exponential metrics , 2009, SODA.
[6] D. Stauffer,et al. Ising, Schelling and self-organising segregation , 2007, physics/0701051.
[7] Sylvain Barde. Back to the future: a simple solution to schelling segregation , 2011 .
[8] Junfu Zhang,et al. A DYNAMIC MODEL OF RESIDENTIAL SEGREGATION , 2004 .
[9] Carsten Schneider,et al. Computing the complexity for Schelling segregation models , 2008 .
[10] Allan Sly,et al. Critical Ising on the Square Lattice Mixes in Polynomial Time , 2010, 1001.1613.
[11] Errico Presutti,et al. Scaling Limits in Statistical Mechanics and Microstructures in Continuum Mechanics , 2008 .
[12] L. Chayes. Mean Field Analysis of Low–Dimensional Systems , 2009 .
[13] Martin E. Dyer,et al. Faster random generation of linear extensions , 1999, SODA '98.
[14] Sebastian Grauwin,et al. Dynamic Models of Residential Ségrégation: An Analytical Solution , 2010 .
[15] Wolff,et al. Collective Monte Carlo updating for spin systems. , 1989, Physical review letters.
[16] Dana Randall,et al. Clustering in Interfering Binary Mixtures , 2011, APPROX-RANDOM.
[17] Mark Jerrum,et al. Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..
[18] Dana Randall,et al. Slow mixing of glauber dynamics via topological obstructions , 2006, SODA '06.
[19] A. Kirman,et al. A physical analogue of the Schelling model , 2006, Proceedings of the National Academy of Sciences.
[20] H. Peyton Young,et al. Individual Strategy and Social Structure , 2020 .
[21] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.
[22] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.
[23] Tim Rogers,et al. A unified framework for Schelling’s model of segregation , 2011, ArXiv.
[24] H. Young,et al. Individual Strategy and Social Structure: An Evolutionary Theory of Institutions , 1999 .
[25] Wang,et al. Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.
[26] Nicholas Crawford,et al. Mean-Field Driven First-Order Phase Transitions in Systems with Long-Range Interactions , 2005, math-ph/0501067.
[27] V. Climenhaga. Markov chains and mixing times , 2013 .
[28] Nicole Immorlica,et al. An analysis of one-dimensional schelling segregation , 2012, STOC '12.
[29] Marek Biskup,et al. Rigorous Analysis of Discontinuous Phase Transitions via Mean-Field Bounds , 2003 .
[30] P. Flajolet. On approximate counting , 1982 .
[31] S. Grauwin,et al. Dynamic Models of Residential Segregation: Brief Review - Analytical Resolution and Study of the Introduction of Coordination , 2009, 0907.1777.
[32] Thomas C. Schelling,et al. Dynamic models of segregation , 1971 .
[33] D. Stauffer. Social applications of two-dimensional Ising models , 2007, 0706.3983.