Search for dissertations about: "random distance graph"
Showing result 1 - 5 of 8 swedish dissertations containing the words random distance graph.
-
1. Random geometric graphs and their applications in neuronal modelling
Abstract : Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons (nodes) and synaptic connections (edges) in the brain using inhomogeneous random distance graph models. READ MORE
-
2. Critical Scaling in Particle Systems and Random Graphs
Abstract : The purpose of this thesis is to study the behavior of macro-systems through their micro-parameters. In particular, we are interested in finding critical scaling in various models.Paper I investigates the influence of discrete-time collisions on particle dynamics. READ MORE
-
3. Topics in discrete random structures
Abstract : This thesis presents four papers on problems in discrete probability. A common theme of the articles is to take some class of discrete structures, impose some randomness, and then consider what happens asymptotically as the size of the structure tends to infinity. READ MORE
-
4. Roughening in dimer models : Random matrix statistics and surface fluctuations
Abstract : The field of mathematical statistical mechanics sits at the intersection of probability theory and mathematical physics. It consists of the rigorous analysis of models in statistical mechanics, such as dimer and lattice models - of which the Ising model is a classical example. READ MORE
-
5. Decorating trees grown in urns
Abstract : Random recursive trees are classic models of random trees. A random recursive tree is initiated with a single root vertex and constructed in steps, whereby at each step a vertex is added as the child of a vertex chosen uniformly at random in the tree. READ MORE