Improved estimates of survival probabilities via isospectral transformations
From MaRDI portal
Publication:5259674
DOI10.1007/978-1-4939-0419-8_7zbMATH Open1315.37027arXiv1211.4617OpenAlexW2241696460MaRDI QIDQ5259674FDOQ5259674
Leonid A. Bunimovich, B. Z. Webb
Publication date: 29 June 2015
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Abstract: We consider open systems generated from one-dimensional maps that admit a finite Markov partition and use the recently developed theory of isospectral graph transformations to estimate a system's survival probabilities. We show that these estimates are better than those obtained through a more direct approach.
Full work available at URL: https://arxiv.org/abs/1211.4617
Recommendations
Dynamical systems involving maps of the interval (37E05) Dynamical systems involving maps of trees and graphs (37E25)
Cited In (6)
- Generalized eigenvectors of isospectral transformations, spectral equivalence and reconstruction of original networks
- Escape-rate response to noise of all amplitudes in leaky chaos
- Characterizing cospectral vertices via isospectral reduction
- Eigenvectors of isospectral graph transformations
- Leading eigenvalues of adjacency matrices of star-like graphs with fixed numbers of vertices and edges
- Isospectral reductions and quantum walks on graphs
This page was built for publication: Improved estimates of survival probabilities via isospectral transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259674)