IDEAS home Printed from https://ideas.repec.org/p/arx/papers/0705.2551.html
   My bibliography  Save this paper

Network Topology of an Experimental Futures Exchange

Author

Listed:
  • S. C. Wang
  • J. J. Tseng
  • C. C. Tai
  • K. H. Lai
  • W. S. Wu
  • S. H. Chen
  • S. P. Li

Abstract

Many systems of different nature exhibit scale free behaviors. Economic systems with power law distribution in the wealth is one of the examples. To better understand the working behind the complexity, we undertook an empirical study measuring the interactions between market participants. A Web server was setup to administer the exchange of futures contracts whose liquidation prices were coupled to event outcomes. After free registration, participants started trading to compete for the money prizes upon maturity of the futures contracts at the end of the experiment. The evolving `cash' flow network was reconstructed from the transactions between players. We show that the network topology is hierarchical, disassortative and scale-free with a power law exponent of 1.02+-0.09 in the degree distribution. The small-world property emerged early in the experiment while the number of participants was still small. We also show power law distributions of the net incomes and inter-transaction time intervals. Big winners and losers are associated with high degree, high betweenness centrality, low clustering coefficient and low degree-correlation. We identify communities in the network as groups of the like-minded. The distribution of the community sizes is shown to be power-law distributed with an exponent of 1.19+-0.16.

Suggested Citation

  • S. C. Wang & J. J. Tseng & C. C. Tai & K. H. Lai & W. S. Wu & S. H. Chen & S. P. Li, 2007. "Network Topology of an Experimental Futures Exchange," Papers 0705.2551, arXiv.org.
    • Handle: RePEc:arx:papers:0705.2551
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/0705.2551
    File Function: Latest version
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhou, Bin & Xie, Jia-Rong & Yan, Xiao-Yong & Wang, Nianxin & Wang, Bing-Hong, 2017. "A model of task-deletion mechanism based on the priority queueing system of Barabási," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 415-421.
    2. Peng, Dan & Han, Xiao-Pu & Wei, Zong-Wen & Wang, Bing-Hong, 2015. "Punctuated equilibrium dynamics in human communications," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 36-44.
    3. Zhi-Qiang Jiang & Wen-Jie Xie & Xiong Xiong & Wei Zhang & Yong-Jie Zhang & W. -X. Zhou, 2012. "Trading networks, abnormal motifs and stock manipulation," Papers 1301.0007, arXiv.org.
    4. Wang, Junjie & Zhou, Shuigeng & Guan, Jihong, 2011. "Characteristics of real futures trading networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(2), pages 398-409.
    5. Tseng, Jie-Jun & Lin, Chih-Hao & Lin, Chih-Ting & Wang, Sun-Chong & Li, Sai-Ping, 2010. "Statistical properties of agent-based models in markets with continuous double auction mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(8), pages 1699-1707.
    6. Junjie Wang & Shuigeng Zhou & Jihong Guan, 2010. "Characteristics of Real Futures Trading Networks," Papers 1004.4402, arXiv.org, revised Feb 2011.
    7. Lee, Junghoon & Youn, Janghyuk & Chang, Woojin, 2012. "Intraday volatility and network topological properties in the Korean stock market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1354-1360.
    8. Aura Reggiani, 2022. "The Architecture of Connectivity: A Key to Network Vulnerability, Complexity and Resilience," Networks and Spatial Economics, Springer, vol. 22(3), pages 415-437, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:0705.2551. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.