Title |
Two models of sparse and clustered dynamic networks |
Authors |
Bloznelis, Mindaugas ; Marma, Dominykas |
DOI |
10.1093/comnet/cnaf008 |
Full Text |
|
Is Part of |
Journal of complex networks.. Oxford : Oxford University Press. 2025, vol. 13, iss. 4, art. no. cnaf008, p. [1-15].. ISSN 2051-1310. eISSN 2051-1329 |
Keywords [eng] |
dynamic network ; stationary network ; network Markov chain ; clustering coefficient |
Abstract [eng] |
We present two models of sparse dynamic networks that display transitivity—the tendency for nodes sharing a common neighbour to be neighbours of one another. Our first network is a continuous time Markov chain whose states are graphs with the common set of nodes. Our second network is the affiliation network based on a latent Markov chain whose states are bipartite graphs where actors are linked to attributes/affiliations. Actors are adjacent in the affiliation network whenever they are linked to a common attribute. We analyse geometric properties of both dynamic networks at stationarity and show that networks possess high clustering. They admit tunable degree distribution and clustering coefficients. |
Published |
Oxford : Oxford University Press |
Type |
Journal article |
Language |
English |
Publication date |
2025 |
CC license |
|