Sökning: "random graph"

Visar resultat 1 - 5 av 61 avhandlingar innehållade orden random graph.

  1. 1. 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. 2. 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

  4. 3. Random tournaments and random circuits

    Författare :Pontus Andersson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Poisson-Dirichlet distribution; random circuit decomposition; random tournament; subgraph count; MATEMATIK; MATHEMATICS; MATEMATIK; matematik; Mathematics;

    Sammanfattning : This thesis is devoted to two different topics in the area of probabilistic combinatorics: asymptotic behaviour of subgraph counts in a random tournament and random circuit decompositions of complete graphs.Let Tn be a random tournament on n vertices, chosen uniformly from all 2(n2) such tournaments, and let D be an arbitrary directed graph. LÄS MER

  5. 4. 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

  7. 5. Random railways and cycles in random regular graphs

    Författare :Hans Garmo; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Random railway; connectivity number; random regular graph; long cycles; asymptotic distribution. 1991 Mathematics Subject Classification. Primary 60F05; 60C05; 05C38; 05C80; 05C40; 05C45; MATEMATIK; MATHEMATICS; MATEMATIK; matematisk statistik; Mathematical Statistics;

    Sammanfattning : In a cubic multigraph certain restrictions on the paths are made to define what is called a railway. Due to these restrictions a special kind of connectivity is defined. As the number of vertices tends to infinity, the asymptotic probability of obtaining an, in this sense, connected random cubic multigraph is shown to be 1/3. LÄS MER