Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Stationary probability of the identity for the TASEP on a Ring
KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
2012 (Engelska)Övrigt (Övrigt vetenskapligt)
Abstract [en]

Consider the following Markov chain on permutations of length n. At each time step we choose a random position. If the letter at that position is smaller than the letter immediately to the left (cyclically) then these letters swap positions. Otherwise nothing happens, corresponding to a loop in the Markov chain. This is the circular TASEP. We compute the average proportion of time the chain spends at the identity permutation (and, in greater generality, at sorted words). This answers a conjecture by Thomas Lam.

Ort, förlag, år, sidor
2012.
Nationell ämneskategori
Matematik
Identifikatorer
URN: urn:nbn:se:kth:diva-156857OAI: oai:DiVA.org:kth-156857DiVA, id: diva2:768228
Anmärkning

QC 20141203

Tillgänglig från: 2014-12-03 Skapad: 2014-12-03 Senast uppdaterad: 2014-12-04Bibliografiskt granskad
Ingår i avhandling
1. A Markov Process on Cyclic Words
Öppna denna publikation i ny flik eller fönster >>A Markov Process on Cyclic Words
2014 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

The TASEP (totally asymmetric simple exclusion process) studied here is a Markov chain on cyclic words over the alphabet{1,2,...,n} given by at each time step sorting an adjacent pair of letters chosen uniformly at random. For example, from the word 3124 one may go to 1324, 3124, 3124, 4123 by sorting the pair 31, 12, 24, or 43.

Two words have the sametype if they are permutations of each other. If we restrict TASEP to words of some particular type m we get an ergodic Markov chain whose stationary distribution we denote by ζm. Soζm (u) is the asymptotic proportion of time spent in the state u if the chain started in some word of type m. The distribution ζ is the main object of study in this thesis. This distribution turns out to have several remarkable properties, and alternative characterizations. It has previously been studied both from physical, combinatorial, and probabilitistic viewpoints.

In the first chapter we give an extended summary of known results and results in this thesis concerning ζ. The new results are described (and proved) in detail in Papers I - IV.

The new results in Papers I and II include an explicit formula for the value ofζat sorted words and a product formula for decomposable words. We also compute some correlation functions for ζ. In Paper III we study of a generalization of TASEP to Weyl groups. In Paper IV we study a certain scaling limit of ζ, finding several interesting patterns of which we prove some. We also study an inhomogenous version of TASEP, in which different particles get sorted at different rates, which generalizes the homogenous version in several aspects. In the first chapter we compute some correlation functions for ζ

Ort, förlag, år, upplaga, sidor
Stockholm: KTH Royal Institute of Technology, 2014. s. vii, 35
Serie
TRITA-MAT-A ; 2014:12
Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:kth:diva-156862 (URN)978-91-7595-357-1 (ISBN)
Disputation
2014-12-12, E3, Osquars backe 14, KTH, Stockholm, 10:00 (Engelska)
Opponent
Handledare
Anmärkning

QC 20141204

Tillgänglig från: 2014-12-04 Skapad: 2014-12-03 Senast uppdaterad: 2015-08-27Bibliografiskt granskad

Open Access i DiVA

fulltext(248 kB)174 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 248 kBChecksumma SHA-512
159a7b0f13fb5b13b97769499ffa7dd020e9ded8608662439809fa24ca168ad676ea340cab5dadd93de7b1e37b5b941c7eadf6e2320703cfcc76ef403a3430de
Typ fulltextMimetyp application/pdf

Övriga länkar

arXiv

Sök vidare i DiVA

Av författaren/redaktören
Aas, Erik
Av organisationen
Matematik (Avd.)
Matematik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 174 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 768 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf