Birds of a feather or opposites attract -- effects in network modelling

DOI10.24166/IM.11.2017MaRDI QIDQ3389685zbMATH OpenOpenAlexFDO

Authors Maria Deijfen, Robert Fitzner

Publication date 23 March 2022

Published in Internet Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionpreferential attachmentdegree distributionhomophilyconfiguration modelnetwork modellingcritical parametercomponent sizeErdős-Rényi graphheterophily

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30) Applications of graph theory to circuits and networks (94C15)

Abstract: We study properties of some standard network models when the population is split into two types and the connection pattern between the types is varied. The studied models are generalizations of the ErdH{o}s-R'{e}nyi graph, the configuration model and a preferential attachment graph. For the ErdH{o}s-R'{e}nyi graph and the configuration model, the focus is on the component structure. We derive expressions for the critical parameter, indicating when there is a giant component in the graph, and study the size of the largest component by aid of simulations. When the expected degrees in the graph are fixed and the connections are shifted so that more edges connect vertices of different types, we find that the critical parameter decreases. The size of the largest component in the supercritical regime can be both increasing and decreasing as the connections change, depending on the combination of types. For the preferential attachment model, we analyze the degree distributions of the two types and derive explicit expressions for the degree exponents. The exponents are confirmed by simulations that also illustrate other properties of the degree structure.

Recommendations

• Preferential attachment graphs with co-existing types of different fitnesses
• Two evolving social network models
• Coexistence in preferential attachment networks
• A Geometric Preferential Attachment Model of Networks II
• Dynamics in affinity-weighted preferential attachment networks

Cites work

• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A critical point for random graphs with a given degree sequence
• A new approach to the giant component problem
• A preferential attachment model with random initial degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• An SIR epidemic model on a population with random network and household structure, and several types of individuals
• Emergence of Scaling in Random Networks
• Generating simple random graphs with prescribed degree distribution
• Latent Space Approaches to Social Network Analysis
• On a conditionally Poissonian graph process
• Paths in graphs
• Random graphs and complex networks. Volume 1
• Random networks with preferential growth and vertex death
• Random trees and general branching processes
• Reconstruction and estimation in the planted partition model
• Stochastic Blockmodels for Directed Graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The degree sequence of a scale-free random graph process
• The phase transition in inhomogeneous random graphs

Cited in

(3)

• Dynamics in affinity-weighted preferential attachment networks
• Birds of Moderately Different Feathers: Bandwagon Dynamics and the Threshold Heterogeneity of Network Neighbors
• Community modulated recursive trees and population dependent branching processes

This page was built for publication: Birds of a feather or opposites attract -- effects in network modelling

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