Reconstruction of graphs based on random walks

Theoretical Computer Science

Volumn 410, Issue 38-40, 2009, Pages 3826-3838

  Wittmann, Dominik M ^a,b   Schmidl, Daniel ^a,b   Blöchl, Florian ^a   Theis, Fabian J ^a,b,c  

^a INSTITUTE OF EPIDEMIOLOGY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c MAX PLANCK INSTITUTE FOR DYNAMICS AND SELF ORGANIZATION   (Germany)

Author keywords

Distance realization problem; Graph theory; Mean first hitting time; Random walk

Indexed keywords

APPROPRIATE DISTANCES; COMPLEX NETWORKS; COMPUTATIONAL EFFORT; DISTANCE MATRICES; DISTANCE REALIZATION PROBLEM; FIRST HITTING TIME; IN-NETWORK; MEAN FIRST HITTING TIME; RANDOM WALK; SHORTEST PATH; THEORETICAL APPROACH;

HEURISTIC METHODS; PROBLEM SOLVING; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

EID: 68249130510     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.05.026     Document Type: Article

References (30)

1. Althöfer I. On optimal realizations of finite metric spaces by graphs. Discrete and Computational Geometry 3 1 (1988) 103-122
2. Patrinos S.H.A.N. The distance matrix of a graph and its tree realization. Quarterly of Applied Mathematics 30 (1972) 255-269
3. Barabási A., and Albert R. Emergence of scaling in random networks. Science 286 5439 (1999) 509-512
4. Baxter B. Conditionally positive functions and p-norm distance matrices. Constructive Approximation 7 1 (1991) 427-440
5. Berg H. Random Walks in Biology (1993), Princeton University Press
6. Boesch F. Properties of the distance matrix of a tree. Quarterly of Applied Mathematics 26 (1969) 607-609
7. Bollobás B. Modern Graph Theory. Graduate Texts in Mathematics vol. 184 (1998), Springer New York
8. Burton D., Pulleyblank W., and Toint P. On the use of an inverse shortest path algorithm for recovering linearly correlated costs. Mathematical Programming 63 1 (1994) 1-22
9. Burton D., and Toint P. The inverse shortest paths problem with upper bounds on shortest paths costs. Network Optimization (1997) 156-171
10. Chung F., Garrett M., Graham R., and Shallcross D. Distance realization problems with applications to internet tomography. Journal of Computer and System Sciences 63 3 (2001) 432-448
11. Condamin S., Bénichou O., Tejedor V., Voituriez R., and Klafter J. First passage times in complex scale-invariant media. Nature 450 7166 (2007) 77-80
12. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progression. Journal of Symbolic Computation 9 (1990) 251-280
13. Culberson J., and Rudnicki P. A fast algorithm for constructing trees from distance matrices. Information Processing Letters 30 4 (1989) 215-220
14. Cunningham J. Free trees and bidirectional trees as representations of psychological distance. Journal of Mathematical Psychology 17 (1978) 165-188
15. Delsuc F., Brinkmann H., and Hervé P. Phylogenomics and the reconstruction of the tree of life. Nature Rev. Genet. 6 5 (2005) 361-375
16. Dress A. Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces. Advances in Mathematics 53 3 (1984) 321-402
17. Erdös P., and Rényi A. On random graphs. i. Publicationes Mathematicae Debrecen 6 (1959) 290-297
18. Fama E.F. Random walks in stock market prices. Financial Analysts Journal 51 1 (1995) 75-80
19. Golub G., and Loan C.V. Matrix Computations (1996), Johns Hopkins University Press
20. Hakimi S., and Yau S. Distance matrix of a graph and its realizability. Quarterly of Applied Mathematics 22 (1964-65) 305-317
21. Lovász L. Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty 2 (1993) 1-46
22. Nieminen J. Realizing the distance matrix of a graph. Elektronische Informationsverarbeitung und Kybernetik 12 1-2 (1976) 29-31
23. Ruxton G.D., and Glasbey C.A. Energetics of group foraging: Analysis of a random-walk model. Mathematical Medicine and Biology 12 1 (1995) 71-81
24. Simoes-Pereira J.M.S. An optimality criterion for graph embeddings of metrics. SIAM Journal on Discrete Mathematics 1 2 (1988) 223-229
25. Simoes-Pereira J.M.S. An algorithm and its role in the study of optimal graph realizations of distance matrices. Discrete Mathematics 79 3 (1990) 299-312
26. Simões-Pereira J., and Zamfirescu C. Submatrices of non-tree-realizable distance matrices. Applied Linear Algebra 44 (1982) 1-17
27. Tetali P. Random walks and effective resistance of networks. Journal of Theoretical Probability 4 i (1991) 101-109
28. Varone S. A constructive algorithm for realizing a distance matrix. European Journal of Operational Research 174 1 (2006) 102,111
29. Watts D., and Strogatz S. Collective dynamics of small-world networks. Nature 393 6684 (1998) 440-442
30. Zhang X., Johnson S.N., Crawford J.W., Gregory P.J., and Young I.M. A general random walk model for the leptokurtic distribution of organism movement: Theory and application. Ecological Modelling 200 1-2 (2007) 79-88