Sökning: "Random graphs"

Visar resultat 6 - 10 av 51 avhandlingar innehållade orden Random graphs.

  1. 6. Random geometric graphs and their applications in neuronal modelling

    Författare :Fioralba Ajazi; Matematisk statistik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; random graph; Neural Network; Probability; Inhomogeneous random graph; random distance graph; random grown networks;

    Sammanfattning : Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons (nodes) and synaptic connections (edges) in the brain using inhomogeneous random distance graph models. LÄS MER

  3. 7. Random graph models and their applications

    Författare :Thomas Vallier; Matematisk statistik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; contact process; phase transition; classical random graphs; degree sequence; preferential attachment; percolation; random graphs;

    Sammanfattning : This thesis explores different models of random graphs. The first part treats a change from the preferential attachment model where the network incorporates new vertices and attach them preferentially to the previous vertices with a large number of connections. LÄS MER

  4. 8. Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference

    Författare :Termeh Shafie; Ove Frank; Krzysztof Nowicki; Stockholms universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; multigraph; vertex labeled graph; edge labeled graph; isomorphism; edge multiplicity; simplicity and complexity; entropy; joint information; information divergence; goodness-of-fit; Statistics; statistik;

    Sammanfattning : This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered.  The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. LÄS MER

  5. 9. Degrees in Random Graphs and Tournament Limits

    Författare :Erik Thörnblad; Svante Janson; Erik Broman; Daniel Kráľ; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random graphs; degree distributions; degree sequences; graph limits; tournaments; Mathematics; Matematik;

    Sammanfattning : This thesis consists of an introduction and six papers on the topics of degree distributions in random graphs and tournaments and their limits.The first two papers deal with a dynamic random graph, evolving in time through duplication and deletion of vertices and edges. In Paper I we study the degree densities of this model. LÄS MER

  7. 10. Symmetry in Randomness : Additive Functionals and Symmetries of Random Trees and Tree-Like Graphs

    Författare :Christoffer Olsson; Stephan Wagner; Ralph Neininger; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Random trees; Random graphs; Additive functionals; Automorphisms; Mathematics; Matematik;

    Sammanfattning : Properties of symmetries in random trees and tree-like graphs are explored. The primary structures studied are Galton-Watson trees, unlabeled unordered trees as well as labeled subcritical graphs. LÄS MER