Paper: arXiv 2406.16573
Authors: Yu Zhang, Tao Yan, Jianhong Lin, Benjamin Kraner, Claudio Tessone
Abstract
In decentralized exchanges (DEXs), the arbitrage paths exist abundantly in the form of both arbitrage loops (e.g. the arbitrage path starts from token A and back to token A again in the end, A, B,…, A) and non-loops (e.g. the arbitrage path starts from token A and stops at a different token N, A, B,…, N). The Moore-Bellman-Ford algorithm, often coupled with the ``walk to the root" technique, is commonly employed for detecting arbitrage loops in the token graph of decentralized exchanges (DEXs) such as Uniswap. However, a limitation of this algorithm is its ability to recognize only a limited number of arbitrage loops in each run. Additionally, it cannot specify the starting token of the detected arbitrage loops, further constraining its effectiveness in certain scenarios. Another limitation of this algorithm is its incapacity to detect non-loop arbitrage paths between any specified pairs of tokens. In this paper, we develop a new method to solve these problems by combining the line graph and a modified Moore-Bellman-Ford algorithm (MMBF). This method can help to find more arbitrage loops by detecting at least one arbitrage loop starting from any specified tokens in the DEXs and can detect the non-loop arbitrage paths between any pair of tokens. Then, we applied our algorithm to Uniswap V2 and found more arbitrage loops and non-loops indeed compared with applying the Moore-Bellman-Ford (MBF) combined algorithm. The found arbitrage profit by our method in some arbitrage paths can be even as high as one million dollars, far larger than that found by the MBF combined algorithm. Finally, we statistically compare the distribution of arbitrage path lengths and the arbitrage profit detected by both our method and the MBF combined algorithm, and depict how potential arbitrage opportunities change with time by our method.
Complexity vs Empirical Score
- Math Complexity: 7.5/10
- Empirical Rigor: 6.0/10 (capped from 7.0: no out-of-sample test; see penalty flags)
- Quadrant: Holy Grail — high math complexity, high empirical rigor (effective empirical rigor capped from 7.0)
Why this score: The paper introduces a modified Moore-Bellman-Ford algorithm and line graph concepts, requiring advanced graph theory and discrete mathematics. It is heavily data-driven, using real historical Uniswap V2 data over three years, performing statistical comparisons, and presenting empirical results on arbitrage profits.
Research Flowchart
flowchart TD
A["Research Goal<br>Overcome MBF Limitations<br>Find More Arbitrage Loops & Paths"] --> B["Methodology<br>Line Graph + Modified MBF MMBF"]
B --> C["Data & Inputs<br>Uniswap V2 DEX Token Graph"]
C --> D["Computational Process<br>MMBF Detects Loops & Non-Loops<br>Specifying Start/End Tokens"]
D --> E{"Key Outcomes"}
E --> F["More Arbitrage Opportunities<br>Found vs. MBF"]
E --> G["High-Value Profits<br>Up to $1M Detected"]
E --> H["Statistical Analysis<br>Path Length & Profit Distribution"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a new arbitrage detection method that combines a line‑graph transformation with a modified Moore‑Bellman‑Ford algorithm (MMBF) to find more arbitrage loops and non‑loop opportunities on DEXs.
Source sentence
In this paper, we develop a new method to solve these problems by combining the line graph and a modified Moore‑Bellman‑Ford algorithm (MMBF). This method can help to find more arbitrage loops by detecting at least one arbitrage loop starting from any specified tokens in the DEXs and can detect the non‑loop arbitrage p
Assumes 6
- Gas fees are ignored in the profit calculations. execution
Source sentence
Another limitation of this paper is that the gas fee is not considered. The gas fee is a significant factor that deserves to be considered in on‑chain transactions.
- The token graph is constructed from liquidity pool reserves and token addresses as provided by The Graph. data
Source sentence
which provides detailed information for each token of the liquidity pools, such as tokens’ addresses, names, symbols, reserves, and decimals.
- Only the largest four hundred liquidity pools (about 90% of TVL) are used, representing roughly one hundred tokens. data
Source sentence
largest four hundred liquidity pools in TVL take about 90% of the total TVL and correspond to about one hundred different tokens. This is why we chose one hundred tokens and about four hundred liquidity pools in our research.
- Arbitrage profit is computed on daily snapshot data, assuming static reserves within each snapshot. model
Source sentence
To identify potential arbitrage opportunities with time, we retrieve historical daily snapshots from The Graph, which encompass the daily trading volume in USD and reserves of each token.
Show 2 more
- The bisection method can efficiently find the optimal input amount for maximal arbitrage profit. model
Source sentence
it is very easy and efficient to use the bisection method to calculate the optimal input of the starting token to get maximal arbitrage profit.
- Negative cycles may exist in the token graph, but the MBF combined algorithm cannot handle non‑loop paths when they do. model
Source sentence
The MBF combined algorithm is not suitable directly on token graphs for looking for non‑loop paths between a pair of nodes if negative loops exist in the network.
Data
Uniswap V2 · crypto
- Uniswap V2 token graph crypto-onchain public
Source sentence
we chose one hundred tokens and about four hundred liquidity pools in our research.
Costs
Not modeled
Source sentence
Another limitation of this paper is that the gas fee is not considered. The gas fee is a significant factor that deserves to be considered in on‑chain transactions.
Finds 5
- The proposed MMBF method discovers many more arbitrage loops and non‑loops than the MBF combined algorithm. performance
Source sentence
The number of arbitrage loops and non‑loops by our method is much larger than that by the MBF combined algorithm, which denotes that our method can find more arbitrage opportunities than the MBF combined algorithm.
- The largest arbitrage profit identified by the new method reaches about one million dollars, versus about one hundred thousand dollars for the MBF combined algorithm. performance
Source sentence
The largest profit by our method can be a million dollars, compared to about one hundred thousand by the MBF combined algorithm.
- 23,868 arbitrage paths with profit > $1,000 are found by the new method, while only 19 such paths are found by the MBF combined algorithm. statistical
Source sentence
23,868 arbitrage paths with more than a thousand dollars are found by our method, the number is only 19 by the MBF combined algorithm.
- Arbitrage path lengths found by the new method are mostly between 7 and 11 hops, with a near‑symmetric distribution. statistical
Source sentence
The distribution of arbitrage paths by our method is nearly symmetric, and we find that the length of most arbitrage paths ranges from 7 to 11.
- Running time of the algorithm on the selected 100 tokens and 400 pools is about 8–10 seconds, indicating practical feasibility. performance
Source sentence
the running time is about 8-10 seconds, which means that it can be used in practical arbitrage detection.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 16 related papers). Coverage is partial, so this is neither replication nor refutation.
1 paper in the archive
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.
Cited References (19)
- Decentralized Finance: Regulating Cryptocurrency Exchanges (2021)
- An Empirical Study of Market Inefficiencies in Uniswap and SushiSwap (2022) — link
- Trade or Trick?: Detecting and Characterizing Scam Tokens on Uniswap Decentralized Exchange (2022) — link
- SoK: Decentralized Finance (DeFi) Attacks (2023) — link
- Cyclic Arbitrage in Decentralized Exchanges (2023) — link
- SoK: Decentralized Exchanges (DEX) with Automated Market Maker (AMM) Protocols (2023) — link
- Detecting and identifying arbitrage in the spot foreign exchange market (2020)
- On the just-in-time discovery of profit-generating transactions in defi protocols (2021)
and 11 more
- Digraphs: theory, algorithms and applications (2008)
- Some properties of line digraphs (1960)
- From networks to optimal higher-order models of complex systems (2019)
- Uniswap v2 Core (2020) — link
- Cyclic arbitrage in decentralized exchanges (2022)
- A large scale study of the ethereum arbitrage ecosystem (2023)
- Detecting arbitrage on ethereum through feature fusion and positive-unlabeled learning (2022)
- Arbitrage in Crypto Markets: An Analysis of Primary Ethereum Blockchain Data (2022)
- An empirical study of market inefficiencies in Uniswap and SushiSwap (2022) — link
- Global order routing on exchange networks (2021)
- Negative-cycle detection algorithms. (1999)
0 of 19 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.