Related papers: Statistical Analysis of Composite Spectra
Two-dimensional mappings obtained by coupling two piecewise increasing expanding maps are considered. Their dynamics is described when the coupling parameter increases in the expanding domain. By introducing a coding and by analysing an…
This paper is concerned with the asymptotic optimality of spectral coarse spaces for two-level iterative methods. Spectral coarse spaces, namely coarse spaces obtained as the span of the slowest modes of the used one-level smoother, are…
Classification models are expected to perform equally well for different classes, yet in practice, there are often large gaps in their performance. This issue of class bias is widely studied in cases of datasets with sample imbalance, but…
The problem of approximating the discrete spectra of families of self-adjoint operators that are merely strongly continuous is addressed. It is well-known that the spectrum need not vary continuously (as a set) under strong perturbations.…
Sampling is a fundamental topic in graph signal processing, having found applications in estimation, clustering, and video compression. In contrast to traditional signal processing, the irregularity of the signal domain makes selecting a…
Entropy is a measure of heterogeneity widely used in applied sciences, often when data are collected over space. Recently, a number of approaches has been proposed to include spatial information in entropy. The aim of entropy is to…
The competition between strength and correlation of coupling terms in a Hamiltonian defines numerous phenomenological models exhibiting spectral properties interpolating between those of Poisson (integrable) and Wigner-Dyson (chaotic)…
A statistical description of part of a many body system often requires a non-Hermitian random matrix ensemble with nature and strength of randomness sensitive to underlying system conditions. For the ensemble to be a good description of the…
For a multi-agent system state estimation resting upon noisy measurements constitutes a problem related to several application scenarios. Adopting the standard least-squares approach, in this work we derive both the (centralized) analytic…
Singular Spectrum Analysis and many other subspace-based methods of signal processing are implicitly relying on the assumption of close proximity of unperturbed and perturbed signal subspaces extracted by the Singular Value Decomposition of…
Computational spectrometers are at the forefront of spectroscopy, promising portable, on-chip, or in-situ spectrum analysis through the integration of advanced computational techniques into optical systems. However, existing computational…
The problem of estimating the spectrum of a density matrix is considered. Other problems, such as bipartite pure state entanglement, can be reduced to spectrum estimation. A local operations and classical communication (LOCC) measurement…
With their ability to handle an increased amount of information, multivariate and multichannel signals can be used to solve problems normally not solvable with signals obtained from a single source. One such problem is the decomposition…
We investigate the performance of entropy estimation methods, based either on block entropies or compression approaches, in the case of bidimensional sequences. We introduce a validation dataset made of images produced by a large number of…
The observable spectrum of an unresolved binary star system is a superposition of two single-star spectra. Even without a detectable velocity offset between the two stellar components, the combined spectrum of a binary system is in general…
We present a method for the decomposition of mass spectra of mixture gases using Bayesian probability theory. The method works without any calibration measurement and therefore applies also to the analysis of spectra containing unstable…
Matrix inversion problems are often encountered in experimental physics, and in particular in high-energy particle physics, under the name of unfolding. The true spectrum of a physical quantity is deformed by the presence of a detector,…
We consider a random geometric graph with vertices sampled from a probability measure supported on $\mathbb R^d$, and study its connectivity. We show the graph is typically disconnected, unless the sampling density has superexponential…
When randomized ensemble methods such as bagging and random forests are implemented, a basic question arises: Is the ensemble large enough? In particular, the practitioner desires a rigorous guarantee that a given ensemble will perform…
We study synchronization processes in networks of slightly non identical chaotic systems, for which a complete invariant synchronization manifold does not rigorously exist. We show and quantify how a slightly dispersed distribution in…