Coalescent random walks on graphs

Journal of Computational and Applied Mathematics

Volumn 202, Issue 1 SPECIAL ISSUE, 2007, Pages 144-154

  Tian, Jianjun Paul ^a   Liu, Zhenqiu ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MARYLAND GREENEBAUM CANCER CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE DIFFERENCE METHOD; MARKOV PROCESSES; MATHEMATICAL MODELS; NUMBER THEORY; TENSORS;

COALESCENT RANDOM WALKS; FINITE NUMBER; STOCHASTIC MODELS;

GRAPH THEORY;

EID: 33847080845     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2005.10.039     Document Type: Article

References (9)

1. Bollobás B. Modern Graph Theory (1998), Springer, New York
2. Buckley F., and Harary F. Distance in Graphs (1990), Addison-Wesley, Reading, MA
3. Chung K.-L. Markov Chains with Stationary Transition Probabilities (1967), Springer, Berlin
4. Godsil C., and Royle G. Algebraic Graph Theory (2001), Springer, New York
5. Kingman J.F.C. The coalescent, stochastic processes and their applications 13 (1982) 235-248
6. Kingman J.F.C. On the genealogy of large populations. J. Appl. Probab. 19A (1982) 27-43
7. Lovász L. Random walks on graphs: a survey. Bolyai Society Mathematical Study, Combinatorics 2 (1993) 1-46
8. Syski R. Passage Times for Markov Chains (1992), IOS Press, Amsterdam
9. J. Tian, X.-S. Lin, Continuous time Markov processes on graphs, in review.