Skip to Main Content
 

Global Search Box

 
 
 
 

Files

ETD Abstract Container

Abstract Header

Fast Algorithms for Large-Scale Network Analytics

Abstract Details

2015, Doctor of Philosophy, Ohio State University, Computer Science and Engineering.
Today's networks are massive and dynamic; Facebook with a billion of users and a trillion of connections and Twitter with ~600 millions of users tweeting ~9,000 times in a second are just a few examples. Making sense of these graphs in static and dynamic scenarios is essential. Most of the existing algorithms assume that the graph is static and it does not change. Today, these assumptions are no more valid. Fast algorithms for streaming and parallel scenarios are necessary to process graphs of massive sizes. Compression techniques are also quite necessary to deal with the size. In our work, we provide compression, streaming, and parallel algorithms for three important graph analytics problems: centrality computation, dense subgraph discovery and community detection. In addition, we introduce new dense subgraph discovery algorithms to better model the cohesion in real-world networks.
Umit V. Catalyurek (Advisor)
Arnab Nandi (Committee Member)
Srinivasan Parthasarathy (Committee Member)
335 p.

Recommended Citations

Citations

  • Sariyuce, A. E. (2015). Fast Algorithms for Large-Scale Network Analytics [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429825578

    APA Style (7th edition)

  • Sariyuce, Ahmet Erdem. Fast Algorithms for Large-Scale Network Analytics. 2015. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1429825578.

    MLA Style (8th edition)

  • Sariyuce, Ahmet Erdem. "Fast Algorithms for Large-Scale Network Analytics." Doctoral dissertation, Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429825578

    Chicago Manual of Style (17th edition)