Spatio-Temporal Complex Markov Chain (SCMC) Model Using Directed Graphs: Earthquake Sequencing
Bibliographic record
Abstract
We construct a directed graph to represent a Markov chain of global earthquake sequences and analyze the statistics of transition probabilities linked to earthquake zones. We use a simplified plate boundary template for earthquake zonation. We generalize this Markov chain of earthquake sequences by including the recurrent events in space and time for each event in the record-breaking sense. The record-breaking recurrent events provide the basis for redefining the weights for the state-to-state transition probabilities. We use a distance-dependent look-up array for each zone to assign the distance-dependent weights for the recurring events. We present here details of the method and the preliminary results on the structure and properties of the directed graphs corresponding to a Markov chain model without and with the inclusion of record-breaking events. The underlying directed graph provides the framework for earthquake sequencing. We examine the properties of the directed graph without and with the inclusion of recurrences. We consider the present method easily expandable for forecasting work as catalogues are routinely updated with seismic events and, also, widely applicable to a study of both the regional and global seismicity. We demonstrate the applicability of the directed graph approach to forecasting using some of the properties of graphs that represent the Markov chain.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".