Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3372
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKashyap, G.en_US
dc.contributor.authorAMBIKA, G.en_US
dc.date.accessioned2019-07-01T05:38:42Z-
dc.date.available2019-07-01T05:38:42Z-
dc.date.issued2017-11en_US
dc.identifier.citationJournal of Complex Networks, 6(5), 767-787.en_US
dc.identifier.issn2051-1310en_US
dc.identifier.issn2051-1329en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3372-
dc.identifier.urihttps://doi.org/10.1093/comnet/cnx057en_US
dc.description.abstractWith 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 analyse 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 (SF) 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. In both random and SF networks, we study the behaviour of the limiting value of dissortative degree-correlation, as a function of parameters of the networks. 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.en_US
dc.language.isoenen_US
dc.publisherOxford University Pressen_US
dc.subjectTuning clusteringen_US
dc.subjectDegree-correlationsen_US
dc.subjectDirected networksen_US
dc.subjectMultidisciplinary problemsen_US
dc.subject2017en_US
dc.titleMechanisms for tuning clustering and degree-correlations in directed networksen_US
dc.typeArticleen_US
dc.contributor.departmentDept. of Physicsen_US
dc.identifier.sourcetitleJournal of Complex Networksen_US
dc.publication.originofpublisherForeignen_US
Appears in Collections:JOURNAL ARTICLES

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.