Search for dissertations about: "percolation"

Showing result 1 - 5 of 82 swedish dissertations containing the word percolation.

  1. 1. Percolation: Inference and Applications in Hydrology

    Author : Oscar Hammar; Göteborgs universitet.; Gothenburg University.; [2011]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; percolation; inference; consistency; Markov chain Monte Carlo; hydrology; consistency; Markov chain Monte Carlo; inference; hydrology;

    Abstract : Percolation theory is a branch of probability theory describing connectedness in a stochastic network. The connectedness of a percolation process is governed by a few, typically one or two, parameters. READ MORE

  2. 2. Continuum Percolation in non-Euclidean Spaces

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Johan Tykesson; Göteborgs universitet.; Gothenburg University.; [2008]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Bernoulli percolation; continuum percolation; dependent percolation; double phase transition; hyperbolic space; Poisson Boolean model; geodesic percolation; continuum percolation; Poisson Boolean model; dependent percolation; hyperbolic space; double phase transition; geodesic percolation;

    Abstract : In this thesis we first consider the Poisson Boolean model ofcontinuum percolation in $n$-dimensional hyperbolic space ${\mathbb H}^n$. Let $R$ be the radius of the balls in the model, and$\lambda$ the intensity of the underlying Poisson process. READ MORE

  3. 3. Accessibility percolation and first-passage percolation on the hypercube

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Anders Martinsson; Göteborgs universitet.; Gothenburg University.; [2015]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; hypercube; percolation; accessible path; house of cards; rough mount Fuji; first-passage percolation; Richardson s model; branching translation process; house of cards; rough mount Fuji; first-passage percolation; percolation; accessible path; branching translation process; Richardson s model;

    Abstract : 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. READ MORE

  4. 4. Selected Topics in Continuum Percolation Phase Transitions, Cover Times and Random Fractals

    University dissertation from Uppsala : Department of Mathematics

    Author : Filipe Mussini; Erik I. Broman; Hermine Biermé; [2019]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Poisson point process; Percolation; Boolean model; Quasi-isometries; Cover times; Poisson cylinder process; Ellipsoid process; Phase transition; Random fractals; Mathematics; Matematik;

    Abstract : This thesis consists of an introduction and three research papers. The subject is probability theory and in particular concerns the topics of percolation, cover times and random fractals.Paper I deals with the Poisson Boolean model in locally compact Polish metric spaces. READ MORE

  5. 5. Asymptotics and dynamics in first-passage and continuum percolation

    University dissertation from Göteborg : University of Gothenburg

    Author : Daniel Ahlberg; Göteborgs universitet.; Gothenburg University.; [2011]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; first-passage percolation; noise sensitivity; continuum percolation; Gilbert model; limit theorems; shape theorem; stopped random walks; large deviations; dynamical percolation; continuum percolation; shape theorem; noise sensitivity; dynamical percolation; limit theorems; large deviations; stopped random walks; Gilbert model;

    Abstract : This thesis combines the study of asymptotic properties of percolation processes with various dynamical concepts. First-passage percolation is a model for the spatial propagation of a fluid on a discrete structure; the Shape Theorem describes its almost sure convergence towards an asymptotic shape, when considered on the square (or cubic) lattice. READ MORE