Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"Percolation (Statistical physics)"”.

  1. A statistical theory of the epilepsies

    … is proposed, based on the theory of bond percolation on finite lattices. Within this model, the onset of seizures in the brain is identified with the appearance of spanning clusters of neurons engaged in the spurious and uncontrollable electrical activity characteristic of seizures. It is …

    vt Repository record for A statistical theory of the epilepsies (opens in a new tab)

  2. Trees, paths and avalanches on random networks

    … D.)--Michigan State University. Department of Physics and Astronomy, 2002

    msu Repository record for Trees, paths and avalanches on random networks (opens in a new tab)

  3. Topics in computational complexity

    <p>This thesis concerns the computational complexity of several combinatorial problems.</p><p>Chapter 1 is notation and definitions. In Chapter 2 the subgraph homeomorphism problem, for fixed pattern graphs H, is considered. For the cases H and#x2245; C<sub>6</sub>,C<sub>7</sub>,W<sub>4</sub> or …

    oxford Repository record for Topics in computational complexity (opens in a new tab)

  4. Rigidity and self-organization of random networks

    … D.)--Michigan State University, Department of Physics & Astronomy, 2003

    msu Repository record for Rigidity and self-organization of random networks (opens in a new tab)

  5. Elastic behavior of noncrystalline networks

    … D.)--Michigan State University. Department of Physics and Astronomy, 1987

    msu Repository record for Elastic behavior of noncrystalline networks (opens in a new tab)

  6. Statistical mechanics of vertex cover

    … D.)--Michigan State University. Department of Physics and Astronomy, 2007

    msu Repository record for Statistical mechanics of vertex cover (opens in a new tab)

  7. Estudo de alguns sistemas complexos: percolação dependente do tempo, aplicação a problemas de petróleo, percolação de longo alcance e modelo de reação-difusão

    … of complex systems. First, we consider a percolation model where the probability p for a site to be occupied increases linearly in time, from O to 1. We analyse the way the largest cluster grows in time, and in particular, we study the statistics of the “jumps” in the mass of the largest …

    brazil-ufrn Repository record for Estudo de alguns sistemas complexos: percolação dependente do tempo, aplicação a problemas de petróleo, percolação de longo alcance e modelo de reação-difusão (opens in a new tab)

  8. Extremal combinatorics, graph limits and computational complexity

    <p>This thesis is primarily focused on problems in extremal combinatorics, although we will also consider some questions of analytic and algorithmic nature. </p> <p>The <em>d-dimensional hypercube</em> is the graph with vertex set {0,1}<sup><em>d</em></sup> where two vertices are adjacent if they …

    oxford Repository record for Extremal combinatorics, graph limits and computational complexity (opens in a new tab)