Finite Markov Chains and Algorithmic Applications
From MaRDI portal
(Redirected from Publication:4534877)
Markov chain Monte Carlosimulated annealingIsing modeltraveling salesman problemperfect simulationPropp-Wilson algorithm\(q\)-coloring
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)
Recommendations
Cited in
(71)- Equi-energy sampling does not converge rapidly on the mean-field Potts model with three colors close to the critical temperature
- Exit frequency matrices for finite Markov chains
- A survey of average contractive iterated function systems
- Sparse analytic hierarchy process: an experimental analysis
- scientific article; zbMATH DE number 1069282 (Why is no real title available?)
- Mixing time of Markov chains for the 1-2 model
- scientific article; zbMATH DE number 822898 (Why is no real title available?)
- The complexity of reachability in parametric Markov decision processes
- Finite Markov chains and multiple orthogonal polynomials
- Derivatives of the stochastic growth rate
- Fitting timeseries by continuous-time Markov chains: a quadratic programming approach
- On the exact simulation of functionals of stationary Markov chains
- Fast and asymptotic steering to a steady state for networks flows
- Polynomial time perfect sampling algorithm for two-rowed contingency tables
- 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
- scientific article; zbMATH DE number 5541569 (Why is no real title available?)
- Time and knowability in evolutionary processes
- A combinatorial approach to jumping particles
- Mean first passage time of preferential random walks on complex networks with applications
- 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
- Probabilistic cellular automata modelling of intercellular interactions in airways: complex pattern formation in patients with chronic obstructive pulmonary disease
- 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
- Determination of cosmological parameters from cosmic microwave background anisotropies
- Optimal sterile insect release for area-wide integrated pest management in a density regulated pest population
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
- On universal transfer learning
- Bayesian analysis of population structure based on linked molecular information
- On Bertino copulas and the Markov product
- Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy
- Computing the throughput of probabilistic and replicated streaming applications
- Numerical methods for QBD matrix equations
- On expressiveness of the chain graph interpretations
- Some remarks on replicated simulated annealing
- Exact mixing times for random walks on trees
- Parallel simulation of two-dimensional Ising models using probabilistic cellular automata
- An introduction to metastability through random walks
- Energy complexity of regular languages
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
- A real-world Markov chain arising in recreational volleyball
- Discrete-time classical and quantum Markovian evolutions: maximum entropy problems on path space
- Zigzags in combinatorial tetrahedral chains and the associated Markov chain
- \(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
- Computational complexity of counting and sampling
- The Blume-Emery-Griffiths model on the FAD point and on the AD line
- Realization of an ergodic Markov chain as a random walk subject to a synchronizing road coloring
- A unified framework for population-based metaheuristics
- An improved estimator of Shannon entropy with applications to systems with memory
- A modified fixed-point iteration method for a class of polynomial matrix equations
- A combinatorial approach to jumping particles: The parallel TASEP
- Provable unlinkability against traffic analysis with low message overhead
- Disease spread in coupled populations: minimizing response strategies costs in discrete time models
- scientific article; zbMATH DE number 3994676 (Why is no real title available?)
- Covering problems for Markov chains
- Quantum annealing learning search for solving QUBO problems
- On finding large sets of rewards in two-player ETP-ESP games
- On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model
- Ising model on the torus and PCA dynamics: reversibility, irreversibility, and fast tunneling
- scientific article; zbMATH DE number 510828 (Why is no real title available?)
- scientific article; zbMATH DE number 3995885 (Why is no real title available?)
- Some conditional correlation inequalities for percolation and related processes
- ROW-CONTINUOUS FINITE MARKOV CHAINS : STRUCTURE AND ALGORITHMS
- Bayesian learning of Bayesian networks with informative priors
- A non-recursive algorithm for classifying the states of a finite Markov chain
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)
