We present almost sure central limit theorems for stochastic processes whose time parameter ranges over the d-dimensional unit cube. Our purpose here is to generalize the classic functional central limit theorem of Prokhorov ...

An extension of the Bassalygo-Dobrushin technique of proving uniqueness of Gibbs fields on irregular graphs, developed in [Theory of Probab. Appl. 31, 572–589 (1986)], to the case of continuous spins has been presented.

Natural iterative methods converge to the exact solution of a differential-functional von Foerster-type equation which describes a single population dependent on its past time and state densities as well as on its total ...

Harmonic analysis on configuration spaces is used in order to extend explicit expressions for the images of creation, annihilation, and second quantization operators in L²-spaces with respect to Poisson point processes to ...

Numerous complex networks contain special patterns, called network motifs. These are specific subgraphs, which occur oftener than in randomized networks of Erd˝os-R´enyi type. We choose one of them, the triangle, and ...

The paper is devoted to computer implementation of some graph based stream ciphers. We compare the time performance of this new algorithm with fast, but no very secure RC4, and with DES. It turns out that some of new ...

We consider a simple model of discrete-time random walk on Zν, ν = 1, 2, . . . in a random environment independent in space and with Markov evolution in time. We focus on the application of methods based on the properties ...

We give in the paper a brief overview of how the Gibbs fields and related dynamics approaches are applied in image processing. We discuss classical pixel-wise models as well as more recent spatial point process models ...