COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHS
A finite Markov chain is presented by a P probability matrix, and it is represented by a connected, directed and weighted graph. When the state space of Markov chain is of large dimension, this space is divided into subspaces those have roughly same number states. The main solution is founded fro...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Pamukkale University
1999-01-01
|
| Series: | Pamukkale University Journal of Engineering Sciences |
| Subjects: | |
| Online Access: | http://dergipark.ulakbim.gov.tr/pajes/article/view/5000089950 |
| _version_ | 1797921427163185152 |
|---|---|
| author | Samim DÜNDAR Pınar DÜNDAR |
| author_facet | Samim DÜNDAR Pınar DÜNDAR |
| author_sort | Samim DÜNDAR |
| collection | DOAJ |
| description | A finite Markov chain is presented by a P probability matrix, and it is represented by a connected, directed and weighted graph. When the state space of Markov chain is of large dimension, this space is divided into subspaces those have roughly same number states. The main solution is founded from the solutions in these subspaces. It is known that parallel computation in computer sciences. It is important to fınd a procedure which gives that operation which mentioned above. In this work, a finite Markov chain is considered a probabilistic graph and it is partitioned to its subspaces by using the knowledges of collapsible graphs. An algorithm of the procedure is given. |
| first_indexed | 2024-04-10T14:16:53Z |
| format | Article |
| id | doaj.art-cebbc3c8190d418dac56016423be9be8 |
| institution | Directory Open Access Journal |
| issn | 1300-7009 2147-5881 |
| language | English |
| last_indexed | 2024-04-10T14:16:53Z |
| publishDate | 1999-01-01 |
| publisher | Pamukkale University |
| record_format | Article |
| series | Pamukkale University Journal of Engineering Sciences |
| spelling | doaj.art-cebbc3c8190d418dac56016423be9be82023-02-15T16:09:31ZengPamukkale UniversityPamukkale University Journal of Engineering Sciences1300-70092147-58811999-01-01519679735000084018COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHSSamim DÜNDARPınar DÜNDARA finite Markov chain is presented by a P probability matrix, and it is represented by a connected, directed and weighted graph. When the state space of Markov chain is of large dimension, this space is divided into subspaces those have roughly same number states. The main solution is founded from the solutions in these subspaces. It is known that parallel computation in computer sciences. It is important to fınd a procedure which gives that operation which mentioned above. In this work, a finite Markov chain is considered a probabilistic graph and it is partitioned to its subspaces by using the knowledges of collapsible graphs. An algorithm of the procedure is given.http://dergipark.ulakbim.gov.tr/pajes/article/view/5000089950Sonlu markov zincirleri, Yönlendirilmiş graf, Graf parçalanışı |
| spellingShingle | Samim DÜNDAR Pınar DÜNDAR COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHS Pamukkale University Journal of Engineering Sciences Sonlu markov zincirleri, Yönlendirilmiş graf, Graf parçalanışı |
| title | COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHS |
| title_full | COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHS |
| title_fullStr | COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHS |
| title_full_unstemmed | COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHS |
| title_short | COLLAPSIBILICATION OF A FINITE MARKOV CHAIN BY GRAPHS |
| title_sort | collapsibilication of a finite markov chain by graphs |
| topic | Sonlu markov zincirleri, Yönlendirilmiş graf, Graf parçalanışı |
| url | http://dergipark.ulakbim.gov.tr/pajes/article/view/5000089950 |
| work_keys_str_mv | AT samimdundar collapsibilicationofafinitemarkovchainbygraphs AT pınardundar collapsibilicationofafinitemarkovchainbygraphs |