scientific article; zbMATH DE number 1426485
From MaRDI portal
Publication:4950474
zbMATH Open0953.60063MaRDI QIDQ4950474FDOQ4950474
Authors: Ehrhard Behrends 
Publication date: 4 April 2000
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1789923
- scientific article; zbMATH DE number 18982
- Initiation aux Probabilités
- Markov chains. Theory and applications
- An Introduction to Markov Processes
- Algorithms and Computation
- Markov chains. Theory, algorithms and applications
- Introduction to Markov processes
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01)
Cited In (33)
- The random \((n-k)\)-cycle to transpositions walk on the symmetric group
- Rapid mixing and Markov bases
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Reaching consensus on rumors
- \(Q\)-learning in a stochastic Stackelberg game between an uninformed leader and a naive follower
- Pattern hit-and-run for sampling efficiently on polytopes
- Continuous-time Markov chains. An applications-oriented approach
- Consensus and fragmentation of opinions with a focus on bounded confidence
- Pattern discrete and mixed hit-and-run for global optimization
- Matrix relaxations in combinatorial optimization
- The expected hitting times for finite Markov chains
- Percolation on finite graphs and isoperimetric inequalities.
- A dynamic programming approach to efficient sampling from Boltzmann distributions
- Concentration inequalities for dependent random variables via the martingale method
- On the primitivity of Cayley digraphs
- Statistically optimal almost-invariant sets
- Limits for embedding distributions
- Finite Markov Chains and Algorithmic Applications
- On universal transfer learning
- An analysis of the superiorization method via the principle of concentration of measure
- Stochastic dynamics and Parrondo's paradox
- General Irreducible Markov Chains and Non-Negative Operators
- Convergence time to equilibrium distributions of autonomous and periodic non-autonomous graphs
- Some results about randomized binary Markov chains: theory, computing and applications
- A new criterion and method for amino acid classification
- Random walks generated by the Ewens distribution on the symmetric group
- Title not available (Why is that?)
- Topics in Markov chains: mixing and escape rate
- Graph clustering
- ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS
- Initiation aux Probabilités
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Correlated biased random walk with latency in one and two dimensions: asserting patterned and unpredictable movement
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950474)
