Related papers: Rational arrival processes with strictly positive …

We study the problem of restricting a Markov equivalence class of maximal ancestral graphs (MAGs) to only those MAGs that contain certain edge marks, which we refer to as expert or orientation knowledge. Such a restriction of the Markov…

We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…

Let $K$ be a number field, and $\varphi_{1},\ldots,\varphi_{g}\in K(t)$ be finitely many rational maps, each of degree at least $2$. We first show that for generic finite sets $\mathcal{A}_{1},\ldots,\mathcal{A}_{g}$ consisting entirely of…

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

We prove a conjecture of Medvedev and Scanlon in the case of regular morphisms of semiabelian varieties. That is, if $G$ is a semiabelian variety defined over an algebraically closed field $K$ of characteristic $0$, and $\varphi\colon G\to…

\noindent Consider an infinite collection of particles on the real line moving according to independent Brownian motions and such that the $i$-th particle from the left gets the drift $g_{i-1}$. The case where $g_0=1$ and $g_{i}=0$ for all…

Let $G$ be a semiabelian variety defined over an algebraically closed field $K$ of characteristic $0$. Let $\Phi\colon G\dashrightarrow G$ be a dominant rational self-map. Assume that an iterate $\Phi^m \colon G \to G$ is regular for some…

Let $G$ be a finite group. The Bogomolov multiplier $B_0(G)$ is constructed as an obstruction to the rationality of $\bm{C}(V)^G$ where $G\to GL(V)$ is a faithful representation over $\bm{C}$. We prove that, for any finite groups $G_1$ and…

In this note we re-visit the fundamental question of the strong law of large numbers and central limit theorem for processes in continuous time with conditional stationary and independent increments. For convenience we refer to them as…

1. A standard Gaussian random matrix has full rank with probability 1 and is well-conditioned with a probability quite close to 1 and converging to 1 fast as the matrix deviates from square shape and becomes more rectangular. 2. If we…

Many complex applications require the solution of initial-value problems where some components change fast, while others vary slowly. Multirate schemes apply different step sizes to resolve different components of the system, according to…

We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated to the chain form a linear space spanning a Lie algebra. The key…

For two positive maps $\phi_i:B(\mathcal{K}_i)\to B(\mathcal{H}_i)$, $i=1,2$, we construct a new linear map $\phi:B(\mathcal{H})\to B(\mathcal{K})$, where $\mathcal{K}=\mathcal{K}_1\oplus\mathcal{K}_2\oplus\mathbb{C}$,…

We obtain new types of exponential decay laws for solutions of density-matrix master equations in the weak-coupling limit: after comparing with results already present in the literature and developing the necessary techniques, we study the…

In recent work, Chaumont et al. [9] showed that is possible to condition a stable process with index ${\alpha} \in (1,2)$ to avoid the origin. Specifically, they describe a new Markov process which is the Doob h-transform of a stable…

We develop an exactly solvable framework of Markov decision process with a finite horizon, and continuous state and action spaces. We first review the exact solution of conventional linear quadratic regulation with a linear transition and a…

First-passage times are often the most relevant aspect of a complex Markovian network, because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks…

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…

Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…