Distributed Graph Generation Using JDM Replication

Distributed Graph Generation Using JDM Replication | 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 Distributed Graph Generation Using JDM Replication Furkan Atas, Mehmet Burak Akgun This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6340411/v1 This work is licensed under a CC BY 4.0 License Status: Under Revision Version 1 posted 8 You are reading this latest preprint version Abstract Graph substructures play a critical role in defining network characteristics, making it essential for graph generators to accurately replicate these substructures to produce realistic graphs. However, the increasing rate of data in networks poses significant challenges for graph generation. To address this, a novel distributed algorithm is proposed, which employs JDM (Joint Degree Matrix) replication across distributed servers. This approach utilizes the vertex cut partitioning across multiple commodity computers. Experiments are conducted to evaluate the algorithm's runtime performance, demonstrating its effectiveness in handling large-scale networks while preserving realistic substructures. The results highlight the potential of this method to meet the growing demands of scalable and efficient graph generation. distributed computation graph generation joint degree matrix dk series Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Revision Version 1 posted Editorial decision: Revision requested 14 Oct, 2025 Reviews received at journal 05 Oct, 2025 Reviewers agreed at journal 20 Sep, 2025 Reviewers agreed at journal 28 Apr, 2025 Reviewers invited by journal 25 Apr, 2025 Editor assigned by journal 04 Apr, 2025 Submission checks completed at journal 04 Apr, 2025 First submitted to journal 30 Mar, 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-6340411","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":449131339,"identity":"9cb0e0b0-b897-4524-b9bd-be7043217aa2","order_by":0,"name":"Furkan Atas","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA40lEQVRIiWNgGAWjYBAC9gYGZiiT+QCEPkBAC88BiBYJBga2BIjqAwyMDURq4TEgUotE7mODnzvs6vj7z3x8/LGNQY7vRgL74wq8WtKNE3vPJEtI3MjdbHCwjcFY8kYCY+MZPFrsJdKYD/C2MUsw3ODdJgHUkrgBpAWfy3iAWg7+bauXkD9/5vkPoJZ6orQk87YdljA4kMPGANSSYEBQC88zZmPZtuOSG2+kGUucOSdhOPPMw8aZeLWwpzFLvm2r5pc7f/jhh4oyG3m+48kHPuLTgg6A8UMgWkbBKBgFo2AUEAEAi/hPX+z3M+kAAAAASUVORK5CYII=","orcid":"","institution":"TOBB University of Economics and Technology","correspondingAuthor":true,"prefix":"","firstName":"Furkan","middleName":"","lastName":"Atas","suffix":""},{"id":449131341,"identity":"7535c103-6003-430e-82a2-475a9b973eb0","order_by":1,"name":"Mehmet Burak Akgun","email":"","orcid":"","institution":"TOBB University of Economics and Technology","correspondingAuthor":false,"prefix":"","firstName":"Mehmet","middleName":"Burak","lastName":"Akgun","suffix":""}],"badges":[],"createdAt":"2025-03-30 22:53:07","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6340411/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6340411/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":81657104,"identity":"78daff1b-90d5-486c-8552-1e5ac0f109b0","added_by":"auto","created_at":"2025-04-29 18:47:03","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1698436,"visible":true,"origin":"","legend":"","description":"","filename":"ComputationalMathematicalOrganizationTheory.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6340411/v1_covered_79cce948-27a8-486f-923b-42d4b08e7613.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Distributed Graph Generation Using JDM Replication","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"computational-and-mathematical-organization-theory","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"cmot","sideBox":"Learn more about [Computational and Mathematical Organization Theory](https://link.springer.com/journal/10588)","snPcode":"10588","submissionUrl":"https://submission.springernature.com/new-submission/10588/3","title":"Computational and Mathematical Organization Theory","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"distributed computation, graph generation, joint degree matrix, dk series","lastPublishedDoi":"10.21203/rs.3.rs-6340411/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6340411/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Graph substructures play a critical role in defining network characteristics, making it essential for graph generators to accurately replicate these substructures to produce realistic graphs. However, the increasing rate of data in networks poses significant challenges for graph generation. To address this, a novel distributed algorithm is proposed, which employs JDM (Joint Degree Matrix) replication across distributed servers. This approach utilizes the vertex cut partitioning across multiple commodity computers. Experiments are conducted to evaluate the algorithm's runtime performance, demonstrating its effectiveness in handling large-scale networks while preserving realistic substructures. The results highlight the potential of this method to meet the growing demands of scalable and efficient graph generation.","manuscriptTitle":"Distributed Graph Generation Using JDM Replication","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-04-29 18:38:57","doi":"10.21203/rs.3.rs-6340411/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-10-14T16:06:27+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-05T07:08:20+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"157114261358685390018894160720331838653","date":"2025-09-20T11:22:49+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"177768306953346975448316418306452178217","date":"2025-04-28T13:18:06+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-04-25T19:05:39+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-04-05T03:18:16+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-04-05T03:17:27+00:00","index":"","fulltext":""},{"type":"submitted","content":"Computational and Mathematical Organization Theory","date":"2025-03-30T22:41:38+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"computational-and-mathematical-organization-theory","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"cmot","sideBox":"Learn more about [Computational and Mathematical Organization Theory](https://link.springer.com/journal/10588)","snPcode":"10588","submissionUrl":"https://submission.springernature.com/new-submission/10588/3","title":"Computational and Mathematical Organization Theory","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"3a9a5a36-e0a3-4bfd-9190-ea1defdfeab8","owner":[],"postedDate":"April 29th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"in-revision","subjectAreas":[],"tags":[],"updatedAt":"2025-11-13T22:38:14+00:00","versionOfRecord":[],"versionCreatedAt":"2025-04-29 18:38:57","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6340411","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6340411","identity":"rs-6340411","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}