Sökning: "graph theory"

Visar resultat 6 - 10 av 152 avhandlingar innehållade orden graph theory.

  1. 6. Random Graph and Growth Models

    Författare :Sebastian Rosengren; Maria Deijfen; Pieter Trapman; Tatyana Turova; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical Statistics; matematisk statistik;

    Sammanfattning : Random graphs is a well-studied field of probability theory, and have proven very useful in a range of applications — modeling social networks, epidemics, and structures on the Internet to name a few. However, most random graphs are static in the sense that the network structure does not change over time. LÄS MER

  3. 7. Graph-structured multi-marginal optimal transport : Theory, applications, and efficient methods using entropy regularization

    Författare :Isabel Haasler; Johan Karlsson; Michele Pavon; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Optimization and Systems Theory; Optimeringslära och systemteori;

    Sammanfattning : This thesis deals with a class of multi-marginal optimal transport problems, which we call graph-structured multi-marginal optimal transport. The aim of the thesis is to work towards a unified framework for this class of problems. The included papers explore theoretical, computational, and practical aspects of the novel framework, e.g. LÄS MER

  4. 8. Optimal and Hereditarily Optimal Realizations of Metric Spaces

    Författare :Alice Lesser; Svante Janson; Lars-Erik Persson; Anders Johansson; Vincent Moulton; Pierre Flener; Charles Semple; Uppsala universitet; []
    Nyckelord :Applied mathematics; optimal realization; hereditarily optimal realization; tight span; phylogenetic network; Buneman graph; split decomposition; T-theory; finite metric space; topological graph theory; discrete geometry; Tillämpad matematik;

    Sammanfattning : This PhD thesis, consisting of an introduction, four papers, and some supplementary results, studies the problem of finding an optimal realization of a given finite metric space: a weighted graph which preserves the metric's distances and has minimal total edge weight. This problem is known to be NP-hard, and solutions are not necessarily unique. LÄS MER

  5. 9. Spectral graph theory on Pre-fractals

    Författare :Konstantinos Tsougkas; Anders Karlsson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Fractals;

    Sammanfattning : .... LÄS MER

  7. 10. Random graph models and their applications

    Författare :Thomas Vallier; Matematisk statistik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; contact process; phase transition; classical random graphs; degree sequence; preferential attachment; percolation; random graphs;

    Sammanfattning : This thesis explores different models of random graphs. The first part treats a change from the preferential attachment model where the network incorporates new vertices and attach them preferentially to the previous vertices with a large number of connections. LÄS MER