{"entities":{"Q1091951":{"pageid":1102703,"ns":120,"title":"Item:Q1091951","lastrevid":69623466,"modified":"2026-04-13T08:16:48Z","type":"item","id":"Q1091951","labels":{"en":{"language":"en","value":"Algorithms for finding steady state probabilities for some special classes of finite state Markov chains"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4012346"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$A83FB797-DD53-43EA-BF2A-8566C985FB3C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"61098cd7049c9f910f96d9ce64b3315c130bcc08","datavalue":{"value":{"text":"Algorithms for finding steady state probabilities for some special classes of finite state Markov chains","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1091951$B89BD84B-7B6C-4BB3-858C-B216C8E955C2","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2c979b79f1efd6c67c7c603a8c14be515c5bf107","datavalue":{"value":"0623.90085","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1091951$CDE0DB62-A846-4CFD-B080-C48FC1F9C3E6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b5d042f008b629a380e0dda8ab4f01bec8e18c07","datavalue":{"value":"10.1016/0167-6377(86)90069-6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1091951$42985DAC-2140-4070-BD9B-C12A8E9E654E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"20c04e73df799f3f73d74d27a20ce40415fc517f","datavalue":{"value":{"entity-type":"item","numeric-id":1091950,"id":"Q1091950"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$F384535F-9C45-4420-909A-599E9DC2D319","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c65a3d7664fbcef1e667ec9f62a9f6e3e3349202","datavalue":{"value":{"entity-type":"item","numeric-id":495327,"id":"Q495327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$13511C8A-F42F-4F97-AAF6-3D36D6D6BFC3","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f9747a37b0b56aeca2085282046e2737cd5087ca","datavalue":{"value":{"entity-type":"item","numeric-id":96289,"id":"Q96289"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$C827FB41-2AD6-48FA-BA10-79A6AF63F9E4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1091951$F92A1901-D499-430C-AE97-7F46A06ACB25","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"7d7466bd874ffe0e4d31baa4d10796fb63729503","datavalue":{"value":"This paper considers irreducible, aperiodic, positive recurrent finite Markov chains, with probability transitions matrices denoted by P, and the problem of computing the steady state probability vector i.e. the solution x to the equations \\(xP=x\\), \\(xe=1\\), \\(x\\geq 0\\). Two special classes of matrix P are considered, viz.    I.) In this case, with an appropriate permutation of the states, and by replacing the first equation of \\(xP=x\\) by \\(xe=1\\), the equations can be written in the form \\(xZ=\\delta_ n(1)\\) where \\(\\delta_ n(1)\\in R^ n\\), and has a one in the first position, and zeros elsewhere and  \\[  Z= \\left[\\begin{matrix} Z_{11}& Z_{12}&...& Z_{1,k+1}& 0&...& 0 \\\\ Z_{21}& Z_{22}&...& Z_{2,k+1}& Z_{2,k+2}&...& 0 \\\\ \\vdots & \\vdots && \\vdots & \\vdots && \\vdots \\\\ Z_{N-k,1}& Z_{N-k,2}&...& Z_{N-k,k+1}& Z_{N-k,k+2}&...& Z_{N-k,N} \\\\ \\vdots & \\vdots && \\vdots & \\vdots && \\vdots \\\\ Z_{N,1}& Z_{N,2}& ...& Z_{N,k+1}& Z_{N,k+2}& ...& Z_{N,N} \\end{matrix}\\right]  \\]  and where \\(Z_{ij}\\) are \\(m\\times m\\) matrices, with \\(Z_{i,k+i}\\) \\((i=1,2,...,N-K)\\) being invertible.    II) This is similar to I, being reducible to the form \\(xZ=\\delta_ n(\\rho)\\) but Z takes the form \\(Z=L+U\\), where L, U are respectively, lower and upper block triangular matrices, L has invertible diagonal block matrices, and L has all zero block columns, \\(\\delta_ n(\\rho)\\) has ones in specified places, and zeros elsewhere, and the zero block columns of U correspond to the ones on \\(\\delta_ n(p)\\). Queueing examples are given which fit this situation.    With an appropriate partition of x and Z in case I, the equations reduce to \\(x_ 1A+ x_ 2C=\\delta_{mk}(1)\\) \\((=(1,0,0,...,0))\\) and \\(x_ 1B+x_ 2D=0\\). These have the solution \\(x_ 1=-x_ 2DB^{-1}\\), where \\(x_ 2\\) is the unique solution to \\(x_ 2(C-DB^{- 1})=\\delta_{mk}(1)\\). A similar analysis is given for class II processes.    Algorithms are given and their complexity compared with Gaussian elimination.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1091951$CFEFAC4C-A3EA-4FA0-9AC0-9E4207FA8CD8","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"377d3ab03372cff12915e0de0374438ff70c3716","datavalue":{"value":"90C40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1091951$414EDA07-938E-4210-9626-C382F118AC22","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9698cd8c2ef5954df0ca7b245f8ac8962391d4ea","datavalue":{"value":"90B22","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1091951$62D3D393-5D89-4600-A026-5E8031EDEB25","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1cdf15533e26fc0c4c2e22d28e655c364dfe77a6","datavalue":{"value":"60J10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1091951$88322720-310A-4D73-8CDA-EE97BDE6E75B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"763034182a2d667b75e92e2d6fff2d7378094131","datavalue":{"value":"60K25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1091951$82FB12D6-F083-4B3A-B143-07F48337EF0D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"03c34f618af824c5edb3550579b33bb19e4578f2","datavalue":{"value":"4012346","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1091951$9B4D3238-642A-4C64-BE2B-C07A441691C8","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"def22e35993708f171150886b0f741af8ed99236","datavalue":{"value":"Gaussian elimination method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1091951$2AC19962-6384-486E-93E6-E1E3276BFDD6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4a74b54f9f58254ffa20810e1d63471b0c514531","datavalue":{"value":"algorithmic methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q1091951$EE9F3D66-AEDC-42B1-9EFD-83499DF2672C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8231e6e8cdc634c6fbfd2fb64215d2a002486d5c","datavalue":{"value":"irreducible, aperiodic, positive recurrent finite Markov chains","type":"string"},"datatype":"string"},"type":"statement","id":"Q1091951$82097073-8893-44C0-9431-1C832997FD2D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7ec3b9f6db3bfd6c1317538e75cf82463654e648","datavalue":{"value":"steady state probability vector","type":"string"},"datatype":"string"},"type":"statement","id":"Q1091951$95C9EC8B-CDF4-476A-94A0-B212AF078917","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"220e78837b2cafebe466a8a108312f61f409efae","datavalue":{"value":{"entity-type":"item","numeric-id":181183,"id":"Q181183"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$66A44F65-0E7A-49C1-A988-CC4FD0F9111A","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$74A8B3BA-7A01-46CC-A766-88D781E69B09","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ab999e6659ef976cf8929a4f6d7b16c894a18cfe","datavalue":{"value":"https://doi.org/10.1016/0167-6377(86)90069-6","type":"string"},"datatype":"url"},"type":"statement","id":"Q1091951$BB11EFD6-7950-4844-A8AD-6B541E6E9682","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"76dc6e46bd6a1818574090951f3870d0f7b1d958","datavalue":{"value":"W1994042593","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1091951$18C071E8-582B-4F5D-88CF-95E398C2EA8B","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"9c9d4bef600de63820f7174f919da70ecf6895bf","datavalue":{"value":{"entity-type":"item","numeric-id":3923308,"id":"Q3923308"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$6156B653-016D-401C-884B-B642DF2E7159","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"4e9797d28b051c7edbb74eddd5d509524bd28721","datavalue":{"value":{"entity-type":"item","numeric-id":4187141,"id":"Q4187141"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$88749746-F182-45B3-AA78-074A902F007A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b5f95da0c57a2ee538050aea9a1334208be6be30","datavalue":{"value":{"entity-type":"item","numeric-id":797477,"id":"Q797477"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1091951$1223FAE7-E8A9-4610-9500-C9D1F1F2B9C6","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"899cbca38781f262bdc5ceb1bcf140bed21869b7","datavalue":{"value":{"entity-type":"item","numeric-id":797477,"id":"Q797477"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0c4bf80e8213d912d06fcb33bd0db7c842000d3c","datavalue":{"value":{"amount":"+0.8750064373016357","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1091951$0A2724B1-1887-408B-9F9C-33F8899A5BEB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"37139256c8102486d9a1a0dc58ed6d70b8ed7556","datavalue":{"value":{"entity-type":"item","numeric-id":3686459,"id":"Q3686459"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d11518da7c38ee735825ccf2783b05944c9e9fc5","datavalue":{"value":{"amount":"+0.8490887880325317","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1091951$FE8D2FBF-51E9-4A5B-B590-97F498BBDDE1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"44fb4ee5669e9e7447c296a7ba3431c1c0b0952b","datavalue":{"value":{"entity-type":"item","numeric-id":4324960,"id":"Q4324960"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9dba0487b3eeac2ce19e7359fa3f7d93b7fcc3f5","datavalue":{"value":{"amount":"+0.8475779891014099","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1091951$057F7A97-6B13-4F61-952F-C326ACF8B86B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ce1be2f2d26e984e235e9546159a4f1819e1b971","datavalue":{"value":{"entity-type":"item","numeric-id":3203797,"id":"Q3203797"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2d6673fb44d64860d99e040c536c6481842bbfd0","datavalue":{"value":{"amount":"+0.8438045978546143","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1091951$B410EC52-98FA-4C13-9827-2B33BB313F2B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"711c4d09f0e4f74967f3ebfb1abec9e8338f77fb","datavalue":{"value":{"entity-type":"item","numeric-id":4282280,"id":"Q4282280"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bcb894344f5d619d3a64828a17cfeb75c3477b60","datavalue":{"value":{"amount":"+0.8314344882965088","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1091951$3AA1E296-2FFD-49CE-ABC8-40FD08B6A57E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithms for finding steady state probabilities for some special classes of finite state Markov chains","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Algorithms_for_finding_steady_state_probabilities_for_some_special_classes_of_finite_state_Markov_chains"}}}}}