Advanced search

Showing result 1 - 5 of 296 swedish dissertations matching the above criteria.

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

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

    Abstract : 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. READ MORE

  4. 2. Switched Bond Graphs : Simulation and Analysis

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

    Abstract : 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. READ MORE

  5. 3. On Degree Variance in Random Graphs

    Author : Jan Hagberg; Ove Frank; Tom A.B. Snijders; Stockholms universitet; []
    Keywords : 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

  6. 4. Probability on graphs

    Author : Robert Parviainen; Uppsala universitet; []
    Keywords : ;

    Abstract : .... READ MORE

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

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

    Abstract : .... READ MORE