Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/17213
Title: | Assortative Configuration Random Graphs |
Authors: | Pourbabaee, Mohammad Farzad |
Advisor: | Hurd, Thomas R. |
Department: | Mathematics |
Publication Date: | Jun-2015 |
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. |
URI: | http://hdl.handle.net/11375/17213 |
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.