Sökning: "GRAPHS"

Visar resultat 1 - 5 av 263 avhandlingar innehållade ordet GRAPHS.

  1. 1. Chain Graphs : Interpretations, Expressiveness and Learning Algorithms

    Författare :Dag Sonntag; M. Jose Peña; Nahid Shahmehri; Jirka Vomlel; Linköpings universitet; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Chain Graphs; Probabilitstic Grapical Models;

    Sammanfattning : Probabilistic graphical models are currently one of the most commonly used architectures for modelling and reasoning with uncertainty. The most widely used subclass of these models is directed acyclic graphs, also known as Bayesian networks, which are used in a wide range of applications both in research and industry. LÄS MER

  2. 2. Switched Bond Graphs : Simulation and Analysis

    Författare :Krister Edström; Linköpings universitet; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Bond graphs; Hybrid systems; Modeling; Simulation; Causality; Discontinuities;

    Sammanfattning : In this thesis an approach to modeling and simulation of mode switching systems is investigated. This approach, switched bond graphs, is an extension of the bond graph language in the sense that it allows modeling of mode switching phenomena.The classical bond graph language as well as the switched bond graph language are presented. LÄS MER

  3. 3. On Degree Variance in Random Graphs

    Författare :Jan Hagberg; Ove Frank; Tom A.B. Snijders; Stockholms universitet; []
    Nyckelord :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;

    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. 4. Probability on graphs

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

    Sammanfattning : .... LÄS MER

  5. 5. Mixing times for neighbour transposition shuffles on graphs

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

    Sammanfattning : .... LÄS MER