{"paper":{"title":"Edge-indexed network time series with graph Ornstein-Uhlenbeck dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series.","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Almut E. D. Veraart, Jiaming Chen","submitted_at":"2026-05-15T12:45:15Z","abstract_excerpt":"We introduce a class of L\\'evy-driven graph Ornstein-Uhlenbeck (grOU) models for edge-indexed network time series. The proposed framework extends generalized network autoregressive (GNAR) processes for edge-indexed network time series to continuous time and adapts graph Ornstein-Uhlenbeck dynamics, originally developed for node-indexed processes, to the edge-indexed setting. The model accommodates general L\\'evy noise and therefore captures both Brownian and jump behavior. We show that the model parameters can be estimated via a maximum-likelihood framework and derive the asymptotic properties"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The results indicate that grOU models for edge-indexed network time series improve forecasting accuracy and reduce computational time relative to standard benchmarks while maintaining robustness through their network-based parametrization.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the adaptation of graph Ornstein-Uhlenbeck dynamics from node-indexed to edge-indexed processes preserves the key statistical properties (such as stationarity and estimability) needed for the maximum-likelihood framework and asymptotic results to apply, as stated in the abstract's description of the extension.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proposes Lévy-driven grOU models for edge-indexed network time series, extending GNAR processes to continuous time with MLE estimation, asymptotic results, simulations, and financial data application showing improved forecasting.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8cf09d44a969680d02bff59b42123fc85c6e86e2170070aec1376354ccedb0a5"},"source":{"id":"2605.15907","kind":"arxiv","version":1},"verdict":{"id":"408a9e5f-c12a-4196-a77a-9e53a91a0c7f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:11:06.944175Z","strongest_claim":"The results indicate that grOU models for edge-indexed network time series improve forecasting accuracy and reduce computational time relative to standard benchmarks while maintaining robustness through their network-based parametrization.","one_line_summary":"Proposes Lévy-driven grOU models for edge-indexed network time series, extending GNAR processes to continuous time with MLE estimation, asymptotic results, simulations, and financial data application showing improved forecasting.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the adaptation of graph Ornstein-Uhlenbeck dynamics from node-indexed to edge-indexed processes preserves the key statistical properties (such as stationarity and estimability) needed for the maximum-likelihood framework and asymptotic results to apply, as stated in the abstract's description of the extension.","pith_extraction_headline":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15907/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.061360Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:21:19.883505Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:46.560790Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.766457Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"58cdffc3fa422cfba75d2884b17e48edb00fe994d53b9d43aa644303a101830e"},"references":{"count":15,"sample":[{"doi":"","year":2001,"title":"Barndorff-Nielsen, O. E. & Shephard, N. (2001), ‘Non-Gaussian Or nstein–Uhlenbeck-based models and some of their uses in financial economics’, Journal of the Royal Statistical Society: Series B (Statist","work_id":"701fd12c-4ceb-44f0-b15b-481ba4147598","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Christensen, K., Kinnebrock, S. & Podolskij, M. (2010), ‘Pre-aver aging estimators of the ex-post covariance matrix in noisy diffusion models with non-synchro nous data’, Journal of econometrics 159(1)","work_id":"440249ed-c50b-4a44-b1b2-325f434e89a1","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Courgeau, V. & Veraart, A. E. (2022 a), ‘High-frequency estimation of the L´ evy-driven graph Ornstein-Uhlenbeck process’, Electronic Journal of Statistics 16(2), 4863–4925","work_id":"b693fecf-7ba1-4d46-9328-01481f1b0793","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Courgeau, V. & Veraart, A. E. (2022 b), ‘Likelihood theory for the graph Ornstein-Uhlenbeck process’, Statistical Inference for Stochastic Processes 25(2), 227–260","work_id":"63f0a12b-dc08-4d20-9b0d-a50a94b01491","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1979,"title":"Epps, T. W. (1979), ‘Comovements in stock prices in the very short run’, Journal of the American Statistical Association 74(366a), 291–298. iti Sato, K. & Yamazato, M. (1984), ‘Operator-selfdecomposab","work_id":"8624d795-760e-4580-a822-ae85478fc6b6","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"fc2b8ed6c78a68afad334adfc15587e5e653573c82f05fcd6561d05c59e06354","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"68413a29ad55701597a0a1c7d8bf97298e4050d766d639fb593b3c9d3685e3ee"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}