Related papers: A class of multifractal processes constructed usin…
Rooted bifurcating trees are mathematical objects used to model evolutionary relationships and arise naturally in both coalescent theory and phylogenetics. Recent numerical representations of tree topologies, known as F-matrices, allow for…
We achieve the multifractal analysis of a class of complex valued statistically self-similar continuous functions. For we use multifractal formalisms associated with pointwise oscillation exponents of all orders. Our study exhibits new…
We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…
We consider branching processes describing structured, interacting populations in continuous time. Dynamics of each individuals characteristics and branching properties can be influenced by the entire population. We propose a Girsanov-type…
This paper gives a brief introduction to some important fractional and multifractional Gaussian processes commonly used in modelling natural phenomena and man-made systems. The processes include fractional Brownian motion (both standard and…
Generating robot motion that fulfills multiple tasks simultaneously is challenging due to the geometric constraints imposed by the robot. In this paper, we propose to solve multi-task problems through learning structured policies from human…
Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
We introduce Markov Neural Processes (MNPs), a new class of Stochastic Processes (SPs) which are constructed by stacking sequences of neural parameterised Markov transition operators in function space. We prove that these Markov transition…
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected…
We consider a general honest homogeneous continuous-time Markov process with restarts. The process is forced to restart from a given distribution at time moments generated by an independent Poisson process. The motivation to study such…
This paper concerns the Vertex Reinforced Jump Process (VRJP) and its representations as a Markov process in random environment. We show that all possible representations of the VRJP as a mixture of Markov processes can be expressed in a…
We present an approximated maximum likelihood method for the multifractal random walk processes of [E. Bacry et al., Phys. Rev. E 64, 026103 (2001)]. The likelihood is computed using a Laplace approximation and a truncation in the…
We construct a class of discontinuous superprocesses with dependent spatial motion and general branching mechanism. The process arises as the weak limit of critical interacting-branching particle systems where the spatial motions of the…
We construct a stochastic process whose drift is a function of the process's local time at a reflecting barrier. The process arose as a model of the interactions of a Brownian particle and an inert particle in (Knight, 2001). Interesting…
Continuous time branching models are used to create random fractals in a Euclidean space, whose Hausdorff dimension is controlled by an input parameter. Finite realizations are applied in modelling the set of sites visited in models of…
In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…
We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{{\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…
An intrinsic multitype branching structure within the transient (1;R)-RWRE is revealed. The branching structure enables us to specify the density of the absolutely continuous invariant measure for the environments seen from the particle and…