0 views collected around this technical thread.
By introducing time‑inhomogeneous Markov chains, this article shows how dynamic transition probabilities can model and predict evolving social behaviors such as online activity levels, illustrating the method with a three‑state user engagement example and visualizing future activity trends over a year.
This article explains how generative AI models work by demystifying tokens, tokenization with tools like tiktoken, simple Markov‑chain training, the limitations of small context windows, and how modern LLMs use neural networks, transformers and attention mechanisms to predict the next token.
This article introduces the Grey‑Markov hybrid model, explains its theoretical foundations, outlines step‑by‑step modeling procedures, and demonstrates its superior forecasting performance on a consumer price index (CPI) case study, achieving a significant reduction in prediction error.
This article explains how a Markov chain—a memoryless stochastic model—can be used to define, construct, and analyze a simple three‑state mental‑state transition matrix, demonstrating both short‑term predictions and long‑term steady‑state distributions with concrete probability examples.
This article introduces Markov chains as a mathematical model of state transitions, explains definitions, transition matrices, n‑step and steady‑state distributions, and demonstrates practical Python simulations for weather forecasting and simple keyboard word prediction.
Markov Chain Monte Carlo (MCMC) extends classic Monte Carlo by generating dependent samples via a Markov chain, enabling Bayesian inference through concepts like the plug‑in principle, burn‑in, asymptotic independence, and algorithms such as Metropolis‑Hastings and Gibbs sampling, while addressing convergence and effective sample size.
This article explains the fundamentals of Markov chains, illustrates their transition matrix with a market example, demonstrates convergence through Python code, and outlines how to use the stationary distribution for sampling in Monte Carlo simulations.
This article explains the detailed‑balance condition for Markov chains, shows why finding a transition matrix for a given stationary distribution is hard, and demonstrates how Metropolis‑Hastings modifies MCMC to achieve higher acceptance rates with a concrete Python example.
This article explains the basic definition of Markov chains, illustrates a stock‑market example with transition matrices, demonstrates convergence through Python simulations, and shows how the steady‑state distribution enables sampling for Monte Carlo methods.
This article models a piano retailer’s weekly demand as a Poisson process, applies a restocking policy that orders three units only when inventory hits zero, and uses a Markov chain to estimate a roughly 10% stockout probability and an average weekly sale of 0.857 units, while also exploring sensitivity to demand changes.
This article introduces Markov chains, explains their definition, transition matrices, examples, Kolmogorov theorem, limiting distributions, and absorbing chains, showing how memoryless stochastic processes model diverse real‑world phenomena.
This article explains how Google’s PageRank algorithm uses the web’s link structure, Markov processes, and stochastic matrix adjustments—including damping factor α—to overcome ranking challenges and provide a mathematically sound method for ordering search results.