Distributed network generation based on preferential attachment in ABS

DOI10.1007/978-3-319-51963-0_9MaRDI QIDQ2971128zbMATH OpenOpenAlexFDO

Authors Keyvan Azadbakht, Nikolaos Bezirgiannis, Frank S. de Boer

Publication date 4 April 2017

Published in SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/25529

zbMATH Keywords

actor modeldistributed programmingpreferential attachmentsocial networksynchronization

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Recommendations

• Generating Massive Scale-Free Networks under Resource Constraints
• Scalable generation of scale-free graphs
• A preferential attachment model with Poisson growth for scale-free networks
• Growth and preferential attachment in scale-free networks
• Double preferential scale-free network models

Cites work

• Collective dynamics of `small-world' networks
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3141601 (Why is no real title available?)
• Key-ABS: a deductive verification tool for the concurrent modelling language ABS

Cited in

(3)

• Deadlock detection for actor-based coroutines
• Social selection-aware social network generation model
• Parallel and I/O-efficient algorithms for non-linear preferential attachment

Describes a project that uses

Uses Software

• SNAP
• ABS

This page was built for publication: Distributed network generation based on preferential attachment in ABS

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