Mechanisms for tuning clustering and degree-correlations in directed networks

May 04, 2017 Β· Declared Dead Β· πŸ› J. Complex Networks

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors G. Kashyap, G. Ambika arXiv ID 1705.01689 Category physics.soc-ph Cross-listed cs.SI Citations 10 Venue J. Complex Networks Last Checked 3 months ago
Abstract
With complex networks emerging as an effective tool to tackle multidisciplinary problems, models of network generation have gained an importance of their own. These models allow us to extensively analyze the data obtained from real-world networks, study their relevance and corroborate theoretical results. In this work, we introduce methods, based on degree preserving rewiring, that can be used to tune the clustering and degree-correlations in directed networks with random and scale-free topologies. They provide null-models to investigate the role of the mentioned properties along with their strengths and limitations. We find that in the case of clustering, structural relationships, that are independent of topology and rewiring schemes are revealed, while in the case of degree-correlations, the network topology is found to play an important role in the working of the mechanisms. We also study the effects of link-density on the efficiency of these rewiring mechanisms and find that in the case of clustering, the topology of the network plays an important role in determining how link-density affects the rewiring process, while in the case of degree-correlations, the link-density and topology, play no role for sufficiently large number of rewiring steps. Besides the intended purpose of tuning network properties, the proposed mechanisms can also be used as a tool to reveal structural relationships and topological constraints.
Community shame:
Not yet rated
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

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted