Sökning: "exponential random graphs"

Hittade 5 avhandlingar innehållade orden exponential random graphs.

  1. 1. Symmetry in Randomness : Additive Functionals and Symmetries of Random Trees and Tree-Like Graphs

    Författare :Christoffer Olsson; Stephan Wagner; Ralph Neininger; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Random trees; Random graphs; Additive functionals; Automorphisms; Mathematics; Matematik;

    Sammanfattning : Properties of symmetries in random trees and tree-like graphs are explored. The primary structures studied are Galton-Watson trees, unlabeled unordered trees as well as labeled subcritical graphs. LÄS MER

  2. 2. Essays on Bayesian Inference for Social Networks

    Författare :Johan Koskinen; Ove Frank; Philippa Pattison; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Bayesian inference; social network analysis; Markov chain Monte Carlo; exponential random graphs; cognitive social structures; longitudinal social networks.; Statistics; Statistik;

    Sammanfattning : 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. LÄS MER

  3. 3. A Random Walk in Statistical Physics

    Författare :Pontus Svensson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis deals with some aspects of the physics of disordered systems. It consists of four papers and an introductory part. An introduction, suitable for physicists, to theoretical computer science and computational complexity is contained in chapter 2. LÄS MER

  4. 4. Optimization, Matroids and Error-Correcting Codes

    Författare :Martin Hessler; Johan Wästlund; Olof Heden; Faina I. Solov´eva; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Sammanfattning : The first subject we investigate in this thesis deals with optimization problems on graphs. The edges are given costs defined by the values of independent exponential random variables. We show how to calculate some or all moments of the distributions of the costs of some optimization problems on graphs. LÄS MER

  5. 5. On Long Proofs of Simple Truths

    Författare :Kilian Risse; Per Austrin; Johan Håstad; Jakob Nordström; Benjamin Rossman; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computational Complexity; Lower Bounds; Proof Complexity; Datalogi; Computer Science;

    Sammanfattning : Propositional proof complexity is the study of certificates of infeasibility. In this thesis we consider several proof systems with limited deductive ability and unconditionally show that they require long refutations of the feasibility of certain Boolean formulas. LÄS MER