Related papers: Dynamically Defined Sequences with Small Discrepan…

Uniform sampling of simple graphs having a given degree sequence is a known problem with exponential complexity in the square of the mean degree. For undirected graphs, randomised approximation algorithms have nonetheless been shown to…

Inspired by the success of Convolutional Neural Networks (CNNs) for supervised prediction in images, we design the Deconvolutional Generative Model (DGM), a new probabilistic generative model whose inference calculations correspond to those…

We discuss the notion of "discrete function bases" with a particular focus on the discrete basis derived from the Legendre Delay Network (LDN). We characterize the performance of these bases in a delay computation task, and as fixed…

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

For any norms $N_1,\ldots,N_m$ on $\mathbb{R}^n$ and $N(x) := N_1(x)+\cdots+N_m(x)$, we show there is a sparsified norm $\tilde{N}(x) = w_1 N_1(x) + \cdots + w_m N_m(x)$ such that $|N(x) - \tilde{N}(x)| \leq \epsilon N(x)$ for all $x \in…

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…

The discrepancy sum $D_N(x,\rho)$ for irrational rotations has been of interest to mathematicians for over a century. While historically studied in an ``almost-everywhere'' or asymptotic sense, $D_N$ for finite N is increasingly an object…

A (d-parameter) basic nilsequence is a sequence of the form \psi(n)=f(a^{n}x), n \in Z^{d}, where x is a point of a compact nilmanifold X, a is a translation on X, and f is a continuous function on X; a nilsequence is a uniform limit of…

We obtain some new results concerning the small deviation problem for $S=\sum_n q^n X_n$ and $M=\sup_n q^n X_n$, where $0<q<1$ and $(X_n)$ are i.i.d. non-negative random variables. In particular, the asymptotics is shown to be the same for…

We study the weak limits of solutions to SDEs \[dX_n(t)=a_n\bigl(X_n(t)\bigr)\,dt+dW(t),\] where the sequence $\{a_n\}$ converges in some sense to $(c_- 1\mkern-4.5mu\mathrm{l}_{x<0}+c_+ 1\mkern-4.5mu\mathrm{l}_{x>0})/x+\gamma\delta_0$.…

In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…

We study approximation of non-autonomous linear differential equations with variable delay over infinite intervals. We use piecewise constant argument to obtain a corresponding discrete difference equation. The study of numerical…

Synthesizing human's movements such as dancing is a flourishing research field which has several applications in computer graphics. Recent studies have demonstrated the advantages of deep neural networks (DNNs) for achieving remarkable…

We consider the family of Lucas sequences uniquely determined by $U_{n+2}(k)=(4k+2)U_{n+1}(k) -U_n(k),$ with initial values $U_0(k)=0$ and $U_1(k)=1$ and $k\ge 1$ an arbitrary integer. For any integer $n\ge 1$ the discriminator function…

Let $(X_n)_{n\in \mathbb{N}}$ be a sequence of i.i.d. random variables with distribution $\mathbb P(X_1=1)=\mathbb P(X_1=-1)=1/2$. Let $F(\sigma)=\sum_{n=1}^\infty X_nn^{-\sigma}$. We prove that the following holds almost surely…

Examples are constructed of sparse subsequences of the integers for which the associated maximal averages operator is of weak type (1,1). A consequence, by transference, is that an almost everywhere L^1 -- type ergodic theorem holds for…

We consider a sequence of random variables $(R_n)$ defined by the recurrence $R_n=Q_n+M_nR_{n-1}$, $n\ge1$, where $R_0$ is arbitrary and $(Q_n,M_n)$, $n\ge1$, are i.i.d. copies of a two-dimensional random vector $(Q,M)$, and $(Q_n,M_n)$ is…

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

We improve recently published results about resources of Restricted Boltzmann Machines (RBM) and Deep Belief Networks (DBN) required to make them Universal Approximators. We show that any distribution p on the set of binary vectors of…