Advanced search
Showing result 1 - 5 of 13 swedish dissertations matching the above criteria.
-
1. Chain Graphs : Interpretations, Expressiveness and Learning Algorithms
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
-
2. A Study of Chain Graph Interpretations
Abstract : Probabilistic graphical models are today one of the most well used architectures for modelling and reasoning about knowledge with uncertainty. The most widely used subclass of these models is Bayesian networks that has found a wide range of applications both in industry and research. READ MORE
-
3. On Aspects of Anyons and Quantum Graphs
Abstract : This thesis consists of two distinct parts. The first part, based on the first two accompanied papers, is in the field of topological phases of matter and the second part, based on the third accompanied paper, looks at a problem in the field of quantum graphs, a rapidly growing field of mathematical physics. READ MORE
-
4. Essays on Bayesian Inference for Social Networks
Abstract : This thesis presents Bayesian solutions to inference problems for three types of social network data structures: a single observation of a social network, repeated observations on the same social network, and repeated observations on a social network developing through time.A social network is conceived as being a structure consisting of actors and their social interaction with each other. READ MORE
-
5. Split Trees, Cuttings and Explosions
Abstract : This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. READ MORE