Investigation of triangle counts in graphs evolved by uniform clustering attachment

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Markovich, N. M., Vaičiulis, M.
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916100786094080
author Markovich, N. M.
Vaičiulis, M.
author_facet Markovich, N. M.
Vaičiulis, M.
contents The clustering attachment model introduced in the paper Bagrow and Brockmann (2013) may be used as an evolution tool of random networks. We propose a new clustering attachment model which can be considered as the limit of the former clustering attachment model as model parameter $α$ tends to zero. We focus on the study of a total triangle count that is considered in the literature as an important characteristic of the network clustering. It is proved that total triangle count tends to infinity a.s. for the proposed model. Our simulation study is used for the modeling of sequences of triangle counts. It is based on the interpretation of the clustering attachment as a generalized Pólya-Eggenberger urn model that is introduced here at first time.
format Preprint
id arxiv_https___arxiv_org_abs_2401_11548
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Investigation of triangle counts in graphs evolved by uniform clustering attachment
Markovich, N. M.
Vaičiulis, M.
Statistics Theory
The clustering attachment model introduced in the paper Bagrow and Brockmann (2013) may be used as an evolution tool of random networks. We propose a new clustering attachment model which can be considered as the limit of the former clustering attachment model as model parameter $α$ tends to zero. We focus on the study of a total triangle count that is considered in the literature as an important characteristic of the network clustering. It is proved that total triangle count tends to infinity a.s. for the proposed model. Our simulation study is used for the modeling of sequences of triangle counts. It is based on the interpretation of the clustering attachment as a generalized Pólya-Eggenberger urn model that is introduced here at first time.
title Investigation of triangle counts in graphs evolved by uniform clustering attachment
topic Statistics Theory
url https://arxiv.org/abs/2401.11548