{"paper_id":"2609.36631","title":"A Spread-Gated Hawkes-Flocking Model for Best Bid and Ask Dynamics, with an Application to Limit Order Placement","authors":["Hyoeun Lee","Kiseop Lee"],"paper_date":"2026-09-29","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2609.36631","page_url":"https://thequant.space/flowcharts/a-spread-gated-hawkes-flocking-model-for-best-bid-and-ask-dynamics-with-an/","scores":{"empirical_rigor":7,"math_complexity":8,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a spread‑gated Hawkes‑flocking model for the joint dynamics of best bid and ask prices and derives a closed‑form optimal limit order size.","quote":"we derive the closed‑form optimal size of a single‑period limit order placed at the best or second‑best quote","summary":"We study the joint dynamics of the best bid and ask prices with a spread-gated Hawkes-flocking model. The model tracks four types of best-quote movements: spread-narrowing movements are switched off when the spread is at its one-tick minimum, and a cross-side excitation term, whose activation…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Self‑ and cross‑excitation kernels Φ(t) and flocking kernels Ψ(t) are entry‑wise non‑negative.","type":"model","stated":"explicit","quote":"(A2) Φ(t) ≥0 and Ψ(t) ≥0 entrywise, for all t ≥0"},{"assumption":"Best ask and bid move in single‑tick increments.","type":"market","stated":"explicit","quote":"Assuming that prices move in multiples of a fixed tick size δ, the best ask and best bid prices can be represented as"},{"assumption":"The spread is at its one‑tick minimum for the majority of the time (≈99%).","type":"data","stated":"explicit","quote":"the spread sits at one tick more than 99% of the time"}]},"datasets":{"status":"available","items":[{"name":"LOBSTER level‑5 limit order book data","provider":"LOBSTER","kind":"order-book","access":"public","period":"2012‑06‑21 (single trading day)","universe":"INTC and MSFT","quote":"We use LOBSTER level‑5 limit order book data [15] for a single trading day (2012‑06‑21)","known_id":"lobster"}],"known":[{"id":"lobster","name":"LOBSTER","provider":"LOBSTER","kind":"order-book","access":"commercial","quote":"We use LOBSTER level-5 limit order book data [15] for a single trading day (2012-06-21).","mentions":3,"used_in":1}],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"l2-book"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R1","candidates":{"front_matter":"n/a","evidence_card":"no","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"The spread‑gated Hawkes‑flocking process is non‑explosive on any finite horizon.","kind":"theoretical","quote":"We show that the process is non‑explosive on every finite horizon"},{"finding":"An O(N) recursive maximum‑likelihood estimator is derived and validated by simulation.","kind":"theoretical","quote":"give an O(N) recursive likelihood, and validate the maximum likelihood estimator by simulation"},{"finding":"The full model with the cross‑side flocking term fits the data substantially better; the null model (Ψ≡0) is rejected.","kind":"statistical","quote":"the restriction that removes the cross‑side term is rejected, and the full model improves fit substantially by AIC and BIC"},{"finding":"The likelihood surface is multimodal on a single day, requiring a multi‑start search for estimation.","kind":"statistical","quote":"The likelihood is multimodal on a single day, so a multi‑start search is needed"},{"finding":"A closed‑form optimal size for a single‑period limit order at the best or second‑best quote is derived.","kind":"theoretical","quote":"we derive the closed‑form optimal size of a single‑period limit order placed at the best or second‑best quote"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":30,"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-14T17:04:15Z"},"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/"}