Finite Markov Chains and Algorithmic Applications
From MaRDI portal
Publication:4534877
DOI10.1017/CBO9780511613586zbMath0999.60001OpenAlexW1589640982MaRDI QIDQ4534877
Publication date: 12 June 2002
Full work available at URL: https://doi.org/10.1017/cbo9780511613586
Markov chain Monte Carlosimulated annealingIsing modeltraveling salesman problemperfect simulationPropp-Wilson algorithm\(q\)-coloring
Computational methods in Markov chains (60J22) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) Numerical analysis or methods applied to Markov chains (65C40) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Related Items (54)
Network robustness and random processes ⋮ Derivatives of the stochastic growth rate ⋮ A survey of average contractive iterated function systems ⋮ Bayesian learning of Bayesian networks with informative priors ⋮ The access time of random walks on trees with given partition ⋮ Equi-energy sampling does not converge rapidly on the mean-field Potts model with three colors close to the critical temperature ⋮ Transition functions for evolutionary algorithms on continuous state-space ⋮ Ising Model on the Torus and PCA Dynamics: Reversibility, Irreversibility, and Fast Tunneling ⋮ Partial sums of biased random multiplicative functions ⋮ Exact mixing times for random walks on trees ⋮ Bayesian analysis of population structure based on linked molecular information ⋮ Some remarks on replicated simulated annealing ⋮ The complexity of reachability in parametric Markov decision processes ⋮ \(k\)-out-of-\(n\) systems: an exact formula for the stationary availability and multi-objective configuration design based on mathematical programming and TOPSIS ⋮ A real-world Markov chain arising in recreational volleyball ⋮ An improved estimator of Shannon entropy with applications to systems with memory ⋮ The Blume-Emery-Griffiths model on the FAD point and on the AD line ⋮ On expressiveness of the chain graph interpretations ⋮ On the equivalence between quantum and random walks on finite graphs ⋮ Probabilistic cellular automata modelling of intercellular interactions in airways: complex pattern formation in patients with chronic obstructive pulmonary disease ⋮ Energy complexity of regular languages ⋮ On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model ⋮ Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ Disease spread in coupled populations: minimizing response strategies costs in discrete time models ⋮ Equilibrium and non-equilibrium Ising models by means of PCA ⋮ A unified framework for population-based metaheuristics ⋮ A Transition to Sharp Timing in Stochastic Leaky Integrate-and-Fire Neurons Driven by Frozen Noisy Input ⋮ A multi-cluster time aggregation approach for Markov chains ⋮ Optimal sterile insect release for area-wide integrated pest management in a density regulated pest population ⋮ Computing the throughput of probabilistic and replicated streaming applications ⋮ On the exact simulation of functionals of stationary Markov chains ⋮ Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling ⋮ On Finding Large Sets of Rewards in Two-Player ETP–ESP Games ⋮ Mean first passage time of preferential random walks on complex networks with applications ⋮ Exit Frequency Matrices for Finite Markov Chains ⋮ A combinatorial approach to jumping particles ⋮ An introduction to metastability through random walks ⋮ A combinatorial approach to jumping particles: The parallel TASEP ⋮ Fitting timeseries by continuous-time Markov chains: a quadratic programming approach ⋮ Interacting with an artificial partner: modeling the role of emotional aspects ⋮ Opinion formation in a heterogeneous population --- a new approach to the Hopfield model ⋮ Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy ⋮ Provable unlinkability against traffic analysis with low message overhead ⋮ Parallel simulation of two-dimensional Ising models using probabilistic cellular automata ⋮ On universal transfer learning ⋮ Realization of an Ergodic Markov Chain as a Random Walk Subject to a Synchronizing Road Coloring ⋮ Sparse analytic hierarchy process: an experimental analysis ⋮ Determination of Cosmological Parameters from Cosmic Microwave Background Anisotropies ⋮ Mixing time of Markov chains for the 1-2 model ⋮ Polynomial time perfect sampling algorithm for two-rowed contingency tables ⋮ Some conditional correlation inequalities for percolation and related processes ⋮ Discrete-time classical and quantum Markovian evolutions: Maximum entropy problems on path space ⋮ Quantum annealing learning search for solving QUBO problems ⋮ Fast and asymptotic steering to a steady state for networks flows
This page was built for publication: Finite Markov Chains and Algorithmic Applications
