Ändra sökning
Avgränsa sökresultatet
1 - 7 av 7
RefereraExporteraLänk till träfflistan
Permanent lä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
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Aas, Erik
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    A Markov Process on Cyclic Words2014Doktorsavhandling, 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 ζ

  • 2.
    Aas, Erik
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    Limit points of the iterative scaling procedure2014Ingår i: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 215, nr 1, s. 15-23Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The iterative scaling procedure (ISP) is an algorithm which computes a sequence of matrices, starting from some given matrix. The objective is to find a matrix 'proportional' to the given matrix, having given row and column sums. In many cases, for example if the initial matrix is strictly positive, the sequence is convergent. It is known that the sequence has at most two limit points. When these are distinct, convergence to these two points can be slow. We give an efficient algorithm which finds the limit points, invoking the ISP only on subproblems for which the procedure is convergent.

  • 3.
    Aas, Erik
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    Stationary probability of the identity for the TASEP on a Ring2012Ö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.

  • 4.
    Aas, Erik
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    TASEP in any Weyl groupManuskript (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.

  • 5.
    Aas, Erik
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    Linusson, Svante
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    Continuous multiline queues and TASEPManuskript (preprint) (Övrigt vetenskapligt)
  • 6.
    Aas, Erik
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Linusson, Svante
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Continuous multi-line queues and TASEP2018Ingår i: ANNALES DE L INSTITUT HENRI POINCARE D, ISSN 2308-5827, Vol. 5, nr 1, s. 127-152Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we study a distribution Xi of labeled particles on a continuous ring. It arises in three different ways, all related to the multi-type TASEP on a ring. We prove formulas for the probability density function for some permutations and give conjectures for a larger class. We give a complete conjecture for the probability of two particles i, j being next to each other on the cycle, for which we prove some cases. We also find that two natural events associated to the process have exactly the same probability expressed as a Vandermonde determinant. It is unclear whether this is just a coincidence or a consequence of a deeper connection.

  • 7.
    Aas, Erik
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    A product formula for the TASEP on a ring2016Ingår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 48, nr 2, s. 247-259Artikel i tidskrift (Refereegranskat)
    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.

1 - 7 av 7
RefereraExporteraLänk till träfflistan
Permanent lä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