Результаты поиска по 'Minkowski metric':
Найдено статей: 4
  1. Koganov A.V.
    Uniform graph embedding into metric spaces
    Computer Research and Modeling, 2012, v. 4, no. 2, pp. 241-251

    The task of embedding an infinity countable graph into continuous metric space is considered. The concept of uniform embedding having no accumulation point in a set of vertex images and having all graph edge images of a limited length is introduced. Necessary and sufficient conditions for possibility of uniform embedding into spaces with Euclid and Lorenz metrics are stated in terms of graph structure. It is proved that tree graphs with finite branching have uniform embedding into space with absolute Minkowski metric.

  2. Moskalev P.V.
    Estimates of threshold and strength of percolation clusters on square lattices with (1,π)-neighborhood
    Computer Research and Modeling, 2014, v. 6, no. 3, pp. 405-414

    In this paper we consider statistical estimates of threshold and strength of percolation clusters on square lattices. The percolation threshold pc and the strength of percolation clusters P for a square lattice with (1,π)-neighborhood depends not only on the lattice dimension, but also on the Minkowski exponent d. To estimate the strength of percolation clusters P proposed a new method of averaging the relative frequencies of the target subset of lattice sites. The implementation of this method is based on the SPSL package, released under GNU GPL-3 using the free programming language R.

    Views (last year): 4. Citations: 5 (RSCI).
  3. Moskalev P.V.
    Percolation modeling of hydraulic hysteresis in a porous media
    Computer Research and Modeling, 2014, v. 6, no. 4, pp. 543-558

    In this paper we consider various models of hydraulic hysteresis in invasive mercury porosimetry. For simulating the hydraulic hysteresis is used isotropic site percolation on three-dimensional square lattices with $(1,\,\pi)$-neighborhood. The relationship between the percolation model parameters and invasive porosimetry data is studied phenomenologically. The implementation of the percolation model is based on libraries SPSL and SECP, released under license GNU GPL-3 using the free programming language R.

    Views (last year): 3. Citations: 1 (RSCI).
  4. Moskalev P.V.
    The structure of site percolation models on three-dimensional square lattices
    Computer Research and Modeling, 2013, v. 5, no. 4, pp. 607-622

    In this paper we consider the structure of site percolation models on three-dimensional square lattices with various shapes of (1,π)-neighborhood. For these models, are proposed iso- and anisotropic modifications of the invasion percolation algorithm with (1,0)- and (1,π)-neighborhoods. All the above algorithms are special cases of the anisotropic invasion percolation algorithm on the n-dimensional lattice with a (1,π)-neighborhood. This algorithm is the basis for the package SPSL, released under GNU GPL-3 using the free programming language R.

    Views (last year): 8. Citations: 5 (RSCI).

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"