Related papers: Probabilistic shadowing in linear skew products
We prove that the two-sided limit shadowing property is among the strongest known notions of pseudo-orbit tracing. It implies shadowing, average shadowing, asymptotic average shadowing and specification properties. We also introduce a…
Inspired by an example of Grebogi et al [1], we study a class of model systems which exhibit the full two-step scenario for the nonautonomous Hopf bifurcation, as proposed by Arnold [2]. The specific structure of these models allows a…
We develop a criterion for transience for a general model of branching Markov chains. In the case of multi-dimensional branching random walk in random environment (BRWRE) this criterion becomes explicit. In particular, we show that…
We take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior…
We introduce and study skew product Smale endomorphisms over finitely irreducible topological Markov shifts with countable alphabets. We prove that almost all conditional measures of equilibrium states of summable and locally Holder…
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…
A classical result of Strassen asserts that given probabilities $\mu, \nu$ on the real line which are in convex order, there exists a \emph{martingale coupling} with these marginals, i.e.\ a random vector $(X_1,X_2)$ such that $X_1\sim \mu,…
This paper presents an original ABC algorithm, "ABC Shadow", that can be applied to sample posterior densities that are continuously differentiable. The proposed method uses the ideas given by the auxiliary variable MH of (M\o ller and…
Trickle-down is a phenomenon in high-dimensional expanders with many important applications -- for example, it is a key ingredient in various constructions of high-dimensional expanders or the proof of rapid mixing for the basis exchange…
In this work we develop a discrete trace theory that spans non-conforming hybrid discretization methods and holds on polytopal meshes. A notion of a discrete trace seminorm is defined, and trace and lifting results with respect to a…
Let (\Omega,\mu) be a shift of finite type with a Markov probability, and (Y,\nu) a non-atomic standard measure space. For each symbol i of the symbolic space, let \Phi_i be a measure-preserving automorphism of (Y,\nu). We study skew…
Cosmic shear tomography has emerged as one of the most promising tools to both investigate the nature of dark energy and discriminate between General Relativity and modified gravity theories. In order to successfully achieve these goals,…
We give the first tight sample complexity bounds for shadow tomography and classical shadows in the regime where the target error is below some sufficiently small inverse polynomial in the dimension of the Hilbert space. Formally we give a…
Many natural and engineered systems can be modeled as discrete state Markov processes. Often, only a subset of states are directly observable. Inferring the conditional probability that a system occupies a particular hidden state, given the…
Random Projections have been widely used to generate embeddings for various graph learning tasks due to their computational efficiency. The majority of applications have been justified through the Johnson-Lindenstrauss Lemma. In this paper,…
Let $Q$ be a probability measure on a finite group $G$, and let $H$ be a subgroup of $G$. We show that a necessary and sufficient condition for the random walk driven by $Q$ on $G$ to induce a Markov chain on the double coset space…
Central to model selection is a trade-off between performing a good fit and low model complexity: A model of higher complexity should only be favoured over a simpler model if it provides significantly better fits. In Bayesian terms, this…
The theme of this paper was motivated by the question: How effective are path-following procedures for tracing the pseudospectral boundary? The present study of the mathematical properties of the boundary of the pseudospectrum is the…
A partially hyperbolic dynamical system is said to have the quasi-shadowing property if every pseudotrajectory can be shadowed by a sequence of points $(x_n)_{n\in \Z}$ such that $x_{n+1}$ is obtained from the image of $x_n$ by moving it by…
We derive novel conditions that guarantee convergence of the Sum-Product algorithm (also known as Loopy Belief Propagation or simply Belief Propagation) to a unique fixed point, irrespective of the initial messages. The computational…