AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.5 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

A continuous-time network evolution model describing N-interactions

István Fazekas( )Attila BartaLászló FóriánBettina Porvázsnyik
Faculty of Informatics, University of Debrecen, P.O. Box 400, 4002 Debrecen, Hungary
Show Author Information

Abstract

We have introduced a new continuous-time network evolution model. We have described cooperation, so we have considered the cliques of nodes. The evolution of the network was based on cliques of nodes of the network and was governed by a branching process. The basic properties of the evolution process were described. Asymptotic theorems were proved for the number of cliques having a fixed size and the degree of a fixed node. The generating function was calculated, and then the probability of extinction was obtained. For the proof, advanced results of multi-type branching processes were used. Besides precise mathematical proofs, simulation examples also supported our results.

CLC number: 60J85

References

【1】
【1】
 
 
AIMS Mathematics
Pages 35721-35742

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Fazekas I, Barta A, Fórián L, et al. A continuous-time network evolution model describing N-interactions. AIMS Mathematics, 2024, 9(12): 35721-35742. https://doi.org/10.3934/math.20241695

121

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 06 September 2024
Revised: 18 November 2024
Accepted: 11 December 2024
Published: 15 December 2024
©2024 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)