Related papers: On the gap between deterministic and probabilistic…

We analyse the $\ell^2(\pi)$-convergence rate of irreducible and aperiodic Markov chains with $N$-band transition probability matrix $P$ and with invariant distribution $\pi$. This analysis is heavily based on: first the study of the…

In this letter, we improve the results in [5] by relaxing the symmetry assumption and also taking the noise term into account. The author examines two discrete-time autonomous linear systems whose motivation comes from a neural network…

Let $P$ be a bistochastic matrix of size $n$, and let $\Pi$ be a permutation matrix of size $n$. In this paper, we are interested in the mixing time of the Markov chain whose transition matrix is given by $Q=P\Pi$. In other words, the chain…

In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the…

An infinite system of point particles placed in $\mathds{R}^d$ is studied. Its constituents perform random jumps with mutual repulsion described by a translation-invariant jump kernel and interaction potential, respectively. The pure states…

In this paper, we consider a sequence of selfadjoint matrices $A_n$ having a limiting spectral distribution as $n\to \infty$, and we consider a sequence of full flags $\{0\le p_1^n\le\ldots\le p_i^n\le\ldots\le 1_n\}$ chosen at random…

This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in…

We study the asymptotic behavior of Markov operators $P_\mu$ defined by convolution with a probability measure $\mu$ on the unit circle $\mathbb T$. We prove that when $\mu$ is adapted, $P_\mu$ satisfies Doeblin's condition if and only if…

Let $G$ be a graph with adjacency matrix $A(G)$, and let $D(G)$ be the diagonal matrix of the degrees of $G$. For any real $\alpha\in[0,1]$, write $A_\alpha(G)$ for the matrix $$A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G).$$ This paper presents…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right] $, write $A_{\alpha}\left( G\right) $ for the matrix \[ A_{\alpha}\left( G\right)…

Let $(E,\mathcal F,\mu)$ be a probability space, and let $P$ be a Markov operator on $L^2(\mu)$ with $1$ a simple eigenvalue such that $\mu P=\mu$ (i.e. $\mu$ is an invariant probability measure of $P$). Then $\hat P:=\ff 1 2 (P+P^*)$ has a…

Let $\sigma_{K}: \sum_{K}\rightarrow \sum_{K}$ be a shift map. For an interval $[p,q]\subset[0,1]$, let $D_{\sigma_{K}}([p,q])$ denote the set of pairs for which the density spectrum of the $\epsilon$-approach time set equals $[p,q]$ when…

Let D be a strongly connected digraph and A(D) be the adjacency matrix of D. Let diag(D) be the diagonal matrix with outdegrees of the vertices of D and Q(D) = diag(D) + A(D) be the signless Laplacian matrix of D. The spectral radius of…

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

This paper proposes lower bounds on a quantity called $L^p$-norm joint spectral radius, or in short, $p$-radius, of a finite set of matrices. Despite its wide range of applications to, for example, stability analysis of switched linear…

We consider a diffusing particle, with diffusion constant D', moving in one dimension in an infinite sea of noninteracting mobile traps with diffusion constant D and density rho. We show that the asymptotic behavior of the survival…

A $n\times n$ matrix $A$, which has a certain sign-symmetric structure ($J$--sign-symmetric), is studied in this paper. It is shown that such a matrix is similar to a nonnegative matrix. The existence of the second in modulus positive…

The spectral radius {\rho}(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on {\rho}(G) that are often tighter and are applicable to a larger class of digraphs than previously reported…

This paper focuses on time-varying delayed stochastic differential systems with stochastically switching parameters formulated by a unified switching behavior combining a discrete adapted process and a Cox process. Unlike prior studies…

In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the…