An Improved Algorithm Based on Game Theory to Detecting Overlapping Community

An Improved Algorithm Based on Game Theory to Detecting Overlapping Community | 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 Method Article An Improved Algorithm Based on Game Theory to Detecting Overlapping Community WanTing Mei, Sheng Zhang, Rui Liu This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-1576190/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Aiming at the problem that the community discovery algorithms based on game theory have the disadvantage of node update strategy sequence and the complexity of node strategy space, an improved algorithm for overlapping community discovery based on game theory is proposed, which regards the formation of communities as the game of nodes in the network. First, get the initial community of the node through a label propagation algorithm, and get the set of bridge nodes; then, sort these nodes from large to small according to the aggregation of the nodes, choose to join the community, convert the community, and leave the community strategy to improve own profit; when all nodes participating in the game cannot increase their profit by changing strategies, the algorithm ends; finally, experiments and analysis on artificially generated networks and real-world networks have proved the feasibility of the algorithm, and it is comparable to other similar compared with the algorithm, the algorithm proposed in this paper effectively reduces the running time and improves the accuracy. Game theory Strategy Payoff function Overlapping community discovery Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted 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-1576190","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Method Article","associatedPublications":[],"authors":[{"id":100522369,"identity":"c1861b3d-e04a-4ddd-9e9e-cff887fabbff","order_by":0,"name":"WanTing Mei","email":"","orcid":"","institution":"Nanchang Hangkong University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"WanTing","middleName":"","lastName":"Mei","suffix":""},{"id":100522370,"identity":"d94b24f4-b884-4c2c-810c-1b8efa38ce26","order_by":1,"name":"Sheng Zhang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAwElEQVRIiWNgGAWjYNACAxs5fmbmgw9I0FKQZizZzpZsQIKWD4cSN5znMRMgSrH8jBzjjz8MDhgbH2YwY2CosYkmqIVxRlqCMY/BHTmzwwxpDxiOpeU2ENLCLJ18IJnB4JkxUMtxA8aGw4S1sEknNhz8YXA4cXMzY5sEUVp4pJMPNvAAtWxgZmYjTouE/LNkZh6DNGOJw2zMBgnE+EW+5wwwxP4Ao7L//McHH2psCGtBBQmkKR8Fo2AUjIJRgAsAAOnuPHxZhLNZAAAAAElFTkSuQmCC","orcid":"","institution":"Nanchang Hangkong University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Sheng","middleName":"","lastName":"Zhang","suffix":""},{"id":100522371,"identity":"a7e822da-d57f-44ae-88bc-9bbf9f1d1018","order_by":2,"name":"Rui Liu","email":"","orcid":"","institution":"Nanchang Hangkong University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Rui","middleName":"","lastName":"Liu","suffix":""}],"badges":[],"createdAt":"2022-04-20 11:14:17","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-1576190/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-1576190/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":20748327,"identity":"0f035e3a-b3c4-4f4d-af0f-9f90576aedc8","added_by":"auto","created_at":"2022-04-25 21:36:57","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":2285646,"visible":true,"origin":"","legend":"","description":"","filename":"AnImprovedAlgorithmBasedonGameTheorytoDetectingOverlappingCommunity.pdf","url":"https://assets-eu.researchsquare.com/files/rs-1576190/v1_covered.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"An Improved Algorithm Based on Game Theory to Detecting Overlapping Community","fulltext":[{"header":"Full Text","content":"This preprint is available for \u003ca href='/article/rs-1576190/latest.pdf' target='_blank'\u003edownload as a PDF\u003c/a\u003e."}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Game theory, Strategy, Payoff function, Overlapping community discovery","lastPublishedDoi":"10.21203/rs.3.rs-1576190/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-1576190/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Aiming at the problem that the community discovery algorithms based on game theory have the disadvantage of node update strategy sequence and the complexity of node strategy space, an improved algorithm for overlapping community discovery based on game theory is proposed, which regards the formation of communities as the game of nodes in the network. First, get the initial community of the node through a label propagation algorithm, and get the set of bridge nodes; then, sort these nodes from large to small according to the aggregation of the nodes, choose to join the community, convert the community, and leave the community strategy to improve own profit; when all nodes participating in the game cannot increase their profit by changing strategies, the algorithm ends; finally, experiments and analysis on artificially generated networks and real-world networks have proved the feasibility of the algorithm, and it is comparable to other similar compared with the algorithm, the algorithm proposed in this paper effectively reduces the running time and improves the accuracy.","manuscriptTitle":"An Improved Algorithm Based on Game Theory to Detecting Overlapping Community","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2022-04-25 21:36:42","doi":"10.21203/rs.3.rs-1576190/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"4f7bd70c-f342-4bc1-9688-bb4faa0dccd7","owner":[],"postedDate":"April 25th, 2022","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2022-04-25T21:36:43+00:00","versionOfRecord":[],"versionCreatedAt":"2022-04-25 21:36:42","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-1576190","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-1576190","identity":"rs-1576190","version":["v1"]},"buildId":"cBFmMYwuxLRRLfASyISRj","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}