Ä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
A Markov Process on Cyclic Words
KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
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: urn:nbn:se:kth:diva-156862ISBN: 978-91-7595-357-1 (tryckt)OAI: oai:DiVA.org:kth-156862DiVA, id: diva2:768235
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
Delarbeten
1. Stationary probability of the identity for the TASEP on a Ring
Öppna denna publikation i ny flik eller fönster >>Stationary probability of the identity for the TASEP on a Ring
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.

Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:kth:diva-156857 (URN)
Anmärkning

QC 20141203

Tillgänglig från: 2014-12-03 Skapad: 2014-12-03 Senast uppdaterad: 2014-12-04Bibliografiskt granskad
2. A product formula for the TASEP on a ring
Öppna denna publikation i ny flik eller fönster >>A product formula for the TASEP on a ring
2016 (Engelska)Ingår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 48, nr 2, s. 247-259Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

For a random permutation sampled from the stationary distributionof the TASEP on a ring, we show that, conditioned on the event that the rstentries are strictly larger than the last entries, the order of the rst entries isindependent of the order of the last entries. The proof uses multi-line queues asdened by Ferrari and Martin, and the theorem has an enumerative combinatorialinterpretation in that setting.As an application we prove a conjecture of Lam and Williams concerningSchubert factors of the stationary probability of certain states.Finally, we present a conjecture for the case where the small and large entriesare not separated.

Ort, förlag, år, upplaga, sidor
Wiley-Blackwell, 2016
Nyckelord
TASEP, exclusion process, multi-line queue, Markov chain
Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:kth:diva-156858 (URN)10.1002/rsa.20595 (DOI)000367624300002 ()2-s2.0-84952987496 (Scopus ID)
Anmärkning

QC 20160205

Tillgänglig från: 2014-12-03 Skapad: 2014-12-03 Senast uppdaterad: 2017-12-05Bibliografiskt granskad
3. TASEP in any Weyl group
Öppna denna publikation i ny flik eller fönster >>TASEP in any Weyl group
(Engelska)Manuskript (preprint) (Övrigt vetenskapligt)
Abstract [en]

We investigate a Markov chain dened by Thomas Lam [6], whichgeneralizes the multi-type TASEP on a ring to any Weyl group. For groups of typeC we dene an analogue of the multiline queues of Ferrari and Martin (which com-pute the stationary distribution for the classical TASEP). While our constructiondoes not suce for nding the stationary distribution, the construction gives thestationary distribution of a certain projection of Lam's chain. Also, our approach isincremental, in the sense that the construction appears to t into a pattern of 'con-jugation matrices', which remains to be fully worked out. We conjecture an explicitformula for the partition function of the model. Finally, we prove a theorem for theclassical TASEP which ts into the picture of viewing TASEP in a permutation-freeway.

Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:kth:diva-156859 (URN)
Anmärkning

QS 2014

Tillgänglig från: 2014-12-03 Skapad: 2014-12-03 Senast uppdaterad: 2014-12-04Bibliografiskt granskad
4. Continuous multiline queues and TASEP
Öppna denna publikation i ny flik eller fönster >>Continuous multiline queues and TASEP
(Engelska)Manuskript (preprint) (Övrigt vetenskapligt)
Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:kth:diva-156860 (URN)
Anmärkning

QC 20141203

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

Open Access i DiVA

Thesis(620 kB)255 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 620 kBChecksumma SHA-512
cea95b5af68f13cb67571b8afc0152b248506655d1a630869caa5387a6ae92c25d016cdf7a3e7352dd0e7c1b51f0dc063de6a2c7c25f58ca79421cdb9f57487f
Typ fulltextMimetyp application/pdf

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: 255 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.

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 1907 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