Sökning: "geometric random graphs"
Visar resultat 1 - 5 av 6 avhandlingar innehållade orden geometric random graphs.
1. Critical Scaling in Particle Systems and Random Graphs
Sammanfattning : 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. LÄS MER
2. Random geometric graphs and their applications in neuronal modelling
Sammanfattning : 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. LÄS MER
3. Topics in algorithmic, enumerative and geometric combinatorics
Sammanfattning : This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. LÄS MER
4. Noise sensitivity and FK-type representations for Gaussian and stable processes
Sammanfattning : This thesis contains four papers on probability theory. Paper A concerns the question of whether the exclusion sensitivity and exclusion stability of a sequence of Boolean functions are monotone with respect to adding edges to the underlying sequence of graphs. LÄS MER
5. Consensus formation in the Deffuant model
Sammanfattning : This thesis deals with a mathematical model used in the context of social interaction in large groups, introduced by Deffuant et al. in 2000. Each individual holds an opinion and shares it with others in random pairwise encounters. LÄS MER