Machine learning-based prediction of \(Q\)-voter model in complex networks
From MaRDI portal
Publication:6625298
DOI10.1088/1742-5468/AD06A6MaRDI QIDQ6625298
Colm Connaughton, Francisco A. Rodrigues, Paul R. C. Kent, Aruane M. Pineda
Publication date: 28 October 2024
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Time-dependent probability density function for general stochastic logistic population model with harvesting effort
- Mean-field analysis of the \(q\)-voter model on networks
- On over-fitting in model selection and subsequent selection bias in performance evaluation
- Sharp transition towards shared vocabularies in multi-agent systems
- Emergence of Scaling in Random Networks
- SURVIVING OPINIONS IN SZNAJD MODELS ON COMPLEX NETWORKS
- CONTINUOUS OPINION DYNAMICS UNDER BOUNDED CONFIDENCE: A SURVEY
- Modeling Complex Systems
- Networks
- Introduction to the Theory of Complex Systems
- Beitrag zur Theorie des Ferromagnetismus
- Collective dynamics of ‘small-world’ networks
- Networks
This page was built for publication: Machine learning-based prediction of \(Q\)-voter model in complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625298)