Search for dissertations about: "Directed random graphs"

Showing result 1 - 5 of 7 swedish dissertations containing the words Directed random graphs.

  2. 1. Random tournaments and random circuits

    Author : Pontus Andersson; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Poisson-Dirichlet distribution; random circuit decomposition; random tournament; subgraph count; MATEMATIK; MATHEMATICS; MATEMATIK; matematik; Mathematics;

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

  4. 2. 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

  5. 3. 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

  6. 4. Decorating trees grown in urns

    Author : Colin Desmarais; Cecilia Holmgren; Stanislav Volkov; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : Random recursive trees are classic models of random trees. A random recursive tree is initiated with a single root vertex and constructed in steps, whereby at each step a vertex is added as the child of a vertex chosen uniformly at random in the tree. READ MORE

  7. 5. Combinatorics of stable polynomials and correlation inequalities

    Author : Madeleine Leander; Petter Brändén; Jörgen Backelin; Carla Savage; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Mathematics; matematik;

    Abstract : This thesis contains five papers divided into two parts. In the first part, Papers I-IV, we study polynomials within the field of combinatorics. Here we study combinatorial properties as well as the zero distribution of the polynomials in question. The second part consists of Paper V, where we study correlating events in randomly oriented graphs. READ MORE