scientific article; zbMATH DE number 1426485
From MaRDI portal
Publication:4950474
zbMath0953.60063MaRDI QIDQ4950474
Publication date: 4 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items
Correlated biased random walk with latency in one and two dimensions: asserting patterned and unpredictable movement ⋮ Percolation on finite graphs and isoperimetric inequalities. ⋮ Matrix Relaxations in Combinatorial Optimization ⋮ ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS ⋮ On the primitivity of Cayley digraphs ⋮ A new criterion and method for amino acid classification ⋮ Random walks generated by the Ewens distribution on the symmetric group ⋮ Convergence time to equilibrium distributions of autonomous and periodic non-autonomous graphs ⋮ Pattern hit-and-run for sampling efficiently on polytopes ⋮ Pattern discrete and mixed hit-and-run for global optimization ⋮ Graph clustering ⋮ $Q$-Learning in a Stochastic Stackelberg Game between an Uninformed Leader and a Naive Follower ⋮ The expected hitting times for finite Markov chains ⋮ Stochastic dynamics and Parrondo's paradox ⋮ Statistically optimal almost-invariant sets ⋮ Limits for embedding distributions ⋮ Reaching consensus on rumors ⋮ Consensus and Fragmentation of Opinions with a Focus on Bounded Confidence ⋮ An analysis of the superiorization method via the principle of concentration of measure ⋮ A dynamic programming approach to efficient sampling from Boltzmann distributions ⋮ Concentration inequalities for dependent random variables via the martingale method ⋮ On universal transfer learning ⋮ The random \((n-k)\)-cycle to transpositions walk on the symmetric group ⋮ Some results about randomized binary Markov chains: theory, computing and applications
