{"paper_id":"2601.01871","title":"On lead-lag estimation of non-synchronously observed point processes","authors":["Takaaki Shiotani","Takaki Hayashi","Yuta Koike"],"paper_date":"2026-01-05","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2601.01871v1","page_url":"https://thequant.space/flowcharts/on-lead-lag-estimation-of-non-synchronously-observed-point-p/","scores":{"empirical_rigor":7,"math_complexity":9.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a nonparametric, kernel-based estimator of lead‑lag time with a data‑driven Lepski bandwidth selection procedure.","quote":"we propose a nonparametric, kernel-based estimator of the lead–lag time, together with a data-driven bandwidth selection procedure.","summary":"This paper introduces a new theoretical framework for analyzing lead-lag relationships between point processes, with a special focus on applications to high-frequency financial data. In particular, we are interested in lead-lag relationships between two sequences of order arrival timestamps. The…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The true lead‑lag time lies within a known bounded interval (‑r, r).","type":"model","stated":"explicit","quote":"we assume the true lead‑lag time lies within the interval (‑r, r) for some known positive constant r"},{"assumption":"The underlying bivariate point process is stationary.","type":"statistical","stated":"explicit","quote":"we have established a theoretical foundation for timestamp‑based lead‑lag analysis from a point process perspective"},{"assumption":"Gamma kernels decay geometrically, providing a bound on the strong mixing rate.","type":"statistical","stated":"explicit","quote":"We also have a bound on the strong mixing rate [A1](ii) from Theorem 3.1 in [11], since the gamma kernels decay geometrically."},{"assumption":"Data‑generating processes are lagged bivariate Hawkes or Neyman‑Scott processes with gamma kernels.","type":"model","stated":"explicit","quote":"In our experiments, we employ “lagged” variants of these models as the data‑generating processes."},{"assumption":"Observation window length T is known and used for bandwidth selection (AT = log log T).","type":"other","stated":"explicit","quote":"For the Lepski method, we set AT = log log T."}]},"datasets":{"status":"available","items":[{"name":"Daily TAQ dataset","provider":"Consolidated Tape (CTA/UTP)","kind":"market-prices","access":"public","period":"August 6, 2015 – August 31, 2015 (18 tra","universe":"NASDAQ‑100 component stocks (108 stocks)","quote":"We obtain the timestamps of updates of the best quotes on each exchange in August 2015 from the Daily TAQ dataset, which provides every quote reported to the consolidated tape by all Consolidated Trade Association (CTA) and Unlisted Trading Privileges (UTP) participants.","known_id":"taq"},{"name":"Simulated lagged bivariate Hawkes processes","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"In our experiments, we employ “lagged” variants of these models as the data‑generating processes."},{"name":"Simulated lagged bivariate Neyman‑Scott processes","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"In this simulation study, we adopt gamma dispersal kernels as in the NBNSP‑G model of Shiotani and Yoshida [65]."}],"known":[{"id":"taq","name":"NYSE TAQ","provider":"NYSE","kind":"market-prices","access":"commercial","quote":"We obtain the timestamps of updates of the best quotes on each exchange in August 2015 from the Daily TAQ dataset, which provides every quote reported to the consolidated tape by all Consolidated Trade Association (CTA) and Unlisted Trading Privileges (UTP) participants.","mentions":2,"used_in":1}],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"tick"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"The kernel estimator with Lepski bandwidth selection achieves lower RMSE than the Dobrev‑Schaumburg estimator for almost all combinations of observation window length and data‑generating process.","kind":"performance","quote":"Second, the kernel estimator with Lepski’s bandwidth selection achieves lower RMSE than the DS estimator for almost all combinations of T and data‑generating process."},{"finding":"The DS estimator’s performance is highly sensitive to the bucket width h, showing a U‑shaped RMSE curve across h values.","kind":"statistical","quote":"First, the performance of the DS estimator is sensitive to the bucket width h. For each T, the RMSE curves as a function of h are typically U‑shaped."},{"finding":"The proposed kernel estimator nearly attains the optimal convergence rate for estimating lead‑lag time when the bandwidth is chosen appropriately.","kind":"theoretical","quote":"Theoretically, our estimator nearly attains the optimal convergence rate for estimating the lead‑lag time, provided that the bandwidth of the kernel estimator is chosen appropriately."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":11,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T16:39:01Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}