{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:51:28Z","timestamp":1740171088703,"version":"3.37.3"},"reference-count":37,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:00:00Z","timestamp":1575331200000},"content-version":"vor","delay-in-days":365,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["318812"],"award-info":[{"award-number":["318812"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-12-1-0276","W911NF-17-1-0566"],"award-info":[{"award-number":["W911NF-12-1-0276","W911NF-17-1-0566"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1736209"],"award-info":[{"award-number":["1736209"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We develop a decentralized colouring approach to diversify the nodes in a complex network. The key is the introduction of a local conflict index (LCI) that measures the colour conflicts arising at each node which can be efficiently computed using only local information. We demonstrate via both synthetic and real-world networks that the proposed approach significantly outperforms random colouring as measured by the size of the largest colour-induced connected component. Interestingly, for scale-free networks further improvement of diversity can be achieved by tuning a degree-biasing weighting parameter in the LCI.<\/jats:p>","DOI":"10.1093\/comnet\/cny031","type":"journal-article","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T21:34:17Z","timestamp":1542317657000},"page":"554-563","source":"Crossref","is-referenced-by-count":5,"title":["Node diversification in complex networks by decentralized colouring"],"prefix":"10.1093","volume":"7","author":[{"given":"Richard","family":"Garcia-Lebron","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Texas at San Antonio, San Antonio, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J","family":"Myers","sequence":"first","affiliation":[{"name":"Air Force Research Laboratory, Rome, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shouhuai","family":"Xu","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Texas at San Antonio, San Antonio, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Sun","sequence":"first","affiliation":[{"name":"Department of Mathematics, Clarkson University, Potsdam, NY, USA and Department of Mechanical & Aerospace Engineering, Clarkson University, Potsdam, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2018,12,3]]},"reference":[{"key":"2020030521280642100_B1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"key":"2020030521280642100_B2","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1103\/RevModPhys.80.1275","article-title":"Critical phenomena in complex networks","volume":"80","author":"Dorogovtsev","year":"2008","journal-title":"Rev. Mod. Phys."},{"key":"2020030521280642100_B3","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199591756.001.0001","volume-title":"The Structure of Complex Networks: Theory and Applications.","author":"Estrada","year":"2011"},{"key":"2020030521280642100_B4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.physrep.2008.09.002","article-title":"Synchronization in complex networks","volume":"469","author":"Arenas","year":"2008","journal-title":"Phys. Rep."},{"key":"2020030521280642100_B5","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1103\/PhysRevLett.80.2109","article-title":"Master stability functions for synchronized coupled systems","volume":"80","author":"Pecora","year":"1998","journal-title":"Phys. Rev. Lett."},{"key":"2020030521280642100_B6","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"},{"key":"2020030521280642100_B7","doi-asserted-by":"crossref","first-page":"247901","DOI":"10.1103\/PhysRevLett.91.247901","article-title":"Efficient immunization strategies for computer networks and populations","volume":"91","author":"Cohen","year":"2003","journal-title":"Phys. Rev. Lett."},{"issue":"14","key":"2020030521280642100_B8","doi-asserted-by":"crossref","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","article-title":"Epidemic spreading in scale-free networks","volume":"86","author":"Pastor-Satorras","year":"2001","journal-title":"Phys. Rev. Lett."},{"key":"2020030521280642100_B9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0375-9601(02)00152-4","article-title":"A unified prediction of computer virus spread in connected networks","volume":"297","author":"Billings","year":"2002","journal-title":"Phys. Lett. A"},{"key":"2020030521280642100_B10","doi-asserted-by":"crossref","first-page":"035101","DOI":"10.1103\/PhysRevE.66.035101","article-title":"Email networks and the spread of computer viruses","volume":"66","author":"Newman","year":"2002","journal-title":"Phys. Rev. E"},{"key":"2020030521280642100_B11","doi-asserted-by":"crossref","first-page":"066117","DOI":"10.1103\/PhysRevE.63.066117","article-title":"Epidemic dynamics and endemic states in complex networks","volume":"63","author":"Pastor-Satorras","year":"2001","journal-title":"Phys. Rev. E"},{"key":"2020030521280642100_B12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TNET.2008.925623","article-title":"Virus spread in networks","volume":"17","author":"Van Mieghem","year":"2009","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"2020030521280642100_B13","doi-asserted-by":"crossref","unstructured":"Wang Y. , ChakrabartiD., WangC. & FaloutsosC. (2003) Epidemic spreading in real networks: an eigenvalue viewpoint. Proceedings of the 22nd IEEE Symposium on Reliable Distributed Systems (SRDS\u201903). pp. 25\u201334, https:\/\/ieeexplore.ieee.org\/document\/1238052.","DOI":"10.1109\/RELDIS.2003.1238052"},{"key":"2020030521280642100_B14","unstructured":"Xu S. , LuW. & XuL. (2012) Push- and pull-based epidemic spreading in networks: thresholds and deeper insights. ACM Trans. Auton. Adapt. Syst. (ACM TAAS), 7, 32, https:\/\/dl.acm.org\/citation.cfm?id=2746196https:\/\/dl.acm.org\/citation.cfm?id=2746196."},{"key":"2020030521280642100_B15","first-page":"2","article-title":"Active cyber defense dynamics exhibiting rich phenomena","author":"Zheng","year":"2015","journal-title":"Proceedings of the 2015 Symposium and Bootcamp on the Science of Security. ACM"},{"key":"2020030521280642100_B16","unstructured":"Nakamoto S. (2009) Bitcoin: a peer-to-peer electronic cash system. http:\/\/bitcoin.org\/bitcoin.pdf (last accessed 20April2018)."},{"key":"2020030521280642100_B17","unstructured":"Geer D. , BaceR., GutmannP., MetzgerP., PfleegerC. P., QuartermanJ. S. & SchneierB. (2003) CyberInsecurity: the cost of monopoly. http:\/\/cryptome.org\/cyberinsecurity.htm (last accessed 20 April 2018)."},{"key":"2020030521280642100_B18","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/971617.971650","article-title":"Risks of monoculture","volume":"47","author":"Stamp","year":"2004","journal-title":"Commun. ACM"},{"key":"2020030521280642100_B19","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/TSE.1985.231893","article-title":"The N-version approach to fault-tolerant software","volume":"11","author":"Avizienis","year":"1985","journal-title":"IEEE Trans. Softw. Eng."},{"key":"2020030521280642100_B20","doi-asserted-by":"crossref","unstructured":"Chen H. , ChoJ. & XuS. (2018) Quantifying the security effectiveness of network diversity: poster. Proceedings of the 5th Annual Symposium and Bootcamp on Hot Topics in the Science of Security (HoTSoS\u20192018). pp. 24:1, https:\/\/dl.acm.org\/citation.cfm?doid=3190619.3191680.","DOI":"10.1145\/3190619.3191680"},{"key":"2020030521280642100_B21","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1126\/science.1186605","article-title":"Network diversity and economic development","volume":"328","author":"Eagle","year":"2010","journal-title":"Science"},{"key":"2020030521280642100_B22","first-page":"11","article-title":"Graph colouring problems and their applications in scheduling","volume":"48","author":"Marx","journal-title":"Period. Polytech. Electr. Eng."},{"key":"2020030521280642100_B23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1158","article-title":"Frequency planning and ramifications of coloring","volume":"22","author":"Eisenbl\u00e4tter","year":"2002","journal-title":"Discuss. Math. Graph Theory"},{"key":"2020030521280642100_B24","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1145\/1583991.1584032","article-title":"Weak graph colorings: distributed algorithms and applications","volume-title":"Proceedings of the Twenty-first Annual Symposium on Parallelism in Algorithms and Architectures","author":"Kuhn","year":"2009"},{"key":"2020030521280642100_B25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/1030083.1030101","article-title":"On achieving software diversity for improved network security using distributed coloring algorithms","volume-title":"Proceedings of the 11th ACM Conference on Computer and Communications Security","author":"O\u2019Donnell","year":"2004"},{"key":"2020030521280642100_B26","unstructured":"Xu S. , LiX. & ParkerT. P. (2008) Exploiting social networks for threshold signing: attack-resilience vs. availability. Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2008, Tokyo, Japan, March 18\u201320, 2008. pp. 325\u2013336, https:\/\/dl.acm.org\/citation.cfm?doid=1368310.1368358https:\/\/dl.acm.org\/citation.cfm?doid=1368310.1368358."},{"key":"2020030521280642100_B27","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TIFS.2010.2093521","article-title":"Exploiting trust-based social networks for distributed protection of sensitive data","volume":"6","author":"Xu","year":"2011","journal-title":"IEEE Trans. Inf. Forensic. Secur."},{"key":"2020030521280642100_B28","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/TNSE.2017.2734904","article-title":"Preventive and reactive cyber defense dynamics is globally stable","volume":"5","author":"Zheng","year":"2018","journal-title":"IEEE Trans. Network Sci. Eng."},{"key":"2020030521280642100_B29","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1103\/RevModPhys.54.235","article-title":"The Potts model","volume":"54","author":"Wu","year":"1982","journal-title":"Rev. Mod. Phys."},{"key":"2020030521280642100_B30","doi-asserted-by":"crossref","first-page":"7059","DOI":"10.1103\/PhysRevE.62.7059","article-title":"Exact solution of site and bond percolation on small-world networks","volume":"62","author":"Moore","year":"2000","journal-title":"Phys. Rev. E"},{"key":"2020030521280642100_B31","first-page":"17","volume-title":"On the Evolution of Random Graphs","author":"Erdos","year":"1960"},{"key":"2020030521280642100_B32","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","article-title":"The asymptotic number of labeled graphs with given degree sequences","volume":"24","author":"Bender","year":"1978","journal-title":"J. Combin. Theor. A"},{"key":"2020030521280642100_B33","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollob\u00e1s","year":"1980","journal-title":"Eur. J. Comb."},{"key":"2020030521280642100_B34","doi-asserted-by":"crossref","first-page":"065103(R)","DOI":"10.1103\/PhysRevE.68.065103","article-title":"Self-similar community structure in a network of human interactions.","volume":"68","author":"Guimera","year":"2003","journal-title":"Phys. Rev. E"},{"key":"2020030521280642100_B35","first-page":"041044","article-title":"Sensitive dependence of optimal network dynamics on network structure","volume":"7","author":"Nishikawa","year":"2017","journal-title":"Phys. Rev. X"},{"key":"2020030521280642100_B36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-02009-4","volume-title":"Distributed Graph Coloring: Fundamentals and Recent Developments","author":"Barenboim","year":"2013"},{"key":"2020030521280642100_B37","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s00446-012-0167-7","article-title":"Distributed deterministic edge coloring using bounded neighborhood independence","volume":"26","author":"Barenboim","year":"2013","journal-title":"Distributed Computing"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/7\/4\/554\/29161024\/cny031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/7\/4\/554\/29161024\/cny031.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T03:26:37Z","timestamp":1662434797000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/7\/4\/554\/5229540"}},"subtitle":[],"editor":[{"given":"Ernesto","family":"Estrada","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,12,3]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cny031","relation":{},"ISSN":["2051-1329"],"issn-type":[{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2019,8]]},"published":{"date-parts":[[2018,12,3]]}}}