IDEAS home Printed from https://ideas.repec.org/a/spr/stpapr/v66y2025i5d10.1007_s00362-025-01712-y.html
   My bibliography  Save this article

A family of network evolution models with moderate density

Author

Listed:
  • István Fazekas

    (University of Debrecen)

  • László Fórián

    (University of Debrecen)

Abstract

We study a parametrized family of discrete time network evolution models. The evolution of the graph is based on constructions and deletions of k-cliques. Using martingale theory, we prove an almost sure limit theorem for the number of vertices, then show its asymptotic normality. We obtain an almost sure limit theorem for the degree of a fixed vertex. We also present an asymptotic normality result for the degree of a fixed vertex. Functional limit theorem is obtained for the number of vertices. Multidimensional functional limit theorem is proved for the joint behaviour of the degrees of several fixed vertices. For the proof, we apply martingale functional limit theorems. Besides mathematical proofs, we offer simulation results supporting our theorems.

Suggested Citation

  • István Fazekas & László Fórián, 2025. "A family of network evolution models with moderate density," Statistical Papers, Springer, vol. 66(5), pages 1-18, August.
    • Handle: RePEc:spr:stpapr:v:66:y:2025:i:5:d:10.1007_s00362-025-01712-y
    DOI: 10.1007/s00362-025-01712-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00362-025-01712-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00362-025-01712-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:stpapr:v:66:y:2025:i:5:d:10.1007_s00362-025-01712-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.