Sökning: "combinatorial probability"

Visar resultat 1 - 5 av 19 avhandlingar innehållade orden combinatorial probability.

  1. 1. Generalizations of Szego Limit Theorem : Higher Order Terms and Discontinuous Symbols

    Författare :Dimitri Gioev; KTH; []
    Nyckelord :Regularized determinants; Toeplitz operators; Wiener-Hopf operators; pseudodifferential operators PsDO on manifolds; asymptotics; general theory of PsDO; combinatorial identities; random walks; combinatorial probability; symmetric functions;

    Sammanfattning : .... LÄS MER

  3. 2. Combinatorial constructions related to packing, covering and probability

    Författare :Johan Wästlund; KTH; []
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  4. 3. On random satisfiability and optimization problems

    Författare :Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random graphs; k-SAT; satisfiability; coupon collector; random cover time; threshold phenomenon; concentration of measure; combinatorial probability; perfect matching; assignment problem; local graph limit; mean-field; Mathematics; matematik;

    Sammanfattning : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. LÄS MER

  5. 4. Offline and Online Models for Learning Pairwise Relations in Data

    Författare :Fazeleh Sadat Hoseini; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Mulit-Armed Bandit; Pairwise Relations; Performance Modeling; Motion Trajectory Clustering; Minimax Distance; Bottleneck Identification; Online Learning; Representation Learning; Memory Efficiency; Concurrent Programming; Thompson Sampling;

    Sammanfattning : Pairwise relations between data points are essential for numerous machine learning algorithms. Many representation learning methods consider pairwise relations to identify the latent features and patterns in the data. This thesis, investigates learning of pairwise relations from two different perspectives: offline learning and online learning. LÄS MER

  7. 5. Building and Destroying Urns, Graphs, and Trees

    Författare :Fabian Burghart; Cecilia Holmgren; Svante Janson; Klas Markström; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis, consisting of an introduction and four papers, different models in the mathematical area of combinatorial probability are investigated.In Paper I, two operations for combining generalised Pólya urns, called disjoint union and product, are defined. LÄS MER