IDEAS home Printed from https://ideas.repec.org/a/gam/jstats/v5y2022i4p54-947d930490.html
   My bibliography  Save this article

Benford Networks

Author

Listed:
  • Roeland de Kok

    (Land Consult, landConsult.de Öhinghaltweg 3 D, 77815 Bühl, Germany)

  • Giulia Rotundo

    (Department of Statistical Sciences, Sapienza University of Rome, Piazzale Aldo Moro 5, 00185 Roma, Italy)

Abstract

The Benford law applied within complex networks is an interesting area of research. This paper proposes a new algorithm for the generation of a Benford network based on priority rank, and further specifies the formal definition. The condition to be taken into account is the probability density of the node degree. In addition to this first algorithm, an iterative algorithm is proposed based on rewiring. Its development requires the introduction of an ad hoc measure for understanding how far an arbitrary network is from a Benford network. The definition is a semi-distance and does not lead to a distance in mathematical terms, instead serving to identify the Benford network as a class. The semi-distance is a function of the network; it is computationally less expensive than the degree of conformity and serves to set a descent condition for the rewiring. The algorithm stops when it meets the condition that either the network is Benford or the maximum number of iterations is reached. The second condition is needed because only a limited set of densities allow for a Benford network. Another important topic is assortativity and the extremes which can be achieved by constraining the network topology; for this reason, we ran simulations on artificial networks and explored further theoretical settings as preliminary work on models of preferential attachment. Based on our extensive analysis, the first proposed algorithm remains the best one from a computational point of view.

Suggested Citation

  • Roeland de Kok & Giulia Rotundo, 2022. "Benford Networks," Stats, MDPI, vol. 5(4), pages 1-14, September.
    • Handle: RePEc:gam:jstats:v:5:y:2022:i:4:p:54-947:d:930490
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2571-905X/5/4/54/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2571-905X/5/4/54/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Roy Cerqueti & Claudio Lupi, 2021. "Some New Tests of Conformity with Benford’s Law," Stats, MDPI, vol. 4(3), pages 1-17, September.
    2. Cerqueti, Roy & Maggi, Mario, 2021. "Data validity and statistical conformity with Benford’s Law," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    3. Ausloos, M. & Herteliu, C. & Ileanu, B., 2015. "Breakdown of Benford’s law for birth data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 736-745.
    4. Uwe Hassler & Mehdi Hosseinkouchack, 2019. "Testing the Newcomb-Benford Law: experimental evidence," Applied Economics Letters, Taylor & Francis Journals, vol. 26(21), pages 1762-1769, December.
    5. Erik Holst & Poul Thyregod & Peter‐Th. Wilrich, 2001. "On Conformity Testing and the Use of two Stage Procedures," International Statistical Review, International Statistical Institute, vol. 69(3), pages 419-432, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Roy Cerqueti & Claudio Lupi, 2021. "Some New Tests of Conformity with Benford’s Law," Stats, MDPI, vol. 4(3), pages 1-17, September.
    2. Ausloos, Marcel & Ficcadenti, Valerio & Dhesi, Gurjeet & Shakeel, Muhammad, 2021. "Benford’s laws tests on S&P500 daily closing values and the corresponding daily log-returns both point to huge non-conformity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    3. Roy Cerqueti & Claudio Lupi, 2023. "Severe testing of Benford’s law," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 32(2), pages 677-694, June.
    4. Hürlimann, Werner, 2015. "On the uniform random upper bound family of first significant digit distributions," Journal of Informetrics, Elsevier, vol. 9(2), pages 349-358.
    5. Azevedo, Caio da Silva & Gonçalves, Rodrigo Franco & Gava, Vagner Luiz & Spinola, Mauro de Mesquita, 2021. "A Benford’s Law based methodology for fraud detection in social welfare programs: Bolsa Familia analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 567(C).
    6. Bormashenko, Ed. & Shulzinger, E. & Whyman, G. & Bormashenko, Ye., 2016. "Benford’s law, its applicability and breakdown in the IR spectra of polymers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 524-529.
    7. Whyman, G. & Ohtori, N. & Shulzinger, E. & Bormashenko, Ed., 2016. "Revisiting the Benford law: When the Benford-like distribution of leading digits in sets of numerical data is expectable?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 595-601.
    8. Jing Shi & Marcel Ausloos & Tingting Zhu, 2022. "If global or local investor sentiments are prone to developing an impact on stock returns, is there an industry effect?," International Journal of Finance & Economics, John Wiley & Sons, Ltd., vol. 27(1), pages 1309-1320, January.
    9. Adriano Silva & Sergio Floquet & Ricardo Lima, 2023. "Newcomb–Benford’s Law in Neuromuscular Transmission: Validation in Hyperkalemic Conditions," Stats, MDPI, vol. 6(4), pages 1-19, October.
    10. Ausloos, Marcel & Cerqueti, Roy & Lupi, Claudio, 2017. "Long-range properties and data validity for hydrogeological time series: The case of the Paglia river," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 470(C), pages 39-50.
    11. M. Jayasree & C. S. Pavana Jyothi & P. Ramya, 2018. "Benford’s Law and Stock Market—The Implications for Investors: The Evidence from India Nifty Fifty," Jindal Journal of Business Research, , vol. 7(2), pages 103-121, December.
    12. Ausloos, Marcel & Cerqueti, Roy & Mir, Tariq A., 2017. "Data science for assessing possible tax income manipulation: The case of Italy," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 238-256.
    13. Arezzo, Maria Felice & Cerqueti, Roy, 2023. "A Benford’s Law view of inspections’ reasonability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P1).
    14. Ausloos, Marcel & Jovanovic, Franck & Schinckus, Christophe, 2016. "On the “usual” misunderstandings between econophysics and finance: Some clarifications on modelling approaches and efficient market hypothesis," International Review of Financial Analysis, Elsevier, vol. 47(C), pages 7-14.
    15. Martin Andres, A. & Herranz Tejedor, I., 2004. "Exact unconditional non-classical tests on the difference of two proportions," Computational Statistics & Data Analysis, Elsevier, vol. 45(2), pages 373-388, March.
    16. Bogdan Vasile Ileanu & Marcel Ausloos & Claudiu Herteliu & Marian Pompiliu Cristescu, 2019. "Intriguing behavior when testing the impact of quotation marks usage in Google search results," Quality & Quantity: International Journal of Methodology, Springer, vol. 53(5), pages 2507-2519, September.
    17. Lee, Kang-Bok & Han, Sumin & Jeong, Yeasung, 2020. "COVID-19, flattening the curve, and Benford’s law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 559(C).
    18. Cerqueti, Roy & Maggi, Mario, 2021. "Data validity and statistical conformity with Benford’s Law," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    19. Ausloos, Marcel & Castellano, Rosella & Cerqueti, Roy, 2016. "Regularities and discrepancies of credit default swaps: a data science approach through Benford's law," Chaos, Solitons & Fractals, Elsevier, vol. 90(C), pages 8-17.
    20. Lasse Pröger & Paul Griesberger & Klaus Hackländer & Norbert Brunner & Manfred Kühleitner, 2021. "Benford’s Law for Telemetry Data of Wildlife," Stats, MDPI, vol. 4(4), pages 1-7, November.

    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:gam:jstats:v:5:y:2022:i:4:p:54-947:d:930490. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.