Parallel Algorithms for Switching Edges and Generating Random Graphs from Given Degree Sequences using HPC Platforms

dc.contributor.authorBhuiyan, Md Hasanuzzamanen
dc.contributor.committeechairMarathe, Madhav Vishnuen
dc.contributor.committeechairKhan, Maleqen
dc.contributor.committeememberRavi, S. S.en
dc.contributor.committeememberHeath, Lenwood S.en
dc.contributor.committeememberVullikanti, Anil Kumar S.en
dc.contributor.departmentComputer Scienceen
dc.description.abstractNetworks (or graphs) are an effective abstraction for representing many real-world complex systems. Analyzing various structural properties of and dynamics on such networks reveal valuable insights about the behavior of such systems. In today's data-rich world, we are deluged by the massive amount of heterogeneous data from various sources, such as the web, infrastructure, and online social media. Analyzing this huge amount of data may take a prohibitively long time and even may not fit into the main memory of a single processing unit, thus motivating the necessity of efficient parallel algorithms in various high-performance computing (HPC) platforms. In this dissertation, we present distributed and shared memory parallel algorithms for some important network analytic problems. First, we present distributed memory parallel algorithms for switching edges in a network. Edge switch is an operation on a network, where two edges are selected randomly, and one of their end vertices are swapped with each other. This operation is repeated either a given number of times or until a specified criterion is satisfied. It has diverse real-world applications such as in generating simple random networks with a given degree sequence and in modeling and studying various dynamic networks. One of the steps in our edge switch algorithm requires generating multinomial random variables in parallel. We also present the first non-trivial parallel algorithm for generating multinomial random variables. Next, we present efficient algorithms for assortative edge switch in a labeled network. Assuming each vertex has a label, an assortative edge switch operation imposes an extra constraint, i.e., two edges are randomly selected and one of their end vertices are swapped with each other if the labels of the end vertices of the edges remain the same as before. It can be used to study the effect of the network structural properties on dynamics over a network. Although the problem of assortative edge switch seems to be similar to that of (regular) edge switch, the constraint on the vertex labels in assortative edge switch leads to a new difficulty, which needs to be addressed by an entirely new algorithmic approach. We first present a novel sequential algorithm for assortative edge switch; then we present an efficient distributed memory parallel algorithm based on our sequential algorithm. Finally, we present efficient shared memory parallel algorithms for generating random networks with exact given degree sequence using a direct graph construction method, which involves computing a candidate list for creating an edge incident on a vertex using the Erdos-Gallai characterization and then randomly creating the edges from the candidates.en
dc.description.degreePh. D.en
dc.publisherVirginia Techen
dc.rightsIn Copyrighten
dc.subjectNetwork Scienceen
dc.subjectParallel Algorithmsen
dc.subjectHigh Performance Computingen
dc.subjectEdge Switchen
dc.subjectRandom Networksen
dc.titleParallel Algorithms for Switching Edges and Generating Random Graphs from Given Degree Sequences using HPC Platformsen
dc.typeDissertationen Science and Applicationsen Polytechnic Institute and State Universityen D.en
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
1.83 MB
Adobe Portable Document Format