Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


36441.pdf (3.11 MB)

ETD Abstract Container

Abstract Header

Discovery of core-periphery structures in networks using k-MSTs

Polepalli, Susheela
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1573573474759435

Abstract Details

2019, MS, University of Cincinnati, Engineering and Applied Science: Computer Science.
Mesoscale properties of the network provide useful insights about the connectivity of the entities which occur in the form of groups. Core periphery structures are one of the mesoscale structures that accurately model the sparse set of nodes surrounding a dense core, and this knowledge can be beneficial in many applications such as social, collaboration and transport networks. In today's scenario, with a significant increase in the amount of network data processed, extracting core-periphery structures becomes computationally difficult with the existing algorithms. The minimal spanning tree accurately models the intrinsic properties of the data set using fewer edges representing strong associations. Community detection algorithms could efficiently identify clusters on a large amount of data, reducing the computation significantly using MST neighborhood graphs. In our thesis, we extend the concept of the MST neighborhood graph to identify core-periphery structures in weighted undirected graphs. Using MST neighborhood graphs, each node is connected to its closest neighboring node using edge weights and thus reducing the problem size by eliminating connections representing weak connectivity. Later, using a structural metric, for a given node, we extract a core network having high edge density surrounded by periphery nodes having low edge density, in the form of layers. We demonstrate the working prototype by implementing it on networks of various domains. Later we validate the core-periphery structures obtained and show that accurate CP structures were obtained using kMST, thus reducing the problem size, significantly.
Raj Bhatnagar, Ph.D. (Committee Chair)
Gowtham Atluri, Ph.D. (Committee Member)
Ali Minai, Ph.D. (Committee Member)
62 p.
Computer Science
mesoscale structures; core-periphery structures; kMST graphs

Recommended Citations

Citations

  • Polepalli, S. (2019). Discovery of core-periphery structures in networks using k-MSTs [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1573573474759435

    APA Style (7th edition)

  • Polepalli, Susheela. Discovery of core-periphery structures in networks using k-MSTs. 2019. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1573573474759435.

    MLA Style (8th edition)

  • Polepalli, Susheela. "Discovery of core-periphery structures in networks using k-MSTs." Master's thesis, University of Cincinnati, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1573573474759435

    Chicago Manual of Style (17th edition)

ucin1573573474759435
245
© 2019, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.