A random graph model based on 3-interactions

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…