Related papers: Spectral Simplicity of Apparent Complexity, Part I…
We present a class of stochastic processes in which the large deviation functions of time-integrated observables exhibit singularities that relate to dynamical phase transitions of trajectories. These illustrative examples include Brownian…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
Atomistic simulations with methods such as molecular dynamics are extremely powerful tools to understand nanoscale dynamical behavior. The resulting trajectories, by the virtue of being embedded in a high-dimensional configuration space,…
We formulate a geometric measurement theory of dynamical classical systems possessing both continuous and discrete degrees of freedom. The approach is covariant with respect to choices of clocks and canonically incorporates laboratories.…
A dynamical symmetry is employed to determine the structure of the quantum non-Markovian time-local master equation. Such a structure is composed from two components: scalar kinetic coefficients and the standard quantum Markovian operator…
Finding the dynamical law of observable quantities lies at the core of physics. Within the particular field of statistical mechanics, the generalized Langevin equation (GLE) comprises a general model for the evolution of observables…
For many stochastic processes there is an underlying coordinate space, $V$, with the process moving from point to point in $V$ or on variables (such as spin configurations) defined with respect to $V$. There is a matrix of transition…
The classical spectral theorem completely describes self-adjoint operators on finite dimensional inner product vector spaces as linear combinations of orthogonal projections onto pairwise orthogonal subspaces. We prove a similar theorem for…
Complex data usually results from the interaction of objects produced by different generating mechanisms. Here we introduce a universal, unsupervised and parameter-free model-oriented approach, based upon the seminal concept of algorithmic…
We continue the investigation of the spectral theory and exponential asymptotics of Markov processes, following Kontoyiannis and Meyn (2003). We introduce a new family of nonlinear Lyapunov drift criteria, characterizing distinct subclasses…
The free Jacobi process is the radial part of the compression of the free unitary Brownian motion by two free orthogonal projections in a non commutative probability space. In this paper, we derive spectral properties of the free Jacobi…
Hamiltonian systems with functionally dependent constraints (irregular systems), for which the standard Dirac procedure is not directly applicable, are discussed. They are classified according to their behavior in the vicinity of the…
The notion of Markov duality between two Markov processes that can live in two different configurations spaces $(x,{\tilde x})$ is revisited via the spectral decompositions of the two Markov generators in their bi-orthogonal basis of right…
We introduce a novel generative formulation of deep probabilistic models implementing "soft" constraints on their function dynamics. In particular, we develop a flexible methodological framework where the modeled functions and derivatives…
Evolution of arbitrary stochastic system was considered in frame of phase transition description. Concept of Reynolds parameter of hydrodynamic motion was extended to arbitrary complex system. Basic phase parameter was expressed through…
We define a class of probabilistic models in terms of an operator algebra of stochastic processes, and a representation for this class in terms of stochastic parameterized grammars. A syntactic specification of a grammar is mapped to…
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts. We define the spectral complexity metric in terms of the…
For a class of piecewise deterministic Markov processes we introduce a stochastic calculus which is a certain non-Gaussian counterpart to the classical Malliavin calculus. As an application we investigate the regularity of densities of…
We propose a new framework for imposing monotonicity constraints in a Bayesian nonparametric setting based on numerical solutions of stochastic differential equations. We derive a nonparametric model of monotonic functions that allows for…
Recently, a class of stochastic processes known as piecewise deterministic Markov processes has been used to define continuous-time Markov chain Monte Carlo algorithms with a number of attractive properties, including compatibility with…