K-core in random graphs

A graph G=(V,E) is a mathematical model for a network with vertex set V and edge set E. A Random Graph model is a probabilistic graph. A Random Geometric Graph is a Random Graph were each vertex has a location in a space χ. We compare the Erdos-Rényi random graph, G(n,p), to the Random Geometric Graph model, RGG(n,r) where, in general we use r=c...

On the simplicity of configuration model random graphs

This thesis consits of a literature study and an investigation of a new problem. This new problem involves a generalization of the (random graph) configuration model, the so-called alternative model.