Related papers: Spectral computations for birth and death chains
We study the spectrum of a periodic non-self-adjoint Dirac operator, and its dependence on a semiclassical parameter is also considered. Several bounds on the spectrum are obtained which provide sharp spectral enclosure estimates.…
A model for the generation of fractal growth networks in Euclidean spaces of arbitrary dimension is presented. These networks are considered as the spatial support of reaction-diffusion and pattern formation processes. The local dynamics at…
We propose a general approach to the description of spectra of complex networks. For the spectra of networks with uncorrelated vertices (and a local tree-like structure), exact equations are derived. These equations are generalized to the…
The power spectrum analysis of spectral fluctuations in complex wave and quantum systems has emerged as a useful tool for studying their internal dynamics. In this paper, we formulate a nonperturbative theory of the power spectrum for…
Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…
We propose an iterative method to find pointwise growth exponential growth rates in linear problems posed on essentially one-dimensional domains. Such pointwise growth rates capture pointwise stability and instability in extended systems…
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the transition matrix. This is not possible in general, but at least…
There has been a recent surge of interest in what causes aging. This has been matched by unprecedented research investment in the field from tech companies. But, despite considerable effort from a broad range of researchers, we do not have…
The recently established spectral Favard theorem for bounded banded matrices admitting a positive bidiagonal factorization is applied to a broader class of Markov chains with bounded banded transition matrices, extending beyond the…
We present an algorithm for computing a spectral decomposition of an interval matrix as an enclosure of spectral decompositions of particular realizations of interval matrices. The algorithm relies on tight outer estimations of eigenvalues…
In a compact topological dynamical system $(X,f)$, we associate to every pair $(x,y)$ a canonical order-theoretic invariant, its emergent order spectrum $\Omega(x,y)$. We first prove that, if $x$ and $y$ are chain-related, one can always…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
We calculate the density and expectation for the number of lineages in a reconstructed tree with $n$ extant species. This is done with conditioning on the age of the tree as well as with assuming a uniform prior for the age of the tree.
Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…
We present a spectral analysis for matrix scaling and operator scaling. We prove that if the input matrix or operator has a spectral gap, then a natural gradient flow has linear convergence. This implies that a simple gradient descent…
We study Schr\"odinger operators on an infinite quantum graph of a chain form which consists of identical rings connected at the touching points by $\delta$-couplings with a parameter $\alpha\in\R$. If the graph is "straight", i.e. periodic…
A certified strategy for determining sharp intervals of enclosure for the eigenvalues of matrix differential operators with singular coefficients is examined. The strategy relies on computing the second order spectrum relative to subspaces…
We analyse growing networks ranging from collaboration graphs of scientists to the network of similarities defined among the various transcriptional profiles of living cells. For the explicit demonstration of the scale-free nature and…
Given two graphs, a backbone and a finger, a comb product is a new graph obtained by grafting a copy of the finger into each vertex of the backbone. We study the comb graphs in the case when both components are the paths of order $n$ and…
A new method to calculate the spectrum using cascaded open systems and master equations is presented. The method uses two state analyzer atoms which are coupled to the system of interest, whose spectrum of radiation is read from the…