Skip Navigation Links
Discontinuity, Nonlinearity, and Complexity

Dimitry Volchenkov (editor), Dumitru Baleanu (editor)

Dimitry Volchenkov(editor)

Mathematics & Statistics, Texas Tech University, 1108 Memorial Circle, Lubbock, TX 79409, USA


Dumitru Baleanu (editor)

Cankaya University, Ankara, Turkey; Institute of Space Sciences, Magurele-Bucharest, Romania


Markov Chain Scaffolding of Real World Data

Discontinuity, Nonlinearity, and Complexity 2(3) (2013) 289--299 | DOI:10.5890/DNC.2013.08.005

D. Volchenkov

Center of Excellence Cognitive Interaction Technology (CITEC), Mathematical Physics Research Group, Bielefeld University, Universitaetsstr. 25, 33615 Bielefeld, Germany

Download Full Text PDF



Discrete time scale dependent random walks on a graph model of a relational database can be generated by a variety of equivalence relations imposed between walks (i.e.composite functions, inheritance, property relations, ancestor-descendant relations, data queries, address allocation and assignment polices). The Green function of diffusion process induce by the random walks allows to define scale dependent geometry. Geometric relations on databases can guide the datainterpretation. In particular, first passage times in a urban spatial network help to evaluate the tax assessment value of land.


Financial support by the project MatheMACS (“Mathematics of Multilevel Anticipatory Complex Systems”), grant agreement no. 318723, funded by the EC Seventh Framework Programme FP7-ICT-2011-8 is gratefully acknowledged.


  1. [1]  Hey, J. (2001), The mind of the species problem, Trends in Ecology and Evolution, 16(7), 326.
  2. [2]  Birkhoff, G. and Mac Lane, S. (1979), Algebra, Second edition, Macmillan, New York.
  3. [3]  Graham, A. (1987), Nonnegative Matrices and Applicable Topics in Linear Algebra, John Wiley & Sons, New York.
  4. [4]  Blanchard, Ph. and Volchenkov, D. (2011), Introduction to Random Walks on Graphs and Databases, Springer Series in Synergetics, Vol. 10, Springer, Berlin–Heidelberg.
  5. [5]  Chung, F.R.K. (1997), Lecture Notes on Spectral Graph Theory, American Mathematical Society Publications, Providence.
  6. [6]  Lovász, L. (1993), RandomWalks On Graphs: A Survey, Bolyai Society Mathematical Studies 2: Combinatorics, Paul Erdös is Eighty, 1, Keszthely, Hungary.
  7. [7]  Erdélyi,I. (1967), On the matrix equation Ax =λ Bx, Journal of Mathematical Analysis and Applications, 17, 119.
  8. [8]  Meyer, C.D. (1975), The role of the group generalized inverse in the theory of finite Markov chains, SIAM Review, 17, 443.
  9. [9]  Drazin, M.P. (1958), Pseudo-inverses in associative rings and semigroups, The American Mathematical Monthly, 65, 506–514.
  10. [10]  Ben-Israel, A. and Greville, Th.N.E. (2003), Generalized Inverses: Theory and Applications, Second edition, Springer.
  11. [11]  Muir, T. (1960), Treatise on the Theory of Determinants, (revised and enlarged by W. H. Metzler), Dover, New York.
  12. [12]  Robert, P. (1968) On the group inverse of a linear transformation, Journal of Mathematical Analysis and Applications 22, 658.
  13. [13]  Campbell, S.L., Meyer, C.D., and Rose, N.J. (1976), Applications of the Drazin inverse to linear systems of differential equations with singular constant coefficients, SIAM Journal on Applied Mathematics, 31(3), 411.
  14. [14]  Hartwig, R.E.(1976), More on the Souriau-Frame algorithm and the drazin inverse, SIAM Journal on Applied Mathematics, 31 (1), 42.
  15. [15]  Agaev, R.P. and Chebotarev, P.Yu. (2002), On Determining the eigenprojection and components of a matrix, Automation and Remote Control, 63 (10), 1537.
  16. [16]  Duistermaat, J.J. (2001), On the boundary behaviour of the Riemannian structure of a self-concordant barrier function, Asymptotic Analysis, 27(1), 9.
  17. [17]  Pennec, X. (2004), Intrinsic statistics on Riemannian manifolds: Basic tools for geometric measurements, Journal of Mathematical Imaging and Vision, 25(1), 127.
  18. [18]  Bio, Th., Fillard, P., Ayache, N., and Pennec, X. (2004), A Riemannian framework for tensor computing, International Journal of Computer Vision, 66, 41.
  19. [19]  Hillier, B. and Hanson, J. (1984), The Social Logic of Space, Cambridge University Press, Cambridge.
  20. [20]  Hillier, B. (1999), Space is the Machine: A Configurational Theory of Architecture, Cambridge University Press, Cambridge.
  21. [21]  Hansen, W.G. (1959), How accessibility shapes land use, Journal of the American Institute of Planners, 25, 73.
  22. [22]  Wilson, A.G. (1970), Entropy in Urban and Regional Modeling, Pion Press, London.
  23. [23]  Batty,M. (2004), A New Theory of Space Syntax, UCL Centre For Advanced Spatial Analysis Publications, CASA Working Paper, 75.
  24. [24]  Volchenkov, D. and Blanchard, Ph. (2007), Random walks along the streets and channels in compact cities : Spectral analysis, dynamical modularity, information, and statistical mechanics, Physical Review E, 75, 026104.
  25. [25]  Volchenkov, D. and Blanchard, Ph. (2008), Scaling and universality in city space syntax: between zipf and matthew. Physica A, 387(10), 2353.
  26. [26]  Blanchard, Ph. and Volchenkov, D. (2009), Probabilistic embedding of discrete sets as continuous metric spaces, Stochastics: An International Journal of Probability and Stochastic Processes (formerly: Stochastics and Stochastic Reports), 81(3), 259.
  27. [27]  Bolton, R.P. (1922), Building For Profit, Reginald Pelham Bolton.
  28. [28]  Glaeser, E.L. and Gyourko, J. (2003), Why is Manhattan So Expensive? Manhattan Institute for Policy Research, Civic Report, 39.