Sökning: "Discrete models"
Visar resultat 16 - 20 av 390 avhandlingar innehållade orden Discrete models.
16. Accessibility percolation and first-passage percolation on the hypercube
Sammanfattning : In this thesis, we consider two percolation models on the n-dimensional binary hypercube, known as accessibility percolation and first-passage percolation. First-passage percolation randomly assigns non-negative weights, called passage times, to the edges of a graph and considers the minimal total weight of a path between given end-points. LÄS MER
17. Symmetry in Randomness : Additive Functionals and Symmetries of Random Trees and Tree-Like Graphs
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
18. Game theory and applications
Sammanfattning : Individual-level interactions and decisions spread though populations and change the collective-level dynamics in an intricate way. Nevertheless, game theory is well suited for the unification of these viewpoints. LÄS MER
19. Building and Destroying Urns, Graphs, and Trees
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
20. On random satisfiability and optimization problems
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