A Novel Ranking Scheme for Identifying Influential Nodes in Complex Networks

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

Abstract Identifying influential nodes in complex networks, such as social networks, is crucial in many applications including information dissemination, virus protection , community detection, etc., and many methods have been proposed for identifying influential nodes. Most existing methods only consider one single attribute of nodes, which for some applications may not be sufficient, and can lead to low resolution among nodes. In this paper, we propose a novel method for identifying influential nodes−CI-based gravity model (CIGM)−which integrates the integrated degree and I-shell to evaluate the impact of nodes in an all-around manner. It aims at offering a more comprehensive measure of the node’s influence than the known methods. We conducted comparison experiments for CIGM against ten baseline methods using twelve real-world datasets, in terms of the SIR model, the Kendall’s correlation coefficient, CCDF and monotonicity index. The experimental results on twelve real-world networks show that CIGM not only identifies influential nodes effectively but also captures nodes of strategic importance, those that help enhance performance in information dissemination and network connectivity, suggesting that CIGM holds advantageousness and broader applicability over the existing schemes.
Full text 17,194 characters · extracted from preprint-html · click to expand
A Novel Ranking Scheme for Identifying Influential Nodes in Complex Networks | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A Novel Ranking Scheme for Identifying Influential Nodes in Complex Networks Qing Yang, Jiafei Liu, Dajin Wang, Jingli Wu, Gaoshi Li This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7734731/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 31 You are reading this latest preprint version Abstract Identifying influential nodes in complex networks, such as social networks, is crucial in many applications including information dissemination, virus protection , community detection, etc., and many methods have been proposed for identifying influential nodes. Most existing methods only consider one single attribute of nodes, which for some applications may not be sufficient, and can lead to low resolution among nodes. In this paper, we propose a novel method for identifying influential nodes−CI-based gravity model (CIGM)−which integrates the integrated degree and I-shell to evaluate the impact of nodes in an all-around manner. It aims at offering a more comprehensive measure of the node’s influence than the known methods. We conducted comparison experiments for CIGM against ten baseline methods using twelve real-world datasets, in terms of the SIR model, the Kendall’s correlation coefficient, CCDF and monotonicity index. The experimental results on twelve real-world networks show that CIGM not only identifies influential nodes effectively but also captures nodes of strategic importance, those that help enhance performance in information dissemination and network connectivity, suggesting that CIGM holds advantageousness and broader applicability over the existing schemes. Complex networks Influential nodes Integrated degree I-shell Susceptible-Infected-Recovered model Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 24 Oct, 2025 Reviews received at journal 23 Oct, 2025 Reviews received at journal 21 Oct, 2025 Reviews received at journal 21 Oct, 2025 Reviews received at journal 19 Oct, 2025 Reviewers agreed at journal 19 Oct, 2025 Reviewers agreed at journal 19 Oct, 2025 Reviewers agreed at journal 15 Oct, 2025 Reviewers agreed at journal 13 Oct, 2025 Reviewers agreed at journal 13 Oct, 2025 Reviewers agreed at journal 12 Oct, 2025 Reviews received at journal 11 Oct, 2025 Reviewers agreed at journal 11 Oct, 2025 Reviewers agreed at journal 11 Oct, 2025 Reviewers agreed at journal 11 Oct, 2025 Reviewers agreed at journal 11 Oct, 2025 Reviewers agreed at journal 11 Oct, 2025 Reviewers agreed at journal 11 Oct, 2025 Reviewers agreed at journal 10 Oct, 2025 Reviewers agreed at journal 10 Oct, 2025 Reviewers agreed at journal 10 Oct, 2025 Reviewers agreed at journal 10 Oct, 2025 Reviewers agreed at journal 10 Oct, 2025 Reviewers agreed at journal 09 Oct, 2025 Reviewers agreed at journal 09 Oct, 2025 Reviewers agreed at journal 09 Oct, 2025 Reviewers agreed at journal 09 Oct, 2025 Reviewers invited by journal 09 Oct, 2025 Editor assigned by journal 09 Oct, 2025 Submission checks completed at journal 29 Sep, 2025 First submitted to journal 28 Sep, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7734731","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":533105458,"identity":"7f4ccbf4-daab-4623-be79-a64fce296c97","order_by":0,"name":"Qing Yang","email":"","orcid":"","institution":"Guangxi Normal University","correspondingAuthor":false,"prefix":"","firstName":"Qing","middleName":"","lastName":"Yang","suffix":""},{"id":533105459,"identity":"9589b9cb-9626-48ae-ac01-15cc5fa502bc","order_by":1,"name":"Jiafei Liu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA5UlEQVRIie2OsQrCMBCGTwrpEuvaEmhf4UpWHybBtUNFcBIUhLg527dwclYKdhFH6VgR9AEEcRCxpbo2joL54PjhuI//AAyGH8SxAFCAD8SevFdrjUJqhQOhn1OtUgcHcMW3ik0xLkboO97lwPoKfCcXrWvc+BhFFFvkhEUDnijgXi4sttAq5CEVi+SprUAuc1EutcoTx8rbibRUxt8pUpVFrr2pWgTqFRKjnGOoaGRxunfDZHecsial00lX4f2GQTDLzowOu4GT9TbXJqUqwjpplW45rUmzAGAVddqF7tJgMBj+lBeNeD6oMxxx3wAAAABJRU5ErkJggg==","orcid":"","institution":"Guangxi Normal University","correspondingAuthor":true,"prefix":"","firstName":"Jiafei","middleName":"","lastName":"Liu","suffix":""},{"id":533105460,"identity":"c07c5fd8-2848-4f34-b2a7-f4a32fa57393","order_by":2,"name":"Dajin Wang","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Dajin","middleName":"","lastName":"Wang","suffix":""},{"id":533105461,"identity":"06f2747b-a199-481b-89b4-4b18fa69235a","order_by":3,"name":"Jingli Wu","email":"","orcid":"","institution":"Guangxi Normal University","correspondingAuthor":false,"prefix":"","firstName":"Jingli","middleName":"","lastName":"Wu","suffix":""},{"id":533105463,"identity":"8e23c15d-7265-46ac-b8a5-b4f57f81e894","order_by":4,"name":"Gaoshi Li","email":"","orcid":"","institution":"Guangxi Normal University","correspondingAuthor":false,"prefix":"","firstName":"Gaoshi","middleName":"","lastName":"Li","suffix":""}],"badges":[],"createdAt":"2025-09-28 13:38:25","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7734731/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7734731/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":94230379,"identity":"09b67b4c-ab6c-4097-b36f-cb5c72a7e1d9","added_by":"auto","created_at":"2025-10-23 21:57:00","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":4321441,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7734731/v1/85f9df6084337494c27ff2bf.pdf"},{"id":94230378,"identity":"2a214b15-df35-41ac-80c9-bf7237b7329f","added_by":"auto","created_at":"2025-10-23 21:57:00","extension":"json","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":6240,"visible":true,"origin":"","legend":"","description":"","filename":"2a424141e16c4b039f491c03e93d5ea7.json","url":"https://assets-eu.researchsquare.com/files/rs-7734731/v1/bb89bb2f7f410daaaca60625.json"},{"id":94230418,"identity":"fe834e38-2263-40aa-841a-869416deb0ba","added_by":"auto","created_at":"2025-10-23 22:05:05","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":4285687,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7734731/v1_covered_06dbfa56-5209-4068-9dad-63f30fbd3e2f.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A Novel Ranking Scheme for Identifying Influential Nodes in Complex Networks","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Complex networks, Influential nodes, Integrated degree, I-shell, Susceptible-Infected-Recovered model","lastPublishedDoi":"10.21203/rs.3.rs-7734731/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7734731/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Identifying influential nodes in complex networks, such as social networks, is crucial in many applications including information dissemination, virus protection , community detection, etc., and many methods have been proposed for identifying influential nodes. Most existing methods only consider one single attribute of nodes, which for some applications may not be sufficient, and can lead to low resolution among nodes. In this paper, we propose a novel method for identifying influential nodes−CI-based gravity model (CIGM)−which integrates the integrated degree and I-shell to evaluate the impact of nodes in an all-around manner. It aims at offering a more comprehensive measure of the node’s influence than the known methods. We conducted comparison experiments for CIGM against ten baseline methods using twelve real-world datasets, in terms of the SIR model, the Kendall’s correlation coefficient, CCDF and monotonicity index. The experimental results on twelve real-world networks show that CIGM not only identifies influential nodes effectively but also captures nodes of strategic importance, those that help enhance performance in information dissemination and network connectivity, suggesting that CIGM holds advantageousness and broader applicability over the existing schemes.","manuscriptTitle":"A Novel Ranking Scheme for Identifying Influential Nodes in Complex Networks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-10-23 21:56:55","doi":"10.21203/rs.3.rs-7734731/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-10-24T16:45:47+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-23T16:37:06+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-22T03:06:34+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-21T07:39:31+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-19T08:41:16+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"193420220914079761678332532275091363178","date":"2025-10-19T06:06:57+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"335451284314848161456238947170284647560","date":"2025-10-19T05:13:08+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"275696686997919444522198225843975292698","date":"2025-10-16T02:28:12+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"337095899677073177776488912769488375036","date":"2025-10-14T00:26:28+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"265770327653195754921540165972290990325","date":"2025-10-13T14:30:44+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"139190987596403228269422496387826197696","date":"2025-10-13T02:49:33+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-12T02:40:52+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"251344139300894797559110057902994470722","date":"2025-10-12T02:03:03+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"37782586169006062047924211355960686588","date":"2025-10-12T01:39:16+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"216968856760852384240430617481042936275","date":"2025-10-11T23:39:05+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"224297247884274534024105747435925625718","date":"2025-10-11T23:17:51+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"240158628600588807080647133239974204236","date":"2025-10-11T06:17:41+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"84636825476876279217190147982093563744","date":"2025-10-11T05:41:52+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"80315639558395243990996187186598810065","date":"2025-10-10T19:59:09+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"185351471860474522405268795922845657132","date":"2025-10-10T19:25:46+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"47466789813590557188545316424512353712","date":"2025-10-10T19:05:14+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"55774071238905275604366109119034896984","date":"2025-10-10T07:27:30+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"186230614412396861088465261953252207934","date":"2025-10-10T07:15:18+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"32281259087436289676495549920694285540","date":"2025-10-10T03:05:43+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"171671161013726270932989052979310699660","date":"2025-10-10T02:06:26+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"79835642565099517157881227356653475603","date":"2025-10-09T22:53:54+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"298779726928164587494707027567201102794","date":"2025-10-09T21:57:26+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-10-09T21:18:03+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-10-09T18:36:01+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-09-29T11:16:40+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Journal of Supercomputing","date":"2025-09-28T13:31:46+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"223042e1-3990-4630-9b97-203064aa3a2d","owner":[],"postedDate":"October 23rd, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2025-12-01T11:53:42+00:00","versionOfRecord":[],"versionCreatedAt":"2025-10-23 21:56:55","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7734731","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7734731","identity":"rs-7734731","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-29T02:00:03.542394+00:00
License: CC-BY-4.0