Parallelism in simulation and modeling of scale-free complex networks

DOI10.1016/J.PARCO.2010.04.004MaRDI QIDQ991146zbMATH OpenOpenAlexFDO

Authors Tomas Hruz, Stefan Geisseler, Marcel Schöngens

Publication date 2 September 2010

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.parco.2010.04.004

zbMATH Keywords

stochastic processesscale-free networksnon-growing complex networks

Mathematics Subject Classification ID

Recommendations

• Generating Massive Scale-Free Networks under Resource Constraints
• Scalable generation of scale-free graphs
• Exactly scale-free scale-free networks
• Scale-free networks: basic theory and applied research
• Computing and Combinatorics

Cites work

• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• Collective dynamics of `small-world' networks
• Emergence of Scaling in Random Networks
• On certain connectivity properties of the internet topology
• Statistical mechanics of complex networks
• Techniques for analyzing dynamic random graph models of web-like networks: An overview
• The Structure and Function of Complex Networks

Cited in

(4)

• Efficient parallel simulation over large-scale social contact networks
• Genesis: a scalable distributed system for large-scale parallel network simulation
• Mechanisms Inducing Parallel Computation in a Model of Physarum polycephalum Transport Networks
• Analysis of average shortest-path length of scale-free network

This page was built for publication: Parallelism in simulation and modeling of scale-free complex networks

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