Related papers: Large Deviations for Markovian Graphon Processes a…
We study large deviations in the context of stochastic gradient descent for one-hidden-layer neural networks with quadratic loss. We derive a quenched large deviation principle, where we condition on an initial weight measure, and an…
Large-scale recurrent networks have drawn increasing attention recently because of their capabilities in modeling a large variety of real-world phenomena and physical mechanisms. This paper studies how to identify all authentic connections…
When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif counts are expensive to compute and difficult to work with…
We study large deviations of the time-averaged size of stochastic populations described by a continuous-time Markov jump process. When the expected population size $N$ in the steady state is large, the large deviation function (LDF) of the…
We consider a broad class of dynamic programming (DP) problems that involve a partially linear structure and some positivity properties in their system equation and cost function. We address deterministic and stochastic problems, possibly…
We study generic open quantum systems with Markovian dissipation, focusing on a class of stochastic Liouvillian operators of Lindblad form with independent random dissipation channels (jump operators) and a random Hamiltonian. We perform a…
In this paper, we introduce a mathematical apparatus that is relevant for understanding a dynamical system with small random perturbations and coupled with the so-called transmutation process -- where the latter jumps from one mode to…
In this paper, we develop a general law of large numbers and central limit theorem for cumulative reward processes associated with finite state Markov jump processes with non-stationary transition rates. Such models commonly arise in…
We study the large deviation principle (LDP) for locally damped nonlinear wave equations perturbed by a bounded noise. When the noise is sufficiently non-degenerate, we establish the LDP for empirical distributions with lower bound of a…
We analyse large deviations of time-averaged quantities in stochastic processes with long-range memory, where the dynamics at time t depends itself on the value q_t of the time-averaged quantity. First we consider the elephant random walk…
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…
In this work, we study dynamic programming (DP) algorithms for partially observable Markov decision processes with jointly continuous and discrete state-spaces. We consider a class of stochastic systems which have coupled discrete and…
In a series of two papers, we investigate the large deviations and asymptotic behavior of stochastic models of brain neural networks with random interaction coefficients. In this first paper, we take into account the spatial structure of…
In this paper we derive a Large Deviation Principle (LDP) for inhomogeneous U/V-statistics of a general order. Using this, we derive a LDP for two types of statistics: random multilinear forms, and number of monochromatic copies of a…
Birth-death processes form a natural class where ideas and results on large deviations can be tested. In this paper, we derive a large deviation principle under the assumption that the rate of a jump down (death) is growing asymptotically…
We study the asymptotic behavior of multiscale stochastic gene networks using weak limits of Markov jump processes. Depending on the time and concentration scales of the system we distinguish four types of limits: continuous piecewise…
We study the problem of finite-horizon probabilistic invariance for discrete-time Markov processes over general (uncountable) state spaces. We compute discrete-time, finite-state Markov chains as formal abstractions of general Markov…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
The purpose of this paper is to ensure the conditions of G\"artner-Ellis Theorem for evaluations of the empirical measure. We show that up-to-date conditions for ensuring the convergence to a quasi-stationary distribution can be applied…
This paper investigates the optimization problem of an infinite stage discrete time Markov decision process (MDP) with a long-run average metric considering both mean and variance of rewards together. Such performance metric is important…