Probabilistic Inductive Classes of Graphs

DOI10.1080/00222500801931586zbMath1135.91424arXivmath/0612778OpenAlexW3102305050WikidataQ59723860 ScholiaQ59723860MaRDI QIDQ3499446

Vladimir Batagelj, Zoran Nikoloski, Nataša Kejžar

Publication date: 29 May 2008

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

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

zbMATH Keywords

probabilistic methodnetwork modelsgrowing networksinductive classes of graphs

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (3)

Labelled graph strategic rewriting for social networks ⋮ Strategic port graph rewriting: an interactive modelling framework ⋮ Labelled Graph Rewriting Meets Social Networks

Uses Software

• NetLogo

Cites Work

• The degree sequence of a scale-free random graph process
• Random Deletion in a Scale-Free Random Graph Process
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic Inductive Classes of Graphs