A comprehensive study of multiplicative attribute graph model
| dc.contributor.advisor | Makowski, Armand | en_US |
| dc.contributor.author | Qu, Sikai | en_US |
| dc.contributor.department | Electrical Engineering | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2016-06-22T06:10:19Z | |
| dc.date.available | 2016-06-22T06:10:19Z | |
| dc.date.issued | 2016 | en_US |
| dc.description.abstract | Graphs are powerful tools to describe social, technological and biological networks, with nodes representing agents (people, websites, gene, etc.) and edges (or links) representing relations (or interactions) between agents. Examples of real-world networks include social networks, the World Wide Web, collaboration networks, protein networks, etc. Researchers often model these networks as random graphs. In this dissertation, we study a recently introduced social network model, named the Multiplicative Attribute Graph model (MAG), which takes into account the randomness of nodal attributes in the process of link formation (i.e., the probability of a link existing between two nodes depends on their attributes). Kim and Lesckovec, who defined the model, have claimed that this model exhibit some of the properties a real world social network is expected to have. Focusing on a homogeneous version of this model, we investigate the existence of zero-one laws for graph properties, e.g., the absence of isolated nodes, graph connectivity and the emergence of triangles. We obtain conditions on the parameters of the model, so that these properties occur with high or vanishingly probability as the number of nodes becomes unboundedly large. In that regime, we also investigate the property of triadic closure and the nodal degree distribution. | en_US |
| dc.identifier | https://doi.org/10.13016/M2JF50 | |
| dc.identifier.uri | http://hdl.handle.net/1903/18357 | |
| dc.language.iso | en | en_US |
| dc.subject.pqcontrolled | Electrical engineering | en_US |
| dc.subject.pqcontrolled | Statistics | en_US |
| dc.subject.pqcontrolled | Mathematics | en_US |
| dc.subject.pquncontrolled | Log-normal degree distribution | en_US |
| dc.subject.pquncontrolled | Modeling | en_US |
| dc.subject.pquncontrolled | Random Graphs | en_US |
| dc.subject.pquncontrolled | Social Network | en_US |
| dc.subject.pquncontrolled | Zero-one laws | en_US |
| dc.title | A comprehensive study of multiplicative attribute graph model | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1