Uncertainty Quantification Seminar Prof. dr. Siva Athreya, Indian Stat. Inst.

Respondent-Driven Sampling and Random Graph Convergence
  • What Scientific Computing English
  • When 05-02-2019 from 11:00 to 12:00 (Europe/Amsterdam / UTC100)
  • Where F1.15 (Nikhef building, Sciencepark 105-107)
  • Contact Name
  • Web Visit external website
  • Add event to calendar iCal

We consider certain respondent-driven sampling procedures on dense and sparse graphs. Under the assumption that the sequence of the vertex-sets is ergodic we understand possible limiting graphs. In the dense regime they can be expressed in terms of the original dense graph via a transformation related to the invariant measure of the ergodic sequence. In the sparse regime by a specific clumping procedure of the sampled vertices we construct a sequence of sparse graphs which converge to the governing graphon in the cut-metric.