uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Greedy walks on two lines
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Probability Theory.
2016 (English)Article in journal (Other academic) Submitted
Place, publisher, year, edition, pages
2016.
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:uu:diva-305792OAI: oai:DiVA.org:uu-305792DiVA: diva2:1039187
Available from: 2016-10-21 Created: 2016-10-21 Last updated: 2016-10-23
In thesis
1. On Directed Random Graphs and Greedy Walks on Point Processes
Open this publication in new window or tab >>On Directed Random Graphs and Greedy Walks on Point Processes
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

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 comparable vertices present with probability p, independently of all other edges, and each edge is directed from the vertex with smaller label to the vertex with larger label. In Paper I we consider a directed random graph on ℤ2 with the vertices ordered according to the product order and we show that the limiting distribution of the centered and rescaled length of the longest path from (0,0) to (n, [na] ), a<3/14, is the Tracy-Widom distribution. In Paper II we show that, under a suitable rescaling, the closure of vertex 0 of a directed random graph on ℤ with edge probability n−1 converges in distribution to the Poisson-weighted infinite tree. Moreover, we derive limit theorems for the length of the longest path of the Poisson-weighted infinite tree.          

The greedy walk is a deterministic walk on a point process that always moves from its current position to the nearest not yet visited point. Since the greedy walk on a homogeneous Poisson process on the real line, starting from 0, almost surely does not visit all points, in Paper III we find the distribution of the number of visited points on the negative half-line and the distribution of the index at which the walk achieves its minimum. In Paper IV we place homogeneous Poisson processes first on two intersecting lines and then on two parallel lines and we study whether the greedy walk visits all points of the processes. In Paper V we consider the greedy walk on an inhomogeneous Poisson process on the real line and we determine sufficient and necessary conditions on the mean measure of the process for the walk to visit all points.

Place, publisher, year, edition, pages
Uppsala: Department of Mathematics, 2016. 28 p.
Series
Uppsala Dissertations in Mathematics, ISSN 1401-2049 ; 97
Keyword
Directed random graphs, Tracy-Widom distribution, Poisson-weighted infinite tree, Greedy walk, Point processes
National Category
Probability Theory and Statistics
Identifiers
urn:nbn:se:uu:diva-305859 (URN)978-91-506-2608-7 (ISBN)
Public defence
2016-12-09, Polhemsalen, Ångströmlaboratoriet, Lägerhyddsvägen 1, Uppsala, 13:15 (English)
Opponent
Supervisors
Available from: 2016-11-15 Created: 2016-10-23 Last updated: 2016-11-15

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Gabrysch, Katja
By organisation
Analysis and Probability Theory
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar

Total: 63 hits
ReferencesLink to record
Permanent link

Direct link