π
π
The Cartographer
A new fast algorithm for reproducing complex networks with community structure
August 30, 2016 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Mateusz Kowalczyk, Piotr Fronczak, Agata Fronczak
arXiv ID
1608.08609
Category
physics.soc-ph
Cross-listed
cond-mat.dis-nn,
cs.SI
Citations
1
Venue
arXiv.org
Last Checked
4 months ago
Abstract
In this paper, we introduce a new algorithm allowing for generation of networks with heterogeneity of both node degrees and community sizes. The quality and efficiency of the algorithm is analyzed and compared to the other, so far the most popular algorithm which was proposed by Lancichinetti et al. We discuss the advantages and shortcomings of both algorithms indicating the areas of their potential application.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.soc-ph
R.I.P.
π»
Ghosted
Networks beyond pairwise interactions: structure and dynamics
R.I.P.
π»
Ghosted
Statistical physics of human cooperation
R.I.P.
π»
Ghosted
Vital nodes identification in complex networks
R.I.P.
π»
Ghosted
Influence maximization in complex networks through optimal percolation
R.I.P.
π»
Ghosted
Scale-free networks are rare
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted