Sökning: "Directed graph"

Visar resultat 16 - 20 av 42 avhandlingar innehållade orden Directed graph.

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

  3. 17. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

    Författare :Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

    Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER

  4. 18. Chain Graphs : Interpretations, Expressiveness and Learning Algorithms

    Författare :Dag Sonntag; M. Jose Peña; Nahid Shahmehri; Jirka Vomlel; Linköpings universitet; []
    Nyckelord :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

  5. 19. Topological Combinatorics

    Författare :Alexander Engström; Svante Linusson; Günter M. Ziegler; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Sammanfattning : This thesis on Topological Combinatorics contains 7 papers. All of them but paper Bare published before.In paper A we prove that!i dim ˜Hi(Ind(G);Q) ! |Ind(G[D])| for any graph G andits independence complex Ind(G), under the condition that G\D is a forest. LÄS MER

  7. 20. Bayesian inference in probabilistic graphical models

    Författare :Felix Leopoldo Rios; Tatjana Pavlenko; Alun Thomas; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graphical models; Bayesian inference; predictive classification; decomposable graphs; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

    Sammanfattning : This thesis consists of four papers studying structure learning and Bayesian inference in probabilistic graphical models for both undirected and directed acyclic graphs (DAGs).Paper A presents a novel algorithm, called the Christmas tree algorithm (CTA), that incrementally construct junction trees for decomposable graphs by adding one node at a time to the underlying graph. LÄS MER