41
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Do the Rich Get Richer? An Empirical Analysis of the Bitcoin Transaction Network

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The possibility to analyze everyday monetary transactions is limited by the scarcity of available data, as this kind of information is usually considered highly sensitive. Present econophysics models are usually employed on presumed random networks of interacting agents, and only some macroscopic properties (e.g. the resulting wealth distribution) are compared to real-world data. In this paper, we analyze Bitcoin, which is a novel digital currency system, where the complete list of transactions is publicly available. Using this dataset, we reconstruct the network of transactions and extract the time and amount of each payment. We analyze the structure of the transaction network by measuring network characteristics over time, such as the degree distribution, degree correlations and clustering. We find that linear preferential attachment drives the growth of the network. We also study the dynamics taking place on the transaction network, i.e. the flow of money. We measure temporal patterns and the wealth accumulation. Investigating the microscopic statistics of money movement, we find that sublinear preferential attachment governs the evolution of the wealth distribution. We report a scaling law between the degree and wealth associated to individual nodes.

          Related collections

          Most cited references26

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          Emergence of scaling in random networks

          Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature is found to be a consequence of the two generic mechanisms that networks expand continuously by the addition of new vertices, and new vertices attach preferentially to already well connected sites. A model based on these two ingredients reproduces the observed stationary scale-free distributions, indicating that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            The origin of bursts and heavy tails in human dynamics

            The dynamics of many social, technological and economic phenomena are driven by individual human actions, turning the quantitative understanding of human behavior into a central question of modern science. Current models of human dynamics, used from risk assessment to communications, assume that human actions are randomly distributed in time and thus well approximated by Poisson processes. In contrast, there is increasing evidence that the timing of many human activities, ranging from communication to entertainment and work patterns, follow non-Poisson statistics, characterized by bursts of rapidly occurring events separated by long periods of inactivity. Here we show that the bursty nature of human behavior is a consequence of a decision based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, most tasks being rapidly executed, while a few experience very long waiting times. In contrast, priority blind execution is well approximated by uniform interevent statistics. These findings have important implications from resource management to service allocation in both communications and retail.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Connectivity of Growing Random Networks

              A solution for the time- and age-dependent connectivity distribution of a growing random network is presented. The network is built by adding sites which link to earlier sites with a probability A_k which depends on the number of pre-existing links k to that site. For homogeneous connection kernels, A_k ~ k^gamma, different behaviors arise for gamma 1, and gamma=1. For gamma 1, a single site connects to nearly all other sites. In the borderline case A_k ~ k, the power law N_k ~k^{-nu} is found, where the exponent nu can be tuned to any value in the range 2
                Bookmark

                Author and article information

                Contributors
                Role: Editor
                Journal
                PLoS One
                PLoS ONE
                plos
                plosone
                PLoS ONE
                Public Library of Science (San Francisco, USA )
                1932-6203
                2014
                5 February 2014
                : 9
                : 2
                : e86197
                Affiliations
                [1 ]Department of Physics of Complex Systems, Eötvös Loránd University, Budapest, Hungary
                [2 ]Department of Theoretical Physics, Budapest University of Technology and Economics, Budapest, Hungary
                University of Maribor, Slovenia
                Author notes

                Competing Interests: The authors have declared that no competing interests exist.

                Analyzed the data: DK MP. Wrote the paper: DK MP IC GV. Conceived the study: DK IC GV MP.

                Article
                PONE-D-13-36894
                10.1371/journal.pone.0086197
                3914786
                24505257
                a04bb5b6-a23b-4092-b6e0-e2348376f99e
                Copyright @ 2014

                This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

                History
                : 14 August 2013
                : 6 December 2013
                Page count
                Pages: 10
                Funding
                This work has been supported by the European Union under grant agreement No. FP7-ICT-255987-FOC-II Project. The authors thank the partial support of the European Union and the European Social Fund through project FuturICT.hu (grant no.: TAMOP-4.2.2.C-11/1/KONV-2012-0013), the OTKA 7779 and the NAP 2005/KCKHA005 grants. EITKIC_12-1-2012-0001 project was partially supported by the Hungarian Government, managed by the National Development Agency, and financed by the Research and Technology Innovation Fund and the MAKOG Foundation. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
                Categories
                Research Article
                Computer Science
                Information Technology
                Databases
                Mathematics
                Statistics
                Statistical Methods
                Physics
                Interdisciplinary Physics
                Statistical Mechanics
                Social and Behavioral Sciences
                Economics
                Mathematical Economics
                Sociology
                Social Networks

                Uncategorized
                Uncategorized

                Comments

                Comment on this article