{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article1966","name":"QBD processes and matrix orthogonal polynomilas: somw new explicit examples","abstract":"In the case of birth-and-death processes\r\n there are a few exactly solvable\r\n situations where the n-step transition\r\n matrix can be written down using the\r\n Karlin-McGregor formula. A few of these\r\n come from group representation theory.\r\n\r\n I plan to show how this can be extended\r\n to some instances of QBD processes with an\r\n arbitrary finite number of phases. The group\r\n involved is the set of all unitary\r\n matrices of size N. For a fixed N one gets\r\n examples where the number of phases is\r\n a free parameter, and there are a few extra\r\n parameters to play with. By tunning\r\n these parameters\r\n one can exhibit examples where states\r\n are recurrent or transient.\r\n\r\n The rather surprising fact that for these\r\n examples one can compute everything\r\n explicitly raises the issue of finding\r\n a possible network application\r\n for this piece of\r\n mathematics that involves matrix\r\n valued orthogonal polynomials.\r\n I will give an ab-initio discussion of\r\n the examples starting with the case of one phase.","keywords":["QBD","orthogonal polynomials","Karlin-McGregor formula","representation theory"],"author":{"@type":"Person","name":"Gr\u00fcnbaum, Alberto F.","givenName":"Alberto F.","familyName":"Gr\u00fcnbaum"},"position":14,"pageStart":0,"pageEnd":0,"dateCreated":"2008-04-07","datePublished":"2008-04-07","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Gr\u00fcnbaum, Alberto F.","givenName":"Alberto F.","familyName":"Gr\u00fcnbaum"},"copyrightYear":"2008","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/DagSemProc.07461.14","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume674","volumeNumber":7461,"name":"Dagstuhl Seminar Proceedings, Volume 7461","dateCreated":"2008-04-07","datePublished":"2008-04-07","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article1966","isPartOf":{"@type":"Periodical","@id":"#series119","name":"Dagstuhl Seminar Proceedings","issn":"1862-4405","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume674"}}}