Show simple item record

dc.contributor.authorMa, Zheng
dc.date.accessioned2015-09-21 20:27:44 (GMT)
dc.date.available2015-09-21 20:27:44 (GMT)
dc.date.issued2015-09-21
dc.date.submitted2015
dc.identifier.urihttp://hdl.handle.net/10012/9687
dc.description.abstractThe motivation of this thesis is to find the reason why protein-protein interaction networks present a unique degree distribution pattern, where the majority of the proteins are sparsely connected, while densely-connected proteins also exist. Since the degree distribution pattern of protein-protein interaction networks arises through a long-time evolutionary process of gene duplication, we introduce the model of random duplication graph to depict protein-protein networks mathematically. Specifically, we intend to derive the degree distribution function of protein-protein interaction networks by modeling protein-protein interaction networks as a special case of random duplication graph. The random duplication graph model mimics the gene duplication process. In a random duplication graph, one vertex is chosen uniformly at random to duplicate at every timestep t, and all the edges of the original vertex are preserved by the new vertex. We derive the expected degree distribution function of the model from the probability master function. Furthermore, we learn from the Erdös-Rényi random graph model that the degree distribution function does not necessarily converge in a single random duplication graph. In consequences, we define the n-fold of random duplication graphs, a combination of n independent random duplication graphs, under which we are able to prove that the degree distribution function converges. Furthermore, we model the protein-protein interaction networks as a special case of random duplication graph with sparse initial graph, and the degree distribution function of protein-protein interaction networks is derived. We compare this degree distribution function with degree distribution data of reconstructed protein-protein interaction networks, and we show that this degree distribution function indeed resembles the degree distribution pattern in protein-protein interaction networks. Our model gives a theoretical analysis of the self-organization process of protein-protein interaction networks. Moreover, we have shown that it is the gene duplication process combined with the sparsely-connected initial condition that leads to the unique degree distribution pattern in protein-protein interaction networks. We can make a further prediction based on our analysis—as the gene duplication process proceeds, the percentage of densely-connected proteins will be higher.en
dc.language.isoenen
dc.publisherUniversity of Waterloo
dc.subjectDegree Distribution Functionen
dc.subjectRandom Duplication Graphen
dc.subjectProtein-Protein Interaction Networken
dc.subjectDegree Distribution Patternen
dc.subjectGene Duplicationen
dc.titleA Study of Random Duplication Graphs and Degree Distribution Pattern of Protein-Protein Interaction Networksen
dc.typeMaster Thesisen
dc.pendingfalse
dc.subject.programElectrical and Computer Engineeringen
uws-etd.degree.departmentElectrical and Computer Engineeringen
uws-etd.degreeMaster of Applied Scienceen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages