A Model for Social Networks

Abstract

Social networks are organized into communities with dense internal connections, giving rise to high values of the clustering coefficient. In addition, these networks have been observed to be assortative, i.e. highly connected vertices tend to connect to other highly connected vertices, and have broad degree distributions. We present a model for an undirected growing network which reproduces these characteristics, with the aim of producing efficiently very large networks to be used as platforms for studying sociodynamic phenomena. The communities arise from a mixture of random attachment and implicit preferential attachment. The structural properties of the model are studied analytically and numerically, using the $k$-clique method for quantifying the communities.

15 pages (Latex), 6 figures (Postscript)

References in corpus (13)

• The structure and function of complex networks
• Finding and evaluating community structure in networks
• Fast algorithm for detecting community structure in networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Functional cartography of complex metabolic networks
• Why social networks are different from other types of networks
• Dynamics of Rumor Spreading in Complex Networks
• Clique percolation in random networks
• Structure and Time-Evolution of an Internet Dating Community
• A spatial model for social networks
• An evolving network model with community structure
• Scale Free Networks from Self-Organisation
• The networked seceder model: Group formation in social and economic systems

Cited by in corpus (44)

• Triadic closure as a basic generating mechanism of communities in complex networks
• Clique Graphs and Overlapping Communities
• Cumulative effects of triadic closure and homophily in social networks
• Emergence of Soft Communities from Geometric Preferential Attachment
• Triadic closure dynamics drives scaling-laws in social multiplex networks
• Structural Transitions in Dense Networks
• Analyses of Some Structural Properties on a Class of Hierarchical Scale-free Networks
• Random Graph Modeling: A survey of the concepts
• Anomalous lifetime distributions and topological traps in ordering dynamics
• Modeling two-language competition dynamics
• Broad lifetime distributions for ordering dynamics in complex networks
• Triangular clustering in document networks
• Evolution of Vocabulary on Scale-free and Random Networks
• Assortativity and leadership emergence from anti-preferential attachment in heterogeneous networks
• Evolution of Coordination in Social Networks: A Numerical Study
• Understanding interaction network formation across instructional contexts in remote physics courses
• Emergence of linguistic conventions in multi-agent reinforcement learning
• Growing hyperbolic networks beyond two dimensions: the generalised popularity-similarity optimisation model
• Memory effects induce structure in social networks with activity-driven agents
• The Maximum Number of 3- and 4-Cliques within a Planar Maximally Filtered Graph
• Link-space formalism for network analysis
• Maximally modular structure of growing hyperbolic networks
• Exactly Solvable Random Graph Ensemble with Extensively Many Short Cycles
• Emergence of Clustering in an Acquaintance Model without Homophily
• Threshold games and cooperation on multiplayer graphs
• Evolutionary of Online Social Networks Driven by Pareto Wealth Distribution and Bidirectional Preferential Attachment
• Topics in social network analysis and network science
• Link Prediction Accuracy on Real-World Networks Under Non-Uniform Missing Edge Patterns
• Generating Scale-free Networks with Adjustable Clustering Coefficient Via Random Walks
• Local topological moves determine global diffusion properties of hyperbolic higher-order networks
• A phase transition creates the geometry of the continuum from discrete space
• Two-Population Dynamics in a Growing Network Model
• What topics of peer interactions correlate with student performance in physics courses?
• Generating Preferential Attachment Graphs via a Pólya Urn with Expanding Colors
• Around Average Behavior: 3-lambda Network Model
• Towards a Fast and Accurate Model of Intercontact Times for Epidemic Routing
• Link-Space and Network Analysis
• Competition Between Homophily and Information Entropy Maximization in Social Networks
• Homophily and Triadic Closure in Evolving Social Networks
• Cooperation on Social Networks and Its Robustness
• Generalized Lottery Trees: Budget-Consistent Incentive Tree Mechanisms for Crowdsourcing
• Improved mixing time for k-subgraph sampling
• On the Controllability of Clustered Scale-Free Networks
• Triangle Preferential Attachment Has Power-law Degrees and Eigenvalues; Eigenvalues Are More Stable to Network Sampling