Related papers: A class of multifractal processes constructed usin…
We study the evolution of a particle system whose genealogy is given by a supercritical continuous time Galton--Watson tree. The particles move independently according to a Markov process and when a branching event occurs, the offspring…
We prove several results concerning classifications, based on successive observations $(X_1,..., X_n)$ of an unknown stationary and ergodic process, for membership in a given class of processes, such as the class of all finite order Markov…
Consider an n-fold integrated Brownian motion. We show that a simple change in time and scale transforms it into a stationary Gaussian process. The collection of stationary processes so constructed not only constitutes an interesting family…
We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…
We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is…
Over the last few years, network science has proved to be useful in modeling a variety of complex systems, composed of a large number of interconnected units. The intricate pattern of interactions often allows the system to achieve complex…
A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.
Though reinforcement learning has greatly benefited from the incorporation of neural networks, the inability to verify the correctness of such systems limits their use. Current work in explainable deep learning focuses on explaining only a…
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a…
In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…
We present a simple construction method for Feller processes and a framework for the generation of sample paths of Feller processes. The construction is based on state space dependent mixing of L\'evy processes. Brownian Motion is one of…
We consider a particle system in continuous time, discrete population, with spatial motion and nonlocal branching. The offspring's weights and their number may depend on the mother's weight. Our setting captures, for instance, the processes…
Graphs are often used to organize data because of their simple topological structure, and therefore play a key role in machine learning. And it turns out that the low-dimensional embedded representation obtained by graph representation…
The aim of this paper is to introduce a multitype branching process with random migration following the research initiated with the Galton-Watson process with migration introduced in [Yanev & Mitov (1980) C. R. Acad. Bulg. Sci.…
In this work, we present a general method to establish properties of multi-dimensional continuous-time Markov chains representing stochastic reaction networks. This method consists of grouping states together (via a partition of the state…
We introduce methods for large scale Brownian Dynamics (BD) simulation of many rigid particles of arbitrary shape suspended in a fluctuating fluid. Our method adds Brownian motion to the rigid multiblob method at a cost comparable to the…
We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and type and give rise to (size,type)-children in a Galton-Watson fashion, with the rule that…
We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…
The theory of ``Markov-up'' processes is being developed. This is a new class of stochastic processes with ``partial'' markovian features; it could also be called ``one-sided Markov''. Such a behavior may be found in the real world and in…
We propose to use a simulation driven inverse inference approach to model the dynamics of tree branches under manipulation. Learning branch dynamics and gaining the ability to manipulate deformable vegetation can help with occlusion-prone…