Finite Markov Chains and Algorithmic Applications

DOI10.1017/CBO9780511613586zbMATH Open0999.60001OpenAlexW1589640982MaRDI QIDQ4534877FDOQ4534877

Authors: Olle Häggström 

Publication date: 12 June 2002

Full work available at URL: https://doi.org/10.1017/cbo9780511613586

Recommendations

• Markov Chains
• scientific article; zbMATH DE number 1426485
• Markov chains. Gibbs fields, Monte Carlo simulation and queues
• scientific article; zbMATH DE number 1885142
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.

zbMATH Keywords

Markov chain Monte Carlosimulated annealingIsing modeltraveling salesman problemperfect simulationPropp-Wilson algorithm\(q\)-coloring

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01)

Cited In (66)

• A survey of average contractive iterated function systems
• Sparse analytic hierarchy process: an experimental analysis
• Title not available (Why is that?)
• Mixing time of Markov chains for the 1-2 model
• Title not available (Why is that?)
• The complexity of reachability in parametric Markov decision processes
• Derivatives of the stochastic growth rate
• Fitting timeseries by continuous-time Markov chains: a quadratic programming approach
• Polynomial time perfect sampling algorithm for two-rowed contingency tables
• On the exact simulation of functionals of stationary Markov chains
• A Transition to Sharp Timing in Stochastic Leaky Integrate-and-Fire Neurons Driven by Frozen Noisy Input
• Fast and asymptotic steering to a steady state for networks flows
• A multi-cluster time aggregation approach for Markov chains
• Title not available (Why is that?)
• Mean first passage time of preferential random walks on complex networks with applications
• A combinatorial approach to jumping particles
• Equilibrium and non-equilibrium Ising models by means of PCA
• Interacting with an artificial partner: modeling the role of emotional aspects
• Network robustness and random processes
• On the equivalence between quantum and random walks on finite graphs
• Ising Model on the Torus and PCA Dynamics: Reversibility, Irreversibility, and Fast Tunneling
• The access time of random walks on trees with given partition
• Transition functions for evolutionary algorithms on continuous state-space
• Opinion formation in a heterogeneous population --- a new approach to the Hopfield model
• Optimal sterile insect release for area-wide integrated pest management in a density regulated pest population
• On universal transfer learning
• Bayesian analysis of population structure based on linked molecular information
• Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy
• Computing the throughput of probabilistic and replicated streaming applications
• Some remarks on replicated simulated annealing
• On expressiveness of the chain graph interpretations
• Parallel simulation of two-dimensional Ising models using probabilistic cellular automata
• Exact mixing times for random walks on trees
• Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
• An introduction to metastability through random walks
• Discrete-time classical and quantum Markovian evolutions: maximum entropy problems on path space
• A real-world Markov chain arising in recreational volleyball
• \(k\)-out-of-\(n\) systems: an exact formula for the stationary availability and multi-objective configuration design based on mathematical programming and TOPSIS
• Book review of: Olle Häggström, Finite Markov chains and algorithmic applications
• Partial sums of biased random multiplicative functions
• Realization of an ergodic Markov chain as a random walk subject to a synchronizing road coloring
• A combinatorial approach to jumping particles: The parallel TASEP
• An improved estimator of Shannon entropy with applications to systems with memory
• A unified framework for population-based metaheuristics
• Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes
• Provable unlinkability against traffic analysis with low message overhead
• Title not available (Why is that?)
• Disease spread in coupled populations: minimizing response strategies costs in discrete time models
• Covering problems for Markov chains
• Quantum annealing learning search for solving QUBO problems
• Title not available (Why is that?)
• On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model
• Title not available (Why is that?)
• ROW-CONTINUOUS FINITE MARKOV CHAINS : STRUCTURE AND ALGORITHMS
• Some conditional correlation inequalities for percolation and related processes
• Bayesian learning of Bayesian networks with informative priors
• Equi-energy sampling does not converge rapidly on the mean-field Potts model with three colors close to the critical temperature
• A non-recursive algorithm for classifying the states of a finite Markov chain
• Exit frequency matrices for finite Markov chains
• Probabilistic cellular automata modelling of intercellular interactions in airways: complex pattern formation in patients with chronic obstructive pulmonary disease
• Determination of cosmological parameters from cosmic microwave background anisotropies
• On Finding Large Sets of Rewards in Two-Player ETP–ESP Games
• Numerical methods for QBD matrix equations
• Energy complexity of regular languages
• Zigzags in combinatorial tetrahedral chains and the associated Markov chain
• The Blume-Emery-Griffiths model on the FAD point and on the AD line

This page was built for publication: Finite Markov Chains and Algorithmic Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534877)