**:** ..,

..,

..
**:**
**:** 109
**:**
**:** 2024
**:** .., .., .. // . 109. .: , 2024. .89-121. DOI: https://doi.org/10.25728/ubs.2024.109.5

** :** , , , , , ,

** (.):** network evolution, preferential and clustering attachment, mixed clustering-preferential attachment, node degree, triangle counts, node deletion, clustering coefficient

**:** (preferential attachment), (clustering attachment) . : 1) ; 2) "", ; 3) , . : (.. , ) . . - .

** (.):** The evolution of a random network by models of preferential, clustering and mixed attachments to form links between newly appending nodes and existing nodes is studied. Strategies of node deletion at each step of network evolution are considered: 1) without node and edge deletion;~2) deletion the least influential node among the most 'old', where the node's PageRank is used as a measure of the node's influence;~3) deletion a node with a probability inversely proportional to the node degree. For these deletion strategies the dependence of two characteristics of random networks, namely, the node degrees and node triangle counts (that is, the triples of interconnected nodes in which the node is involved), and the behavior of clustering coefficients of nodes are compared by simulation. The heaviness of the distribution tails for the node degrees and the node triangle counts is estimated. The mixed clustering-preferential attachment is proposed here for the first time.

PDF
: 121, : 46, : 9.