Back to search

McMaster University

Assortative Configuration Random Graphs

Abstract

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.

Degree

thesis:*
Department dc:contributor.department
Mathematics
Year dc:date.issued
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Pourbabaee, Mohammad Farzad
Advisor dc:contributor.advisor
  • Hurd, Thomas R.

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Pourbabaee, Mohammad Farzad. Assortative Configuration Random Graphs. 2015. http://hdl.handle.net/11375/17213