Related papers: A Note on the Polynomial Ergodicity of the One-Dim…
In this paper a concentration inequality is proved for the deviation in the ergodic theorem in the case of discrete time observations of diffusion processes. The proof is based on the geometric ergodicity property for diffusion processes.…
We study expansiveness properties of positive measure subsets of ergodic $\mathbb{Z}^d$-actions along two different types of structured subsets of $\mathbb{Z}^d$, namely, cyclic subgroups and images of integer polynomials. We prove…
Let $X$ be a one dimensional positive recurrent diffusion with initial distribution $\nu$ and invariant probability $\mu$. Suppose that for some $p> 1$, $\exists a\in\R$ such that $\forall x\in\R, \E_x T_a^p<\infty$ and $\E_\nu…
P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
We give necessary and sufficient conditions for joint ergodicity results of collections of sequences with respect to systems of commuting measure preserving transformations. Combining these results with a new technique that we call…
We prove mean convergence, as $N\to\infty$, for the multiple ergodic averages $\frac{1}{N}\sum_{n=1}^N f_1(T_1^{p_1(n)}x)... f_\ell(T_\ell^{p_\ell(n)}x)$, where $p_1,...,p_\ell$ are integer polynomials with distinct degrees, and…
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…
We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi et al. to linear…
Meta-learning has been proposed as a promising machine learning topic in recent years, with important applications to image classification, robotics, computer games, and control systems. In this paper, we study the problem of using…
In this note we obtain tight bounds on the space-complexity of computing the ergodic measure of a low-dimensional discrete-time dynamical system affected by Gaussian noise. If the scale of the noise is $\varepsilon$, and the function…
We consider the problem of learning high dimensional polynomial transformations of Gaussians. Given samples of the form $p(x)$, where $x\sim N(0, \mathrm{Id}_r)$ is hidden and $p: \mathbb{R}^r \to \mathbb{R}^d$ is a function where every…
We obtain expansions of ergodic integrals for $\Z^d$-covers of compact self-similar translation flows, and as a consequence we obtain a form of weak rational ergodicity with optimal rates. As examples, we consider the so-called self-similar…
There has been substantial interest in developing Markov chain Monte Carlo algorithms based on piecewise-deterministic Markov processes. However existing algorithms can only be used if the target distribution of interest is differentiable…
This paper studies ergodic properties of certain measures arising in the dynamics of holomorphic correspondences. These measures, in general, are not invariant in the classical sense of ergodic theory. We define a notion of ergodicity, and…
Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta…
Recovering underlying Directed Acyclic Graph (DAG) structures from observational data is highly challenging due to the combinatorial nature of the DAG-constrained optimization problem. Recently, DAG learning has been cast as a continuous…
This article studies the convergence properties of trans-dimensional MCMC algorithms when the total number of models is finite. It is shown that, for reversible and some non-reversible trans-dimensional Markov chains, under mild conditions,…
The one variable Bernstein-Szego theory for orthogonal polynomials on the real line is extended to a class of two variable measures. The polynomials orthonormal in the total degree ordering and the lexicographical ordering are constructed…
We consider importance sampling as well as other properly weighted samples with respect to a target distribution $\pi$ from a different point of view. By considering the associated weights as sojourn times until the next jump, we define…