Related papers: Simplicity of spectrum for certain multidimensiona…
It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-called finite range condition plays a prominent role. We show…
In the present paper, we consider large-scale differential Lyapunov matrix equations having a low rank constant term. We present two new approaches for the numerical resolution of such differential matrix equations. The first approach is…
We describe a simple algorithm for spectral graph sparsification, based on iterative computations of weighted spanners and uniform sampling. Leveraging the algorithms of Baswana and Sen for computing spanners, we obtain the first…
We develop a powerful and general method to provide rigorous and accurate upper and lower bounds for Lyapunov exponents of stochastic flows. Our approach is based on computer-assisted tools, the adjoint method and established results on the…
In this work, we present a comprehensive study of the relationship among uniform Lyapunov exponents, the Liouville trace formula, and adapted metrics for cocycles in Hilbert spaces. First, we prove that uniform Lyapunov exponents can be…
We provide conditions which imply the continuity of the Lyapunov exponents for non-uniformly fiber-bunched cocycles in $SL(2,\mathbb{R})$. The main theorem is an extension of the result of Backes, Brown and Butler and gives a partial answer…
We consider the first order periodic systems perturbed by a $2N\ts 2N$ matrix-valued periodic potential on the real line. The spectrum of this operator is absolutely continuous and consists of intervals separated by gaps. We define the…
We describe a simple but surprisingly effective technique of obtaining spectral multiplier results for abstract operators which satisfy the finite propagation speed property for the corresponding wave equation propagator. We show that, in…
A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…
We deal with consistency results for the existence of universal models in natural classes of models (more exactly--a somewhat weaker version). We apply a result on quite general family to T_feq and to the class of triangle-free graphs.
We present a unified treatment of the Fourier spectra of spherically symmetric nonlocal diffusion operators. We develop numerical and analytical results for the class of kernels with weak algebraic singularity as the distance between source…
Lyapunov functions play a fundamental role in analyzing the stability and convergence properties of optimization methods. In this paper, we propose a novel and straightforward approach for constructing Lyapunov functions for first-order…
We present a simple discretization scheme for the hypersingular integral representation of the fractional Laplace operator and solver for the corresponding fractional Laplacian problem. Through singularity subtraction, we obtain a…
We continue the investigation on the spectrum of operators arising from the discretization of partial differential equations. In this paper we consider a three field formulation recently introduced for the finite element least-squares…
We propose an efficient method to compute Lyapunov exponents and Lyapunov eigenvectors of long-range interacting many-particle systems, whose dynamics is described by the Vlasov equation. We show that an expansion of a distribution function…
In the numerical treatment of large-scale Sylvester and Lyapunov equations, projection methods require solving a reduced problem to check convergence. As the approximation space expands, this solution takes an increasing portion of the…
By considering an empirical approximation, and a new class of operators that we will call walking operators, we construct, for any positive ND-toeplitz matrix, an infinite in all dimensions matrix, for which the inverse approximates the…
Network Markov Decision Processes (MDPs), a popular model for multi-agent control, pose a significant challenge to efficient learning due to the exponential growth of the global state-action space with the number of agents. In this work,…
This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the…
In this note we will describe a simple and practical approach to get rigorous bounds on the Hausdorff dimension of limits sets for some one dimensional Markov iterated function schemes. The general problem has attracted considerable…