Search arXivSearch

arXiv · 2502.16246

The "double" square-root law: Evidence for the mechanical origin of market impact using Tokyo Stock Exchange data

Abstract

Understanding the impact of trades on prices is a crucial question for both academic research and industry practice. It is well established that impact follows a square-root impact as a function of traded volume. However, the microscopic origin of such a law remains elusive: empirical studies are particularly challenging due to the anonymity of orders in public data. Indeed, there is ongoing debate about whether price impact has a mechanical origin or whether it is primarily driven by information, as suggested by many economic theories. In this paper, we revisit this question using a very detailed dataset provided by the Japanese stock exchange, containing the trader IDs for all orders sent to the exchange between 2012 and 2018. Our central result is that such a law has in fact microscopic roots and applies already at the level of single child orders, provided one waits long enough for the market to "digest" them. The mesoscopic impact of metaorders arises from a "double" square-root effect: square-root in volume of individual impact, followed by an inverse square-root decay as a function of time. Since market orders are anonymous, we expect and indeed find that these results apply to any market orders, and the impact of synthetic metaorders, reconstructed by scrambling the identity of the issuers, is described by the very same square-root impact law. We conclude that price impact is essentially mechanical, at odds with theories that emphasize the information content of such trades to explain the square-root impact law.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guillaume Maitrier, Grégoire Loeper, Kiyoshi Kanazawa, Jean-Philippe Bouchaud. 2025-08-04. The "double" square-root law: Evidence for the mechanical origin of market impact using Tokyo Stock Exchange data. https://arxiv.org/abs/2502.16246

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Marginal Effects of Ethereum Network MEV Transaction Re-Ordering

Two MEV builders now produce nearly 80\% of Ethereum blocks. Block builders have the ability to reorder transactions on the blockchain in a way that can be harmful to participants. We estimate participants would pay in the aggregate nearly \$7.2 million per month to guarantee that they remained in the first quartile of the block. Sandwich attacks, in which a transaction is front run, are frequent, averaging more than one every two blocks. Gas fees on these transactions pay for nearly 9.6\% of the MEV payments to the validator. Reforms such as gas fee priority or private transaction pools might be helpful.

q-fin.TR

Computable Countermarkets and the Limits of Universal Trading

We explain why no trading algorithm can guarantee profit in every market. For each deterministic program that always returns a finite-precision position, we construct a fixed, algorithmically generated price path on which every active position loses and inactivity earns nothing. This holds with positive, continually changing prices, costless trading, and unlimited computation time. Separate arguments limit learning market rules, certifying future events, and establishing randomness from finite data. Useful strategies may exploit market structure, information, or compensation for risk, while benchmark performance need not imply profit. Reversing and rearranging price histories within the assumed market class provide practical stress tests, distinguishing conditional success from universal guarantees.

q-fin.TR

Adapting the Actor Model of Concurrency for High-Frequency Trading: Synchronous Message Delivery (fast_send) and a Tick-to-Book Latency Study

The actor model - state isolation, data-race freedom, deadlock resistance, and sequential single-message reasoning - has long been dismissed as unsuitable for high-frequency trading (HFT): actors seem to imply many threads, a mailbox per actor, and a heap-allocated message plus a context switch per interaction, overhead incompatible with a microsecond budget. This paper argues the dismissal is wrong for co-located actors, and supports it both analytically and with a deployed, measured implementation: kaspar-hft, an open-source C++20 framework. Four extensions adapt the model for HFT: fast_send, a synchronous delivery mechanism in which the sending thread runs the receiver's handler inline and returns the reply as a value; actor groups, which co-schedule actors on one thread behind a shared mailbox; per-actor selectable mailbox queues; and a memory pool. fast_send has receiver transparency: the handler cannot tell whether delivery was synchronous or asynchronous, or which thread runs it. A grouped synchronous chain runs on one thread, cutting scheduler context switches from O(N) to O(1), and a thread-local call-chain test catches cyclic invocation before any lock is taken. Microbenchmarks put the synchronous round trip at tens of nanoseconds. On a live CME market-data feed (ES, NQ, ZN futures), socket-to-book latency decomposes into a ~7 microsecond decode-and-book floor plus a per-message slope; the framework's own contribution is under 1% of the floor. The tail is set not by the actor machinery but by the market's non-Poisson, clustered arrival process, characterized in a companion paper. The shared-queue group also yields a production/simulation duality: the same actor code runs unchanged in live trading and deterministic backtest.

q-fin.TR