Related papers: Relative Lonely Runner spectra

We consider random walk on a discrete torus E of side-length N, in sufficiently high dimension d. We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk…

The R\'enyi entanglement entropy is widely used in studying quantum entanglement properties in strongly correlated systems, whose analytic continuation as the R\'enyi index $n \to 1$ is often believed to yield the von Neumann entanglement…

Suppose that $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d( v_i,v_j ) $ be the distance between $v_i$ and $v_j$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} )_{n\times n}$, where…

For nonautonomous linear difference equations, we introduce the notion of the so-called nonuniform dichotomy spectrum and prove a spectral theorem. Moreover, we introduce the notion of weak kinematical similarity and prove a reducibility…

This article presents in a self-contained way A. Uhlmann's celebrated Theorem of monotonicity of the relative entropy under completely positive and trace preserving maps. The Theorem is presented in its more general form and meaningful…

The Lonely Runner Conjecture originated in Diophantine approximation is turning 60. Even if the conjecture is still widely open, the flow of partial results, innovative tools and connections to different problems and applications has been…

We calculate the threshold singularities in one-dimensional models using the universal low-energy formfactors obtained in the framework of the non-linear Luttinger liquid model. We find the reason why the simplified picture of the impurity…

It has been observed that the performances of many high-dimensional estimation problems are universal with respect to underlying sensing (or design) matrices. Specifically, matrices with markedly different constructions seem to achieve…

In a variety of contexts, we prove that singular continuous spectrum is generic in the sense that for certain natural complete metric spaces of operators, those with singular spectrum are a dense $G_\delta$.

A common misconception is that Lorentz invariance is inconsistent with a discrete spacetime structure and a minimal length: under Lorentz contraction, a Planck length ruler would be seen as smaller by a boosted observer. We argue that in…

The local spectrum of a vertex set in a graph has been proven to be very useful to study some of its metric properties. It also has applications in the area of pseudo-distance-regularity around a set and can be used to obtain quasi-spectral…

The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…

We study a random conductance problem on a $d$-dimensional discrete torus of size $L > 0$. The conductances are independent, identically distributed random variables uniformly bounded from above and below by positive constants. The…

We discuss conditions under which a deterministic sequence of real numbers, interpreted as the set of eigenvalues of a Hamiltonian, can exhibit features usually associated to random matrix spectra. A key diagnostic is the spectral form…

In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e.,…

We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy's quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of…

We examine the sets of late points of a symmetric random walk on $Z^2$ projected onto the torus $Z^2_K$, culminating in a limit theorem for the cover time of the toral random walk. This extends the work done for the simple random walk in…

We introduce, in the dual Macaev ideal of compact operators of a Hilbert space, the spectral weight $\rho(L)$ of a positive, self-adjoint operator $L$ having discrete spectrum away from zero. We provide criteria for its measurability and…

Let $\mathcal{Q}$ be a vertex subset problem on graphs. In a reconfiguration variant of $\mathcal{Q}$ we are given a graph $G$ and two feasible solutions $S_s, S_t\subseteq V(G)$ of $\mathcal{Q}$ with $|S_s|=|S_t|=k$. The problem is to…

Distance measures between quantum states like the trace distance and the fidelity can naturally be defined by optimizing a classical distance measure over all measurement statistics that can be obtained from the respective quantum states.…