{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:05:00Z","timestamp":1778717100782,"version":"3.51.4"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1016\/j.future.2019.05.071","type":"journal-article","created":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T13:22:01Z","timestamp":1559568121000},"page":"994-1004","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["A simple and generic paradigm for creating complex networks using the strategy of vertex selecting-and-pairing"],"prefix":"10.1016","volume":"100","author":[{"given":"Shuangyan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Cuomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.future.2019.05.071_b1","doi-asserted-by":"crossref","unstructured":"F. Amato, V. Moscato, A. Picariello, F. Piccialli, G. Sperli, Centrality in heterogeneous social networks for lurkers detection: An approach based on hypergraphs, Concurr. Comput. Prac. Exper. 30. https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1002\/cpe.4188.","DOI":"10.1002\/cpe.4188"},{"key":"10.1016\/j.future.2019.05.071_b2","series-title":"Cultural Heritage and Social Pulse: A Semantic Approach for CH Sensitivity Discovery in Social Media Data","first-page":"459","author":"Chianese","year":"2016"},{"issue":"4","key":"10.1016\/j.future.2019.05.071_b3","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s11036-016-0803-8","article-title":"Understanding customer experience diffusion on social networking services by big data analytics","volume":"22","author":"Piccialli","year":"2017","journal-title":"Mob. Netw. Appl."},{"key":"10.1016\/j.future.2019.05.071_b4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.eswa.2017.02.034","article-title":"IoT-based collaborative reputation system for associating visitors and artworks in a cultural scenario","volume":"79","author":"Cuomo","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.future.2019.05.071_b5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.jpdc.2017.06.020","article-title":"Reproducing dynamics related to an Internet of Things framework: A numerical and statistical approach","volume":"118","author":"Cuomo","year":"2018","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.future.2019.05.071_b6","first-page":"154","article-title":"Validation approaches for a biological model generation describing visitor behaviours in a cultural heritage scenario","volume":"178","author":"Cuomo","year":"2015","journal-title":"Commun. Comput. Inf. Sci."},{"key":"10.1016\/j.future.2019.05.071_b7","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.procs.2017.08.315","article-title":"Remarks on a computational estimator for the barrier option pricing in an IoT scenario","volume":"113","author":"Cuomo","year":"2017","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"10.1016\/j.future.2019.05.071_b8","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/s11036-017-0810-4","article-title":"The Internet of Things supporting context-aware computing: A cultural heritage case study","volume":"22","author":"Piccialli","year":"2017","journal-title":"Mob. Netw. Appl."},{"issue":"1","key":"10.1016\/j.future.2019.05.071_b9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Modern Phys."},{"issue":"5439","key":"10.1016\/j.future.2019.05.071_b10","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"issue":"4\u20135","key":"10.1016\/j.future.2019.05.071_b11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","article-title":"Complex networks: Structure and dynamics","volume":"424","author":"Boccaletti","year":"2006","journal-title":"Phys. Rep."},{"issue":"2","key":"10.1016\/j.future.2019.05.071_b12","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":"10.1016\/j.future.2019.05.071_b13","doi-asserted-by":"crossref","unstructured":"G. De\u00a0Masi, G. Iori, G. Caldarelli, Fitness model for the Italian interbank money market, Phys. Rev. E 74 (6, 2). https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1103\/PhysRevE.74.066112.","DOI":"10.1103\/PhysRevE.74.066112"},{"issue":"1","key":"10.1016\/j.future.2019.05.071_b14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.physa.2006.11.093","article-title":"The topology of interbank payment flows","volume":"379","author":"Soramaki","year":"2007","journal-title":"Physica A"},{"issue":"1","key":"10.1016\/j.future.2019.05.071_b15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1207\/s15516709cog2901_3","article-title":"The large-scale structure of semantic networks: Statistical analyses and a model of semantic growth","volume":"29","author":"Steyvers","year":"2005","journal-title":"Cogn. Sci."},{"issue":"7711","key":"10.1016\/j.future.2019.05.071_b16","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1038\/d41586-018-05444-y","article-title":"Twenty years of network science","volume":"558","author":"Vespignani","year":"2018","journal-title":"Nature"},{"issue":"20","key":"10.1016\/j.future.2019.05.071_b17","doi-asserted-by":"crossref","first-page":"12917","DOI":"10.1073\/pnas.192407699","article-title":"Food-web structure and network theory: The role of connectance and size","volume":"99","author":"Dunne","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"2","key":"10.1016\/j.future.2019.05.071_b18","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1103\/RevModPhys.81.591","article-title":"Statistical physics of social dynamics","volume":"81","author":"Castellano","year":"2009","journal-title":"Rev. Modern Phys."},{"issue":"1482","key":"10.1016\/j.future.2019.05.071_b19","doi-asserted-by":"crossref","first-page":"2261","DOI":"10.1098\/rspb.2001.1800","article-title":"The small world of human language","volume":"268","author":"Cancho","year":"2001","journal-title":"Proc. R. Soc. Lond. [Biol.]"},{"issue":"17","key":"10.1016\/j.future.2019.05.071_b20","doi-asserted-by":"crossref","first-page":"4483","DOI":"10.1088\/1751-8113\/40\/17\/006","article-title":"Synchronizability of complex networks","volume":"40","author":"Comellas","year":"2007","journal-title":"J. Phys. A"},{"key":"10.1016\/j.future.2019.05.071_b21","doi-asserted-by":"crossref","unstructured":"X. Wang, E. Pournaras, R.E. Kooij, P. Van\u00a0Mieghem, Improving robustness of complex networks via the effective graph resistance, Eur. Phys. J. B 87 (9) https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1140\/epjb\/e2014-50276-0.","DOI":"10.1140\/epjb\/e2014-50276-0"},{"key":"10.1016\/j.future.2019.05.071_b22","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.future.2018.08.047","article-title":"Efficient method for identifying influential vertices in dynamic networks using the strategy of local detection and updating","volume":"91","author":"Wang","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"issue":"21","key":"10.1016\/j.future.2019.05.071_b23","doi-asserted-by":"crossref","first-page":"4629","DOI":"10.1103\/PhysRevLett.85.4629","article-title":"Connectivity of growing random networks","volume":"85","author":"Krapivsky","year":"2000","journal-title":"Phys. Rev. Lett."},{"issue":"3\u20134","key":"10.1016\/j.future.2019.05.071_b24","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.physa.2004.01.056","article-title":"Generation models for scale-free networks","volume":"338","author":"Dangalchev","year":"2004","journal-title":"Physica A"},{"key":"10.1016\/j.future.2019.05.071_b25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physd.2018.01.005","article-title":"Scale-free behavior of networks with the copresence of preferential and uniform attachment rules","volume":"371","author":"Pachon","year":"2018","journal-title":"Physica D"},{"issue":"2","key":"10.1016\/j.future.2019.05.071_b26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0022-5193(03)00028-6","article-title":"Evolving protein interaction networks through gene duplication","volume":"222","author":"Pastor-Satorras","year":"2003","journal-title":"J. Theoret. Biol."},{"issue":"3","key":"10.1016\/j.future.2019.05.071_b27","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.biosystems.2009.06.006","article-title":"On the evolution of scale-free topologies with a gene regulatory network model","volume":"98","author":"Nicolau","year":"2009","journal-title":"Biosystems"},{"issue":"6684","key":"10.1016\/j.future.2019.05.071_b28","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"issue":"1","key":"10.1016\/j.future.2019.05.071_b29","doi-asserted-by":"crossref","first-page":"2566","DOI":"10.1073\/pnas.012582999","article-title":"Random graph models of social networks","volume":"99","author":"Newman","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.future.2019.05.071_b30","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.jocs.2017.05.029","article-title":"Detecting users\u2019 anomalous emotion using social media for business intelligence","volume":"25","author":"Sun","year":"2018","journal-title":"J. Comput. Sci."},{"issue":"12","key":"10.1016\/j.future.2019.05.071_b31","first-page":"1714","article-title":"Top-down behavior planning for real-life simulation","volume":"10","author":"Wei","year":"2007","journal-title":"J. Korea Multimed. Soc."},{"key":"10.1016\/j.future.2019.05.071_b32","doi-asserted-by":"crossref","unstructured":"H. Yin, A.R. Benson, J. Leskovec, D.F. Gleich, Local higher-order graph clustering, in: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2017, pp. 555\u2013564. https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/3097983.3098069.","DOI":"10.1145\/3097983.3098069"},{"key":"10.1016\/j.future.2019.05.071_b33","doi-asserted-by":"crossref","unstructured":"J. Leskovec, J. Kleinberg, C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Trans. Knowl. Discov. Data 1 (1). https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/1217299.1217301.","DOI":"10.1145\/1217299.1217301"},{"key":"10.1016\/j.future.2019.05.071_b34","series-title":"Anylogic Software","author":"Company","year":"2019"},{"key":"10.1016\/j.future.2019.05.071_b35","doi-asserted-by":"crossref","unstructured":"M. Newman, Oxford University Press, 2010. https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1093\/acprof:oso\/9780199206650.001.0001.","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X19304960?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X19304960?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T04:15:50Z","timestamp":1759119350000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X19304960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":35,"alternative-id":["S0167739X19304960"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2019.05.071","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A simple and generic paradigm for creating complex networks using the strategy of vertex selecting-and-pairing","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2019.05.071","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}