Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List

ETD Abstract Container

Abstract Header

Local K-Core Algorithm in Complex Networks

Abstract Details

2013, MS, University of Cincinnati, Engineering and Applied Science: Computer Science.
Local methods tend to be more effective for community definition and detection than those difficult and large time consuming global ones. In this thesis, we introduce and define the notion of local k-core; a simpler local method easily implemented and computed which is based on the knowledge of neighborhood graph of the vertices in the graph. From the definition, we present the localized algorithm for local k-core decomposition algorithm. We show its relationship with 3-clique percolation and the k-core algorithm. Finally our experiment results reveal the efficiency of the algorithm and the richer community structure it exposed in real networks.
Yizong Cheng, Ph.D. (Committee Chair)
Fred Annexstein, Ph.D. (Committee Member)
Anca Ralescu, Ph.D. (Committee Member)
47 p.

Recommended Citations

Citations

  • Lu, C. (2013). Local K-Core Algorithm in Complex Networks [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377868996

    APA Style (7th edition)

  • Lu, Chen. Local K-Core Algorithm in Complex Networks. 2013. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377868996.

    MLA Style (8th edition)

  • Lu, Chen. "Local K-Core Algorithm in Complex Networks." Master's thesis, University of Cincinnati, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377868996

    Chicago Manual of Style (17th edition)