RICH: Real-time Identification of negative Cycles for High-efficiency Arbitrage
Bingqiao Luo, Jiaxin Jiang, Yuhang Chen, Junyi Hou, Cheng Jun Tey, Ziyang Qiu, Bingsheng He, Spencer Xiao, Dominic Ong, Wee Howe Ang
Abstract
Arbitrage is a challenging data science problem characterized by rapidly fluctuating price discrepancies across multiple markets, necessitating real-time solutions. To overcome the challenge, we model it as a k -hop negative cycle detection problem in graphs and introduce RICH: Real-time Identification of negative Cycles for High-efficiency arbitrage. RICH is a novel framework that leverages color-coding and dynamic programming to accelerate the identification of negative-weight cycles without exhaustive graph traversal. Additionally, RICH incorporates encoding techniques and graph reduction to minimize computational overhead while maintaining probabilistic guarantees. Our extensive experiments on real-world datasets demonstrate that RICH is up to 32.69× faster than state-of-the-art methods, enabling timely arbitrage execution while outperforming existing methods in both speed and accuracy. We further validate its effectiveness in identifying arbitrage opportunities in cryptocurrency markets and foreign exchange markets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9d81fed0-0e9d-49e6-992c-8e375ffd4eb0Builds on7
- Quantifying Blockchain Extractable Value: How dark is the forest?Kaihua Qin, Liyi Zhou, Arthur GervaisS&P 2022 · 336 citations
- Spade: A Real-Time Fraud Detection Framework on Evolving GraphsJiaxin Jiang, Yuan Li, Bingsheng He, Bryan Hooi et al.VLDB 2023 · 31 citations
- PathEnum: Towards Real-Time Hop-Constrained s-t Path EnumerationShixuan Sun, Yuhang Chen, Bingsheng He, Bryan HooiSIGMOD 2021 · 28 citations
- Negative-Weight Single-Source Shortest Paths in Near-linear TimeAaron Bernstein, Danupon Nanongkai, Christian Wulff-NilsenFOCS 2022 · 24 citations
- Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!Karl Bringmann, Alejandro Cassis, Nick FischerFOCS 2023 · 7 citations
Related papers
- TRADER: Real-time Arbitrage Detection via Negative Cycles on Dynamic GraphsBingqiao Luo, Yuhang Chen, Jiaxin Jiang, Yuheng Cong et al.ICDE 2026
- RUSH: Real-time Burst Subgraph Discovery in Dynamic GraphsYuhang Chen, Jiaxin Jiang, Shixuan Sun, Bingsheng He et al.VLDB 2024 · 9 citations
- A Large Scale Study of the Ethereum Arbitrage EcosystemRobert McLaughlin, Christopher Kruegel, Giovanni VignaUSENIX Security 2023
- Enhancing Smart Contract Security Analysis with Execution Property GraphsKaihua Qin, Zhe Ye, Zhun Wang, Weilin Li et al.ISSTA 2025 · 1 citation
- Maximum k-Plex Search: An Alternated Reduction-and-Bound MethodShuohao Gao, Kaiqiang Yu, Shengxin Liu, Cheng LongVLDB 2025 · 3 citations
