Search for dissertations about: "graph limits"

Showing result 1 - 5 of 9 swedish dissertations containing the words graph limits.

  2. 1. Degrees in Random Graphs and Tournament Limits

    Author : Erik Thörnblad; Svante Janson; Erik Broman; Daniel Kráľ; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Random graphs; degree distributions; degree sequences; graph limits; tournaments; Mathematics; Matematik;

    Abstract : This thesis consists of an introduction and six papers on the topics of degree distributions in random graphs and tournaments and their limits.The first two papers deal with a dynamic random graph, evolving in time through duplication and deletion of vertices and edges. In Paper I we study the degree densities of this model. READ MORE

  4. 2. Sparse Voxel DAGs

    Author : Viktor Kämpe; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Geometry; Shadows; Data structures; Tree; Visibility; Grid; Voxel; Directed acyclic graph; Computer graphics;

    Abstract : This thesis investigates a memory-efficient representation of highly detailed geometry in 3D voxel grids. The memory consumption of a plain dense grid scales too fast as the resolution increases to be feasible at very high resolutions. READ MORE

  5. 3. Equilibrium and Dynamics on Complex Networkds

    Author : Gino Del Ferraro; Erik Aurell; Bernard Derrida; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Statistical mechanics; complex networks; spin systems; non equilibrium dynamics; generalized belief propagation; message passing; cavity method; variational approaches; Fysik; Physics;

    Abstract : Complex networks are an important class of models used to describe the behaviour of a very broad category of systems which appear in different fields of science ranging from physics, biology and statistics to computer science and other disciplines. This set of models includes spin systems on a graph, neural networks, decision networks, spreading disease, financial trade, social networks and all systems which can be represented as interacting agents on some sort of graph architecture. READ MORE

  6. 4. Boundary Behavior of p-Laplace Type Equations

    Author : Benny Avelin; Kaj Nyström; Steve Hofmann; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; p-Laplace; Boundary Harnack inequality; A-harmonic; Ahlfors regularity; NTA-domains; Martin boundary; Reifenberg flat; Approximable by Lipschitz graphs; Subelliptic; Carleson estimate; Mathematics; Matematik;

    Abstract : This thesis consists of six scientific papers, an introduction and a summary. All six papers concern the boundary behavior of non-negative solutions to partial differential equations.Paper I concerns solutions to certain p-Laplace type operators with variable coefficients. READ MORE

  7. 5. Efficient Use of Exponential Size Linear Programs

    Author : Lukas Polacek; Johan Håstad; Nikhil Bansal; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; approximation algorithms; linear programming; allocation problems; Computer Science; Datalogi;

    Abstract : In the past decades, linear programming (LP) has been successfully used to develop approximation algorithms for various optimization problems. In particular, the so-called assignment LP has lead to substantial progress for various allocation problems, including scheduling unrelated parallel machines. READ MORE