Search for dissertations about: "Uniform Random Graphs"

Found 5 swedish dissertations containing the words Uniform Random Graphs.

  1. 1. On Degree Variance in Random Graphs

    Author : Jan Hagberg; Ove Frank; Tom A.B. Snijders; Stockholms universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Degree Sequences; Uniform Random Graphs; Bernoulli Graphs; Degree Moments; Degree Statistics; Degree Variance; Gamma Approximation; Centrality Testing; Integer Sequences; Statistics; Statistik;

    Abstract : This thesis is concerned with degree moments and degree variance in random graphs. The degree of vertex i in a graph is the number of edges incident to vertex i.In the first paper, degree moments and functions of degree moments are investigated for three random graph models. READ MORE

  2. 2. Stochastic epidemics on random networks

    Author : Abid Ali Lashari; Pieter Trapman; Filip Lindskog; Peter Neal; Stockholms universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; Branching process; Configuration model; Random graph; Epidemic process; Final size; Threshold behaviour; Duration of an epidemic; Vaccination; Mathematical Statistics; matematisk statistik;

    Abstract : This thesis considers stochastic epidemic models for the spread of epidemics in structured populations. The asymptotic behaviour of the models is analysed by using branching process approximations. The thesis contains four manuscripts. READ MORE

  3. 3. Aspects of Spatial Random Processes

    Author : Olle Häggström; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
    Keywords : subshift of finite type; measure of maximal entropy; Ising model; Gibbs measure; uniform spanning tree; first passage percolation; asymptotic shape; first passage percolation;

    Abstract : This thesis consists of five papers dealing with various aspects of spatial random processes. In the first three papers the main focus is on a special class of such processes, namely measures of maximal entropy for subshifts of finite type. READ MORE

  4. 4. Triad count estimation and transitivity testing in graphs and digraphs

    Author : Martin Karlberg; Tom Snijders; Stockholms universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Statistics; Statistik; statistik; Statistics;

    Abstract : Triads and transitivity are two concepts within the field of social network analysis that are closely related to each other. We study some estimation and testing problems related to those concepts, using the tools of graph theory; the results obtained could be applied to graphs representing other kinds of data than social relations. READ MORE

  5. 5. Topics in algorithmic, enumerative and geometric combinatorics

    Author : Ragnar Freij; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Discrete Morse theory; simplicial G-complex; centrally symmetric polytope; split graph; derangement; pattern packing; composition; finite poset; optimal stopping; secretary problem.; finite poset;

    Abstract : This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. READ MORE