Võrdle meetodeid
Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.
| Agent-põhine modelleerimine (ABM)× | Markov Chain Monte Carlo (MCMC)× | |
|---|---|---|
| Valdkond | Simulatsioon | Simulatsioon |
| Perekond | Process / pipeline | Process / pipeline |
| Tekkeaasta≠ | 1970s–1990s (formalized as a field) | 1953 (Metropolis-Hastings); 1984 (Gibbs) |
| Looja≠ | Thomas Schelling and Robert Axelrod (foundational contributions, 1970s–1990s) | Metropolis et al. (1953); Gibbs sampler formalised by Geman & Geman (1984) |
| Tüüp≠ | Computational simulation method | Simulation-based Bayesian inference / numerical integration |
| Algallikas≠ | Axelrod, R. (1997). The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration. Princeton University Press. DOI ↗ | Gelman, A., Carlin, J.B., Stern, H.S., Dunson, D.B., Vehtari, A. & Rubin, D.B. (2013). Bayesian Data Analysis (3rd ed.). Chapman & Hall/CRC. DOI ↗ |
| Rööpnimetused | ABM, Ajan Tabanlı Modelleme (ABM), multi-agent simulation, individual-based modeling | MCMC, Metropolis-Hastings, Gibbs sampling, Markov Zinciri Monte Carlo (MCMC — Metropolis-Hastings, Gibbs) |
| Seotud | 5 | 5 |
| Kokkuvõte≠ | Agent-based modeling (ABM) is a computational simulation method, formalized through the work of Thomas Schelling and Robert Axelrod in the 1970s–1990s, that simulates the behavior of complex systems by specifying and running autonomous agents — individuals, firms, cells, or any bounded entity — whose local interactions with each other and with their environment collectively produce global, system-level patterns that could not be predicted from any single agent's rules alone. | Markov Chain Monte Carlo (MCMC) is a family of simulation algorithms that constructs a Markov chain whose stationary distribution is the target posterior, enabling Bayesian inference and high-dimensional integral computation that would otherwise be analytically intractable. Pioneered by Metropolis and colleagues in 1953 and extended by Hastings in 1970, MCMC underpins modern Bayesian statistics. The two most widely used variants are Metropolis-Hastings, which proposes moves from a general proposal distribution, and Gibbs sampling, which draws each parameter in turn from its full conditional distribution. |
| ScholarGateAndmestik ↗ |
|
|