Scholarlink

<p>We study a parametrized family of discrete time network evolution models. The evolution of the graph is based on constructions and deletions of <i>k</i>-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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A family of network evolution models with moderate density

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年6月9日

查看全文
  • István Fazekas,
  • László Fórián

摘要

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.