Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/17213
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hurd, Thomas R. | - |
dc.contributor.author | Pourbabaee, Mohammad Farzad | - |
dc.date.accessioned | 2015-04-27T14:45:28Z | - |
dc.date.available | 2015-04-27T14:45:28Z | - |
dc.date.issued | 2015-06 | - |
dc.identifier.uri | http://hdl.handle.net/11375/17213 | - |
dc.description.abstract | A random graph model is introduced, which is supposed to capture the assortativity effect in various real-world networks. An effect that appears when different types of vertices have non-uniform tendencies to connect to each other. Therefore, given the node- and edge-type distributions P, Q a discrete matching method is developed, so that the empirical distributions asymptotically passes to their given limits P, Q. Applications of martingale convergence methods are exploited to prove the large n limits of the discrete Markov setup. Finally, the relation between inhomogeneous random graph model as another recently studied topic and our model is investigated. | en_US |
dc.language.iso | en | en_US |
dc.title | Assortative Configuration Random Graphs | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Mathematics | en_US |
dc.description.degreetype | Dissertation | en_US |
dc.description.degree | Master of Science (MSc) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Farzad-MSc-thesis.pdf | Main Thesis Content | 384.42 kB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.