A random graph model based on 3-interactions

2011/12/01 by Ágnes Backhausz, Backhausz, Ágnes, Tamás F. Móri +1
Mathematics · Physics and Astronomy · #05C80 #60G42 #Complex Network Analysis Techniques #FOS: Mathematics #Opinion Dynamics and Social Influence #Probability (math.PR) #Stochastic processes and statistical mechanics #math.PR #msc:05C80 #msc:60G42

paper · pdf · doi:10.48550/arxiv.1112.0146

9 pages

arxiv created 2011/12/01 · openalex publication_date 2011/12/01 · arxiv updated 2011/12/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider a random graph model evolving in discrete time-steps that is based on 3-interactions among vertices. Triangles, edges and vertices have different weights; objects with larger weight are more likely to participate in future interactions. We prove the scale free property of the model by exploring the asymptotic behaviour of the weight distribution. We also find the asympotics of the weight of a fixed vertex.

Related

• Weights of Cliques in a Random Graph Model Based on Three-Interactions
• Weights and degrees in a random graph model based on 3-interactions
• Scale-free property for degrees and weights in an N-interactions random graph model
• The asymptotic behaviour of the weights and the degrees in an N-interactions random graph model
• Graph Limit for Interacting Particle Systems on Weighted Random Graphs