• Deutsch
Login

  • Home
  • Search
  • Browse
  • Publish
  • FAQ
  • MSC-Classification

68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)

  • 68-00 General reference works (handbooks, dictionaries, bibliograohies, etc) subscribe to RSS feed
  • 68-01 Instructional exposition (textbooks, tutorial papers, etc.) (2) subscribe to RSS feed
  • 68-02 Research exposition (monographs, survey articles) subscribe to RSS feed
  • 68-03 Historical (must also be assigned at least one classification number from Section 01) subscribe to RSS feed
  • 68-04 Explicit machine computation and programs (not the theory of computation or programming) (2) subscribe to RSS feed
  • 68-06 Proceedings, conferences, collections, etc. (2) subscribe to RSS feed
  • 68Mxx Computer system organization (29) subscribe to RSS feed
  • 68Nxx Software (4) subscribe to RSS feed
  • 68Pxx Theory of data (7) subscribe to RSS feed
  • 68Qxx Theory of computing (19) subscribe to RSS feed
  • 68Rxx Discrete mathematics in relation to computer science (18) subscribe to RSS feed
  • 68Txx Artificial intelligence (8) subscribe to RSS feed
  • 68Uxx Computing methodologies and applications (17) subscribe to RSS feed
  • 68Wxx Algorithms (For numerical algorithms, see 65-XX; for combinatorics and graph theory, see 05C85, 68Rxx) (14) subscribe to RSS feed

Refine

Author

  • Nielsen, Adam (2)
  • Weber, Marcus (2)

Year of publication

  • 2015 (1)
  • 2014 (1)

Document Type

  • Article (1)
  • ZIB-Report (1)

Has Fulltext

  • no (1)
  • yes (1)

Keywords

  • MSM (2) (remove)

Institute

  • Computational Molecular Design (2)
  • Numerical Mathematics (2)

2 search hits

  • 1 to 2
  • BibTeX
  • CSV
  • RIS
  • XML
  • 10
  • 20
  • 50
  • 100

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
Computing the nearest reversible Markov chain (2015)
Nielsen, Adam ; Weber, Marcus
Reversible Markov chains are the basis of many applications. However, computing transition probabilities by a finite sampling of a Markov chain can lead to truncation errors. Even if the original Markov chain is reversible, the approximated Markov chain might be non-reversible and will lose important properties, like the real valued spectrum. In this paper, we show how to find the closest reversible Markov chain to a given transition matrix. It turns out that this matrix can be computed by solving a convex minimization problem.
Computing the nearest reversible Markov chain (2014)
Nielsen, Adam ; Weber, Marcus
Reversible Markov chains are the basis of many applications. However, computing transition probabilities by a finite sampling of a Markov chain can lead to truncation errors. Even if the original Markov chain is reversible, the approximated Markov chain might be non-reversible and will lose important properties, like the real valued spectrum. In this paper, we show how to find the closest reversible Markov chain to a given transition matrix. It turns out that this matrix can be computed by solving a convex minimization problem.
  • 1 to 2

OPUS4 Logo

  • Contact
  • Impressum und Datenschutz
  • Sitelinks