Modeling interacting dynamic networks. I: Preferred degree networks and their characteristics

DOI10.1088/1742-5468/2013/08/P08001MaRDI QIDQ3301655zbMATHOpenAlexFDO

Authors Wenjia Liu, Shivakumar Jolad, B. Schmittmann, R. K. P. Zia

Publication date 11 August 2020

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.7094

Mathematics Subject Classification ID

Applications of continuous-time Markov processes on discrete state spaces (60J28) Stochastic analysis in statistical mechanics (82M60) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31)

Abstract: We study a simple model of dynamic networks, characterized by a set preferred degree, $kappa$. Each node with degree $k$ attempts to maintain its $kappa$ and will add (cut) a link with probability $w(k;kappa)$ ($1-w(k;kappa)$). As a starting point, we consider a homogeneous population, where each node has the same $kappa$, and examine several forms of $w(k;kappa)$, inspired by Fermi-Dirac functions. Using Monte Carlo simulations, we find the degree distribution in steady state. In contrast to the well-known ErdH{o}s-R'{e}nyi network, our degree distribution is not a Poisson distribution; yet its behavior can be understood by an approximate theory. Next, we introduce a second preferred degree network and couple it to the first by establishing a controllable fraction of inter-group links. For this model, we find both understandable and puzzling features. Generalizing the prediction for the homogeneous population, we are able to explain the total degree distributions well, but not the intra- or inter-group degree distributions. When monitoring the total number of inter-group links, $X$, we find very surprising behavior. $X$ explores almost the full range between its maximum and minimum allowed values, resulting in a flat steady-state distribution, reminiscent of a simple random walk confined between two walls. Both simulation results and analytic approaches will be discussed.

Recommendations

• Modeling interacting dynamic networks: II. Systematic study of the statistical properties of cross-links between two networks with preferred degrees
• Networks with preferred degree: a mini-review and some new results
• Two evolving social network models
• Network evolution induced by the dynamical rules of two populations
• Preferential deletion in dynamic models of web-like networks

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Collective dynamics of `small-world' networks
• Dynamical Processes on Complex Networks
• Emergence of Scaling in Random Networks
• Epidemic spread in adaptive networks with multitype agents
• Exploring complex networks
• Network evolution induced by the dynamical rules of two populations
• Network science. Complexity in nature and technology
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks

Cited in

(10)

• \(N\)-intertwined SIS epidemic model with Markovian switching
• Complexity and heterogeneity in a dynamic network
• Modeling interacting dynamic networks: II. Systematic study of the statistical properties of cross-links between two networks with preferred degrees
• Effects of homophily and heterophily on preferred-degree networks: mean-field analysis and overwhelming transition
• Network evolution induced by the dynamical rules of two populations
• Emergence of a spectral gap in a class of random matrices associated with split graphs
• Preferential deletion in dynamic models of web-like networks
• Epidemics in adaptive social networks with temporary link deactivation
• Networks with preferred degree: a mini-review and some new results
• Identifying Preferences in Networks With Bounded Degree

This page was built for publication: Modeling interacting dynamic networks. I: Preferred degree networks and their characteristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301655)