Fast Condensation in a tunable Backgammon model
| dc.creator | Narasimhan, S. L. | |
| dc.date | 2006-01-24 | |
| dc.date.accessioned | 2026-07-07T06:57:45Z | |
| dc.date.available | 2026-07-07T06:57:45Z | |
| dc.description | We present a Monte Carlo study of the Backgammon model, at zero temperature, in which a departure box is chosen at random with a probability proportional to $(2ω- 1)k + (1 - ω)N$, where $k$ is the number of particles in the departure box and $N$ is the total number of particles (equivalently, boxes) in the system. The parameter $ω\in [0,1]$ tunes the dynamics from being slow ($ω= 1$) to being fast ($ω= 0$). This parametrization tacitly assumes a two-box representation for the system at any instant of time and $ω$ is formally related to the 'memory' parameter of a correlated binary sequence. For $ω< 1/2$, the system undergoes a fast condensation beyond a certain time that depends on $ω$ and the system size $N$. This condensation provides an interesting contrast to that studied with Zeta Urn model in that the probability that a box contains $k$ particles evolves differently in the model discussed here. | |
| dc.description | Five page RevTeX file, seven eps figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0601532 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0601532 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/107085 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Fast Condensation in a tunable Backgammon model | |
| dc.type | text |