Article

Article title HASH FUNCTIONS AS SOURCE OF RANDOM NUMBERS FOR STOCHASTICAL MODELS
Authors D.A. Rybakov, Kh.D. Lamazhapov, A.V.Ivchenko
Section SECTION IV. MATHEMATICAL METHODS OF AN ARTIFICIAL INTELLECT
Month, Year 06, 2012 @en
Index UDC 519.856.2
DOI
Abstract Many simulated processes include regularity and chaos. Regular values are usually expressed using analytic functions meanwhile chaotic values may be expressed using hash functions. Using of hash functions in software program leads to compact representations for read-only arrays of pseudo random values. Subsequent extraction of subset from read-only array allows full data processing for extracted data. For example one may express random lattice of percolation model using hash functions. Lattice maximum size is not limited by computer memory. Percolation cluster extracted from such lattice consumes O(LD) bytes, where L – is cluster linear size, D ≈ 2,5 – is fractal dimension of cluster.

Download PDF

Keywords Hash-functions; stochastic; fractal; percolation.
References 1. Тарасевич Ю.Ю. Перколяция: теория, приложения, алгоритмы. – М., 2002. – 122 с.
2. Bagnich S.A., Konash A.V. Computer investigation of the percolation processes in two- and three- dimensional systems with heterogeneous internal structure // Nuclear Instruments and
Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment. April 2003. – Vol. 502, № 2-3, 21. – P. 731-732.
3. Ламажапов Х.Д., Прохоров С.А, Рыбаков Д.А. Свойства трехмерных кластеров, составленных из параллелепипедов // Вестник Новосибирского государственного университета. Сер. Физика. – 2009. – Т. 4 , № 3. – С. 67-73.
4. Мандельброт_Б. Фрактальная геометрия природы. – М., 2002. – 656 с.

Comments are closed.