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: | Samim DÜNDAR, Pınar DÜNDAR |
---|---|
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 |
Similar Items
-
SONLU MARKOV ZİNCİRİNİN GRAFLARLA KATLANIŞI
by: Samim DÜNDAR, et al.
Published: (1999-01-01) -
SONLU MARKOV ZİNCİRİNİN GRAFLARLA KATLANIŞI
by: Samim DÜNDAR, et al.
Published: (1999-01-01) -
SONLU MARKOV ZİNCİRİNİN GRAFLARLA KATLANIŞI
by: Samim DÜNDAR, et al.
Published: (1999-01-01) -
SONLU MARKOV ZİNCİRİNİN GRAFLARLA KATLANIŞI
by: Pınar Dündar, et al.
Published: (1999-01-01) -
Automorfisme Graf Bintang dan Graf Lintasan
by: Reni Tri Damayanti
Published: (2011-11-01)