On Directed Random Graphs and Greedy Walks on Point Processes
This thesis consists of an introduction and five papers, of which two contribute to the theory of directed random graphs and three to the theory of greedy walks on point processes. We consider a directed random graph on a partially ordered vertex set, with an edge between any two comparabl...
Main Author: | Gabrysch, Katja |
---|---|
Format: | Doctoral Thesis |
Language: | English |
Published: |
Uppsala universitet, Analys och sannolikhetsteori
2016
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-305859 http://nbn-resolving.de/urn:isbn:978-91-506-2608-7 |
Similar Items
-
Dynamic Functional Connectivity Change-Point Detection With Random Matrix Theory Inference
by: Jaehee Kim, et al.
Published: (2021-05-01) -
A Hypothesis Testing for Large Weighted Networks With Applications to Functional Neuroimaging Data
by: Li Chen, et al.
Published: (2020-01-01) -
Non symmetric random walk on infinite graph
by: Marcin J. Zygmunt
Published: (2011-01-01) -
Studentized Extreme Eigenvalue Based Double Threshold Spectrum Sensing Under Noise Uncertainty
by: Cebrail Çiflikli, et al.
Published: (2020-01-01) -
AssocTests: An R Package for Genetic Association Studies
by: Lin Wang, et al.
Published: (2020-06-01)