Search for dissertations about: "Directed graph"

Showing result 1 - 5 of 42 swedish dissertations containing the words Directed graph.

  2. 1. Statistical Inference of Information in Networks : Causality and Directed Information Graphs

    Author : Sina Molavipour; Mikael Skoglund; Deniz Gündüz; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Abstract : Over the last decades, the advancements in measurement, collection, and storage of data have provided tremendous amounts of information. Thus, it has become crucial to extract valuable features and analyze the characteristics of data. As we study more complex systems (e.g. READ MORE

  4. 2. Structural Models of Network Contacts Between Actors Governed by Activity and Attraction

    Author : Zhi Geng; Statistiska institutionen; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Directed graph; Ego-nets; EM algorithm; Gibbs sampling; Multinomial distribution; Hypergeometric distribution; Vertex covariates; Clustering coefficient; Taylor expansion;

    Abstract : This thesis consists of five papers on the subject of statistical modeling of stochastic networks. The NG-model proposed in Paper I combines a block structure with parameters that capture the identities of vertices and thus the new approach stresses the concept of ego-nets, which describes the structure around identified vertices. READ MORE

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

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

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

  6. 4. Convergence to the Tracy-Widom distribution for longest paths in a directed random graph

    Author : Katja Trinajstic; Takis Konstantopoulos; Kurt Johansson; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Mathematical Statistics; Matematisk statistik;

    Abstract : .... READ MORE

  7. 5. Exploiting Coherence in Voxelized Geometry

    Author : Viktor Kämpe; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; time-varying; directed acyclic graph; geometry; voxel; octree;

    Abstract : In computer graphics, the geometry of virtual worlds can be represented in numerousways, from collections of simple triangles or voxels to higher-order primitives likecurved surfaces. There is a trade-off, both in terms of memory consumption and processingtime, between the cost of an individual primitive and the number of primitivesrequired to faithfully represent the world. READ MORE