Scaling of Ergodicity in Binary Systems

Simple item page
dc.creatorSüzen, M.
dc.date2009-04-20
dc.date.accessioned2026-07-07T13:06:45Z
dc.date.available2026-07-07T13:06:45Z
dc.descriptionGiven pseudo-random binary sequence of length $L$, assuming it consists of $k$ sub-sequences of length $N$. We estimate how $k$ scales with growing $N$ to obtain a {\it limiting} ergodic behaviour, to fulfill the basic definition of ergodicity (due to Boltzmann). The average of the consecutive sub-sequences plays the role of time (temporal) average. This average then compared to ensemble average to estimate quantitative value of a simple metric called Mean Ergodic Time (MET), when system is ergodic.
dc.description5 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0904.3122
dc.identifierhttp://arxiv.org/abs/0904.3122
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227881
dc.subjectStatistical Mechanics
dc.titleScaling of Ergodicity in Binary Systems
dc.typetext

Files

Collections

arXiv