Research Article
Generalized Engel's Algorithm for Minimizing Playing Time to Stabilize the Initial Configuration and for finding Absorbing Probability
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 107 - Issue 5 |
| Published: December 2014 |
| Authors: Namrata Kaushal, Madhu Tiwari, Virendra Singh, C. L. Parihar |
10.5120/18749-0005
|
Namrata Kaushal, Madhu Tiwari, Virendra Singh, C. L. Parihar . Generalized Engel's Algorithm for Minimizing Playing Time to Stabilize the Initial Configuration and for finding Absorbing Probability. International Journal of Computer Applications. 107, 5 (December 2014), 32-35. DOI=10.5120/18749-0005
@article{ 10.5120/18749-0005,
author = { Namrata Kaushal,Madhu Tiwari,Virendra Singh,C. L. Parihar },
title = { Generalized Engel's Algorithm for Minimizing Playing Time to Stabilize the Initial Configuration and for finding Absorbing Probability },
journal = { International Journal of Computer Applications },
year = { 2014 },
volume = { 107 },
number = { 5 },
pages = { 32-35 },
doi = { 10.5120/18749-0005 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2014
%A Namrata Kaushal
%A Madhu Tiwari
%A Virendra Singh
%A C. L. Parihar
%T Generalized Engel's Algorithm for Minimizing Playing Time to Stabilize the Initial Configuration and for finding Absorbing Probability%T
%J International Journal of Computer Applications
%V 107
%N 5
%P 32-35
%R 10.5120/18749-0005
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this paper a generalized Engel's algorithm based on known Engel's algorithm has been introduced. Using this algorithm playing time of chip-firing game which is defined on directed graph, can be minimized for evaluation of absorbing probability of an absorbing Markov chain. Here proposed algorithm has been compared empirically in terms of timings, for playing game as well as for determining absorbing probability. As MATLAB is a high-performance language for technical computing, hence hare performance of generalized algorithm will be analyze by MATLAB language.
References
- Bjorner. A, Lovasz . L and Schor. P. W. 1991. "Chip- firing games on graphs". Europ. J. Combinatory. Vol. 12 pp-283-291
- Bjorner. A and Lovasz . L. 1 992. "Chip-firing games on directed graphs". J. Algebraic Combinatory. Vol. 1 pp-304- 328
- Dhar. D, Ruelle,P, Sen. S, and Verma. D. 1995 . "Algebraic aspects of abelian sandpile models"J. Phys. A Vol. 28 pp-805-831
- Engel. A. 1975. "The probabilistic abacus". Educ. Stud. In Math. Vol. 6 pp-1-22
- Engel. A. 1976. "Why does the probabilistic abacus work". Educ. Stud. In Math. Vol. 7 pp-59-69
- Eriksson. K. 1991. "No polynomial bound for the chip-firing game on directed graphs". Proc. Amer. Math. Soc. Vol. 112 , pp-1203-1205
- Gilat. A. 2004. "MATLAB: An introduction with Applications". John Wiley and Sons
- Heuvel . J. D. 2001. "Algorithmic Aspect of Chip-Firing Game" . Combinatory Probability and computing
- Kaushal. N, Tiwari. M and Parihar. C. L. 2014. "Chip-firing Game as Probability Abacus by Characterization of ULD Lattices". Asian Journal of Mathematics and Applications (Science Asia Pub. ) Vol. 0617 pp-1-8
- Moler. C. B. 2004. "Numerical Computing with" MATLAB. Siam
- Polking . J. C and Arnold. D. 2004. "ODE using MATLAB" Prentice Hall
Index Terms
Keywords