The Reconstructability of Markov Chains
The Annals of Probability, 1976 As an extension of the work of Denzel, Kemeny, and Snell on the excessive functions of a continuous time Markov chain, this paper introduces the concept of reconstructability in two forms. First, there is reconstructability from the class of excessive functions, where it is seen that the transition matrix for a transient chain with a finite atomic exit
openaire +3 more sources
Jarzyski's Equality and Crooks' Fluctuation Theorem for General Markov Chains with Application to Decision-Making Systems. [PDF]
Entropy (Basel), 2022 Hack P, Gottwald S, Braun DA.
europepmc +1 more source
Markov Chains and the Cut-Off phenomenon
reservedQuesta tesi esamina le catene di Markov, illustrandone le caratteristiche e le proprietà fondamentali. Successivamente, descrive alcuni esempi di tecniche probabilistiche, spettrali, geometriche e variazionali per la stima del tempo di ...
GALLO, MARCO
core
Parallel hierarchical sampling : a general-purpose class of multiple-chains MCMC algorithms [PDF]
, 2009 This paper introduces the Parallel Hierarchical Sampler (PHS), a class of Markov chain Monte Carlo algorithms using several interacting chains having the same target distribution but different mixing properties. Unlike any single-chain MCMC algorithm,
Mira, Antonietta +3 more
core
Optimal distribution of vehicular traffic flow with Dijkstra’s algorithm and Markov chains
African Scientific ReportsThe optimization of traffic distribution is a critical problem in transportation networks, where efficient routing can reduce congestion, minimize travel time, and improve overall traffic flow.
L. I. Igbinosun, N. R. Udoenoh
doaj +1 more source
Low-rank tensor methods for Markov chains with applications to tumor progression models. [PDF]
J Math Biol, 2022 Georg P +5 more
europepmc +1 more source
NECESSARY AND SUFFICIENT CONDITIONS FORSTABILITY OF FINITE STATE MARKOV CHAINS [PDF]
This note considers finite state Markov chains which overlap supports. While the overlapping supports condition is known to be necessary and sufficient for stability of these chains, the result is typically presented in a more general context.
John Stachurski
core
Optimizing intra-facility crowding in Wi-Fi environments using continuous-time Markov chains [PDF]
Discov Internet Things, 2022 Mizuno S, Ohba H.
europepmc +2 more sources
A modified algorithm of 'forward-backward' solving the identification of automata Markov models
Учёные записки Казанского университета: Серия Физико-математические науки, 2018 The paper is devoted to solving the problem of identifying discrete stochastic processes generated on the basis of automata Markov models. This problem is relevant because of the need to increase the efficiency of automata Markov models recognition.
A.R. Nurutdinova
doaj
Parallel hierarchical sampling:a general-purpose class of multiple-chains MCMC algorithms [PDF]
This paper introduces the Parallel Hierarchical Sampler (PHS), a class of Markov chain Monte Carlo algorithms using several interacting chains having the same target distribution but different mixing properties.
Antonietta Mira, Fabio Rigat
core