Exploring Influential nodes Using Global and Local Information

Exploring Influential nodes Using Global and Local Information | 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 Article Exploring Influential nodes Using Global and Local Information Haifeng Hu, Zejun Sun, Feifei Wang, Liwen Zhang, Guan Wang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-2199249/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 29 Dec, 2022 Read the published version in Scientific Reports → Version 1 posted 8 You are reading this latest preprint version Abstract In complex networks, key nodes are important factors affecting the network structure and function. Accurate mining and identifying key nodes can help people better control and utilize complex networks. In this paper, We report an accurate and efficient algorithm for critical node mining, Exploring Influential Nodes Using Global and Local Information (GLI), for the existing key node identification method that only considers local information or local information. The method of node influence includes two parts: global influence and local influence. Global influence is determined by the K-shell hierarchical information of the node. Local influence is determined jointly by the number of edges connected by the node, and the given values of the adjacent nodes. where the given values of the adjacent nodes is determined by the degree and K-shell hierarchical information. while introducing the similarity coefficient of neighbors. The proposed method solves the problems of high global algorithm complexity and low accuracy of local algorithms. The simulation experiment takes the SIR model as the reference, ten typical network models were selected as datasets, Comparing the GLI algorithm to typical algorithms at different periods, The results show that GLI effectively solves the problems of high complexity of global algorithm and low accuracy of local algorithm. Physical sciences/Mathematics and computing/Computational science Physical sciences/Mathematics and computing/Computer science Complex network Local Information Global Information Exploring Influential Nodes Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 29 Dec, 2022 Read the published version in Scientific Reports → Version 1 posted Editorial decision: Major revision 18 Nov, 2022 Reviews received at journal 11 Nov, 2022 Reviewers agreed at journal 07 Nov, 2022 Reviewers invited by journal 07 Nov, 2022 Editor assigned by journal 07 Nov, 2022 Editor invited by journal 04 Nov, 2022 Submission checks completed at journal 04 Nov, 2022 First submitted to journal 24 Oct, 2022 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-2199249","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":149546085,"identity":"31401325-277c-4da0-8504-e9e10f91c73e","order_by":0,"name":"Haifeng Hu","email":"","orcid":"","institution":"Pingdingshan University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Haifeng","middleName":"","lastName":"Hu","suffix":""},{"id":149546086,"identity":"e03890fa-31da-4dbb-9bb1-6fd6c26b8fdc","order_by":1,"name":"Zejun Sun","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAtklEQVRIiWNgGAWjYHCCxAcMbGCGAdFakg1I1sImQZoW+f4Dz6oLyuoSG9ibt0kw1NwhrMXgwIG02zPOHU5s4DlWJsFw7BkRWhgb0m7zth1IbJDIMZNgbDhMhMOaGdKKeduADpN/Q6QWhmMMacy8bcxAW3iI1GJwhiFZGugX4zaetGKLhGPEOKz/TOJnYIjJ9rMf3njjQw0xDmPgSWAGUeCoSSBGAwMD+wFm4hSOglEwCkbBiAUAPns2YyVdTHgAAAAASUVORK5CYII=","orcid":"","institution":"Pingdingshan University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Zejun","middleName":"","lastName":"Sun","suffix":""},{"id":149546087,"identity":"588d2145-e257-4e4a-bc1d-17bc1be6194d","order_by":2,"name":"Feifei Wang","email":"","orcid":"","institution":"Pingdingshan University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Feifei","middleName":"","lastName":"Wang","suffix":""},{"id":149546088,"identity":"67df4220-bf59-4cc7-a9c7-84a2d783ae97","order_by":3,"name":"Liwen Zhang","email":"","orcid":"","institution":"Pingdingshan University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Liwen","middleName":"","lastName":"Zhang","suffix":""},{"id":149546089,"identity":"7f93424b-2500-4856-81f1-5bb3fd3f30d6","order_by":4,"name":"Guan Wang","email":"","orcid":"","institution":"Pingdingshan University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Guan","middleName":"","lastName":"Wang","suffix":""}],"badges":[],"createdAt":"2022-10-24 15:14:28","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-2199249/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-2199249/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1038/s41598-022-26984-4","type":"published","date":"2022-12-29T18:07:38+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":28797440,"identity":"5f9c7f0b-5608-483f-877a-8a733122ea67","added_by":"auto","created_at":"2022-11-08 11:12:42","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":87976,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-2199249/v1/be59d8ec-2d16-4b6e-9bd6-7d7a1eef8c91.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Exploring Influential nodes Using Global and Local Information","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":false,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Complex network, Local Information, Global Information, Exploring Influential Nodes","lastPublishedDoi":"10.21203/rs.3.rs-2199249/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-2199249/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eIn complex networks, key nodes are important factors affecting the network structure and function. Accurate mining and identifying key nodes can help people better control and utilize complex networks. In this paper, We report an accurate and efficient algorithm for critical node mining, Exploring Influential Nodes Using Global and Local Information (GLI), for the existing key node identification method that only considers local information or local information. The method of node influence includes two parts: global influence and local influence. Global influence is determined by the K-shell hierarchical information of the node. Local influence is determined jointly by the number of edges connected by the node, and the given values of the adjacent nodes. where the given values of the adjacent nodes is determined by the degree and K-shell hierarchical information. while introducing the similarity coefficient of neighbors. The proposed method solves the problems of high global algorithm complexity and low accuracy of local algorithms. The simulation experiment takes the SIR model as the reference, ten typical network models were selected as datasets, Comparing the GLI algorithm to typical algorithms at different periods, The results show that GLI effectively solves the problems of high complexity of global algorithm and low accuracy of local algorithm.\u003c/p\u003e","manuscriptTitle":"Exploring Influential nodes Using Global and Local Information","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2022-11-08 11:12:29","doi":"10.21203/rs.3.rs-2199249/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Major revision","date":"2022-11-18T07:30:57+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2022-11-11T21:01:23+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"7d868f43-2072-4718-ac1b-9b7dadf661e4","date":"2022-11-07T20:33:42+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2022-11-07T17:20:12+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2022-11-07T15:24:23+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2022-11-04T15:15:21+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2022-11-04T14:20:02+00:00","index":"","fulltext":""},{"type":"submitted","content":"Scientific Reports","date":"2022-10-24T15:06:40+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"6c79438d-0ab3-4928-ad6d-b78a203c249e","owner":[],"postedDate":"November 8th, 2022","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":16731777,"name":"Physical sciences/Mathematics and computing/Computational science"},{"id":16731778,"name":"Physical sciences/Mathematics and computing/Computer science"}],"tags":[],"updatedAt":"2023-10-16T18:13:05+00:00","versionOfRecord":{"articleIdentity":"rs-2199249","link":"https://doi.org/10.1038/s41598-022-26984-4","journal":{"identity":"scientific-reports","isVorOnly":false,"title":"Scientific Reports"},"publishedOn":"2022-12-29 18:07:38","publishedOnDateReadable":"December 29th, 2022"},"versionCreatedAt":"2022-11-08 11:12:29","video":"","vorDoi":"10.1038/s41598-022-26984-4","vorDoiUrl":"https://doi.org/10.1038/s41598-022-26984-4","workflowStages":[]},"version":"v1","identity":"rs-2199249","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-2199249","identity":"rs-2199249","version":["v1"]},"buildId":"rHA-KDH7Qsr4HCuvH75dn","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}