Wahid-Ul-Ashraf, A., Budka, M. and Musial, K., 2018. NetSim: The framework for complex network generator. In: KES-2018: 22nd International Conference on Knowledge-Based and Intelligent Information & Engineering Systems, 3-5 September 2018, Belgrade, Serbia, 547-556.
Full text available as:
|
PDF (OPEN ACCESS)
1-s2.0-S1877050918312651-main.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. 372kB | |
PDF
1805.10520v1.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Attribution Non-commercial No Derivatives. 353kB | ||
Copyright to original material in this document is with the original owner(s). Access to this content through BURO is granted on condition that you use it only for research, scholarly or other non-commercial purposes. If you wish to use it for any other purposes, you must contact BU via BURO@bournemouth.ac.uk. Any third party copyright material in this document remains the property of its respective owner(s). BU grants no licence for further use of that third party material. |
Official URL: http://kes2018.kesinternational.org/
DOI: 10.1016/j.procs.2018.07.289
Abstract
Networks are everywhere and their many types, including social networks, the Internet, food webs etc., have been studied for the last few decades. However, in real-world networks, it's hard to find examples that can be easily comparable, i.e. have the same density or even number of nodes and edges. We propose a flexible and extensible NetSim framework to understand how properties in different types of networks change with varying number of edges and vertices. Our approach enables to simulate three classical network models (random, small-world and scale-free) with easily adjustable model parameters and network size. To be able to compare different networks, for a single experimental setup we kept the number of edges and vertices fixed across the models. To understand how they change depending on the number of nodes and edges we ran over 30,000 simulations and analysed different network characteristics that cannot be derived analytically. Two of the main findings from the analysis are that the average shortest path does not change with the density of the scale-free network but changes for small-world and random networks; the apparent difference in mean betweenness centrality of the scale-free network compared with random and small-world networks.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Uncontrolled Keywords: | complex networks; simulation; random graphs;scale-free networks; small-world networks |
Group: | Faculty of Science & Technology |
ID Code: | 30818 |
Deposited By: | Symplectic RT2 |
Deposited On: | 05 Jun 2018 10:38 |
Last Modified: | 14 Mar 2022 14:11 |
Downloads
Downloads per month over past year
Repository Staff Only - |