Sökning: "Probability on Graphs"

Visar resultat 1 - 5 av 45 avhandlingar innehållade orden Probability on Graphs.

  1. 1. Probability on graphs

    Författare :Robert Parviainen; Uppsala universitet; []
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  3. 2. On Degree Variance in Random Graphs

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

    Sammanfattning : 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. LÄS MER

  4. 3. Mixing times for neighbour transposition shuffles on graphs

    Författare :Stefan Erikshed; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; card shuffling; mixing time; neighbour transpositions; convergence rate of Markov chains; lollipop graphs; random graphs; lollipop graphs;

    Sammanfattning : .... LÄS MER

  5. 4. On Directed Random Graphs and Greedy Walks on Point Processes

    Författare :Katja Gabrysch; Svante Janson; Takis Konstantopoulos; Thomas Mountford; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Directed random graphs; Tracy-Widom distribution; Poisson-weighted infinite tree; Greedy walk; Point processes;

    Sammanfattning : This thesis consists of an introduction and five papers, of which two contribute to the theory of directed random graphs and three to the theory of greedy walks on point processes.          We consider a directed random graph on a partially ordered vertex set, with an edge between any two comparable vertices present with probability p, independently of all other edges, and each edge is directed from the vertex with smaller label to the vertex with larger label. LÄS MER

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