Results 61 to 70 of about 3,741,395 (255)
Introduction to the numerical solution of Markov Chains
, 1994 * Markov Chains * Direct Methods * Iterative Methods * Projection Methods * Block Hessenberg Matrices * Decompositional Methods * LI-Cyclic Markov Chains * Transient Solutions * Stochastic Automata Networks ...
W. Stewart
semanticscholar +1 more source
Simulated annealing for tensor network states
New Journal of Physics, 2014 Markov chains for probability distributions related to matrix product states and one-dimensional Hamiltonians are introduced. With appropriate ‘inverse temperature’ schedules, these chains can be combined into a simulated annealing scheme for ground ...
S Iblisdir
doaj +1 more source
On a New Characterization of Harris Recurrence for Markov Chains and Processes
Mathematics, 2023 This paper shows that Harris recurrent Markov chains and processes can be characterized as the class of Markov chains and processes for which there exists a random time T at which the distribution of the chain or process does not depend on its initial ...
Peter Glynn, Yanlin Qu
doaj +1 more source
Information and Control, 1976 We investigate the possibility of synthesizing stable probability distribution generators on the basis of a complete system of deterministic elements and generators of random signals described by nonhomogeneous Markov chains. It is shown that such generators can be obtained by constructing some finite Moore automata with special transition functions ...
openaire +3 more sources
CoRR, 2014 The formal verification of large probabilistic models is important and challenging. Exploiting the concurrency that is often present is one way to address this problem. Here we study a restricted class of asynchronous distributed probabilistic systems in which the synchronizations determine the probability distribution for the next moves of the ...
Sumit Kumar Jha 0001 +3 more
openaire +3 more sources
Segregating Markov Chains [PDF]
Journal of Theoretical Probability, 2017 Dealing with finite Markov chains in discrete time, the focus often lies on convergence behavior and one tries to make different copies of the chain meet as fast as possible and then stick together. There is, however, a very peculiar kind of discrete finite Markov chain, for which two copies started in different states can be coupled to meet almost ...
Timo Hirscher, Anders Martinsson
openaire +2 more sources
Recursive Markov Decision Processes and Recursive Stochastic Games [PDF]
, 2005 We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), and study the decidability and complexity of algorithms for their analysis and verification.
Mihalis Yannakakis +3 more
core +1 more source
Numerical Solution of Markov Chains
, 2011 This special issue contains a selection of papers from the Sixth International Workshop on the Numerical Solution of Markov Chains, held in Williamsburg, Virginia on September 16-17, 2010.
Benzi, Michele, Michele Benzi
core +1 more source
Bulletin of Geography. Socio-Economic SeriesSecond-tier cities are an important element in the socio-economic development of each country, including V4 countries. The result is a dynamic change in land use/cover patterns.
Marcin Feltynowski +2 more
doaj +1 more source
Subgeometric Ergodicity under Random-Time State-Dependent Drift Conditions
Journal of Probability and Statistics, 2014 Motivated by possible applications of Lyapunov techniques in the stability of stochastic networks, subgeometric ergodicity of Markov chains is investigated.
Mokaedi V. Lekgari
doaj +1 more source