Related papers: A new characterization of endogeny
We consider the random Markov matrix obtained by assigning i.i.d. non-negative weights to each edge of the complete oriented graph. In this study, the weights have unbounded first moment and belong to the domain of attraction of an…
We consider the framework of transfer-entropy-regularized Markov Decision Process (TERMDP) in which the weighted sum of the classical state-dependent cost and the transfer entropy from the state random process to the control random process…
In this work, we give a description of all sigma-finite measures on the space of rooted compact real trees which satisfy a certain regenerative property. We show that any infinite measure which satisfies the regenerative property is the…
The Marked Binary Branching Tree (MBBT) is the family tree of a rate one binary branching process, on which points have been generated according to a rate one Poisson point process, with i.i.d. uniformly distributed activation times…
We study infinite-horizon robust Markov decision processes (MDPs) on continuous state spaces with structured rectangular ambiguity set. The proposed ambiguity set falls within the convex hull of unknown generating kernels. We utilize the…
We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
We study two-state (dichotomous, telegraph) random ergodic continuous-time processes with dynamics depending on their past. We take into account the history of process in an explicit form by introducing an integral non-local memory term…
We continue our study of the dynamics of mappings with small topological degree on (projective) complex surfaces. Previously, under mild hypotheses, we have constructed an ergodic ``equilibrium'' measure for each such mapping. Here we study…
We give a development of the ODE method for the analysis of recursive algorithms described by a stochastic recursion. With variability modelled via an underlying Markov process, and under general assumptions, the following results are…
The transition matrix of a Markov chain $(X_k,k\geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_k$, the node $X_{k+1}$ is either a descendant of $X_k$ or the parent of $X_k$. It is said to be…
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
We introduce a notion of rough paths on embedded submanifolds and demonstrate that this class of rough paths is natural. On the way we develop a notion of rough integration and an efficient and intrinsic theory of rough differential…
Phylogenetic tree shapes capture fundamental signatures of evolution. We consider ``ranked'' tree shapes, which are equipped with a total order on the internal nodes compatible with the tree graph. Recent work has established an elegant…
We study the inverse problem of inferring the state of a finite-level quantum system from expected values of a fixed set of observables, by maximizing a continuous ranking function. We have proved earlier that the maximum-entropy inference…
The dynamics of the solutions to a class of conservative SPDEs are analysed from two perspectives: Firstly, a probabilistic construction of a corresponding random dynamical system is given for the first time. Secondly, the existence and…
A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…