Related papers: Kernel Radon-Nikodym Derivatives for Random Matrix…

We associate with k hermitian N\times N matrices a probability measure on R^k. It is supported on the joint numerical range of the k-tuple of matrices. We call this measure the joint numerical shadow of these matrices. Let k=2. A pair of…

Suppose we are given finitely generated groups $\Gamma_1,...,\Gamma_m$ equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic…

Series elastic actuators (SEA) were introduced for serial robotic arms. Their model-based trajectory tracking control requires the second time derivatives of the inverse dynamics solution, for which algorithms were proposed. Trajectory…

We explore the boundaries of sine kernel universality for the eigenvalues of Gaussian perturbations of large deterministic Hermitian matrices. Equivalently, we study for deterministic initial data the time after which Dyson's Brownian…

If $\mu_1,\mu_2,\dots$ are positive measures on a measurable space $(X,\Sigma)$ and $v_1,v_2, \dots$ are elements of a Banach space ${\mathbb E}$ such that $\sum_{n=1}^\infty \|v_n\| \mu_n(X) < \infty$, then $\omega (S)= \sum_{n=1}^\infty…

For each $n$, let $A_n=(\sigma_{ij})$ be an $n\times n$ deterministic matrix and let $X_n=(X_{ij})$ be an $n\times n$ random matrix with i.i.d. centered entries of unit variance. In the companion article Cook et al., we considered the…

In a general context of positive definite kernels $k$, we develop tools and algorithms for sampling in reproducing kernel Hilbert space $\mathscr{H}$ (RKHS). With reference to these RKHSs, our results allow inference from samples; more…

We introduce a general method for transforming the equations of motion following from a Das-Jevicki-Sakita Hamiltonian, with boundary conditions, into a boundary value problem in one-dimensional quantum mechanics. For the particular case of…

This paper presents a new approach to the analysis of mixed processes \[X_t=B_t+G_t,\qquad t\in[0,T],\] where $B_t$ is a Brownian motion and $G_t$ is an independent centered Gaussian process. We obtain a new canonical innovation…

We study distributions of meeting times for finite symmetric Markov chains. For Markov kernels defined on large state spaces which satisfy certain weak inhomogeneity in return probabilities of points up to large numbers of steps, we obtain…

We study ergodic properties of some Markov chains models in random environments when the random Markov kernels that define the dynamic satisfy some usual drift and small set conditions but with random coefficients. In particular, we adapt a…

Let $\{X_n\}_{n\in\N}$ be a Markov chain on a measurable space $\X$ with transition kernel $P$ and let $V:\X\r[1,+\infty)$. The Markov kernel $P$ is here considered as a linear bounded operator on the weighted-supremum space $\cB_V$…

We propose new reproducing kernel-based tests for model checking in conditional moment restriction models. By regressing estimated residuals on kernel functions via kernel ridge regression (KRR), we obtain a coefficient function in a…

Real-world dynamical systems with retardation effects are described in general not by a single, precisely defined time delay, but by a range of delay times. An exact mapping onto a set of $N+1$ ordinary differential equations exists when…

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…

Rahimi and Recht (2007) introduced the idea of decomposing positive definite shift-invariant kernels by randomly sampling from their spectral distribution for machine learning applications. This famous technique, known as Random Fourier…

For each $n$, let $A_n=(\sigma_{ij})$ be an $n\times n$ deterministic matrix and let $X_n=(X_{ij})$ be an $n\times n$ random matrix with i.i.d. centered entries of unit variance. We study the asymptotic behavior of the empirical spectral…

We provide the first mathematically complete derivation of the Nystr\"om method for low-rank approximation of indefinite kernels and propose an efficient method for finding an approximate eigendecomposition of such kernel matrices. Building…

In this brief research note I present a generalized version of the Savage-Dickey Density Ratio for representation of the Bayes factor (or marginal likelihood ratio) of nested statistical models; the new version takes the form of a…

Stochastic Gradient Descent (SGD) is a known stochastic iterative method popular for large-scale convex optimization problems due to its simple implementation and scalability. Some objectives, such as those found in complex-valued neural…