ANALISIS HUBUNGAN KLASIFIKASI RANTAI MARKOV DENGAN SIFAT – SIFAT GRAF

RACHMADINI, HALIZA SUCI and Suprihatin, Bambang and Hanum, Herlina (2018) ANALISIS HUBUNGAN KLASIFIKASI RANTAI MARKOV DENGAN SIFAT – SIFAT GRAF. Undergraduate thesis, Sriwijaya University.

Preview	Text RAMA_44201_08011381419056_00080165_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (725kB) | Preview
	Text RAMA_44201_08011381419056_00080165_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (418kB) | Request a copy
	Text RAMA_44201_08011381419056_00080165_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (7kB) | Request a copy
	Text RAMA_44201_08011381419056_00080165_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (288kB) | Request a copy
	Text RAMA_44201_08011381419056_00080165_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (7kB) | Request a copy
	Text RAMA_44201_08011381419056_00080165_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (8kB) | Request a copy

Abstract

The basic problem of the stochastic process and Markov chain is to determine appropriate state of classification, where the classification of the Markov chain can be seen from the graph. This research was conducted to look at the shape of the graph on each of the Markov chain state characteristics that are restricted to irreducible, recurrent, and periodic properties. For each state of the transition probability matrix will be transformed into a graph form, then analyzes form the graph. The results of this research indicate that for the state of Markov chain irreducible there is a cycle that connects all vertices in the graph, while for Markov chain reducible there is no cycles connecting all vertices on the graph, but there may be cycles connecting some of the vertices on the graph. Markov chain vertices is said to be periodic in the graph there is cycle to return to the vertices with even number of steps, while the aperiodic on the graph is a loop and there is a cycle to return to the vertices with odd number of steps. Markov chain vertices is said to be recurrent in the graph there is a cycle shaped arc path out for each arc that is skipped, while it is said transient there is an arc path out that is not a cycle for every arc that is skipped.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Markov Chain, State Classification, Graph, Graph Characteristic
Subjects:	Q Science > QA Mathematics > QA1-939 Mathematics Q Science > QA Mathematics > QA299.6-433 Analysis
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Mrs Dies Meirita Sari
Date Deposited:	19 Aug 2019 05:56
Last Modified:	19 Aug 2019 05:56
URI:	http://repository.unsri.ac.id/id/eprint/4538

Actions (login required)

View Item