Related papers: K-processes, scaling limit and aging for the trap …
In graph theoretical models of the spread of disease through populations, the spread of opinion through social networks, and the spread of faults through distributed computer networks, vertices are in two states, either black or white, and…
We consider symmetric trap models in the d-dimensional hypercube whose ordered mean waiting times, seen as weights of a measure in the natural numbers, converge to a finite measure as d diverges, and show that the models suitably…
We have studied Markov processes on denumerable state space and continuous time. We found that all these processes are connected via gauge transformations. We have used this result before as a method for resolution of equations, included…
We consider the graph dynamical systems known as k-reversible processes. In such processes, each vertex in the graph has one of two possible states at each discrete time step. Each vertex changes its state between the current time and the…
Consider the continuous-time Markov Branching Process. In critical case we consider a situation when the generating function of intensity of transformation of particles has the infinite second moment, but its tail regularly varies in sense…
Many problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes (QBDs) with…
Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching…
For a finite state Markov process and a finite collection $\{ \Gamma_k, k \in K \}$ of subsets of its state space, let $\tau_k$ be the first time the process visits the set $\Gamma_k$. We derive explicit/recursive formulas for the joint…
Given a graph, a $k$-plex is a set of vertices in which each vertex is not adjacent to at most $k-1$ other vertices in the set. The maximum $k$-plex problem, which asks for the largest $k$-plex from the given graph, is an important but…
For an infinite system of particles arriving in and departing from a habitat $X$ -- a locally compact Polish space with a positive Radon measure $\chi$ -- a Markov process is constructed in an explicit way. Along with its location $x\in X$,…
This paper is concerned with the construction of several stochastic processes in a star graph, that is a non-euclidean structure where some features of the classical modelling fail. We propose a model for trapping phenomena with…
Large ensembles of stochastically evolving interacting particles describe phenomena in diverse fields including statistical physics, neuroscience, biology, and engineering. In such systems, the infinitesimal evolution of each particle…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
For k>=1, we consider the graph dynamical system known as a k-reversible process. In such process, each vertex in the graph has one of two possible states at each discrete time. Each vertex changes its state between the present time and the…
Our principal aim is to observe the Markov discrete-time process of population growth with long-living trajectory. First we study asymptotical decay of generating function of Galton-Watson process for all cases as the Basic Lemma.…
In this paper, a simple transient Markov process with an absorbing point is used to investigate the qualitative behavior of a large scale storage network of non reliable file servers where files can be duplicated. When the size of the…
Markov-modulated L\'evy processes with two different regimes of restarting are studied. These regimes correspond to the completely renewed process and to the process of Markov modulation, accompanied by jumps. We give explicit expressions…
The master equation and, more generally, Markov processes are routinely used as models for stochastic processes. They are often justified on the basis of randomization and coarse-graining assumptions. Here instead, we derive n-th order…
The Glauber dynamics of various models (REM-like trap models, Brownian motion, BM model, Ising chain and SK model) is analyzed in relation with the existence of ageing. From a finite size Glauber matrix, we calculate a time $\tau_w(N)$…
We study Markov processes where the "time" parameter is replaced by paths in a directed graph from an initial vertex to a terminal one. Along each directed path the process is Markov and has the same distribution as the one along any other…