Topics of seminar talks
Speakers and calendar of seminar talks
Last update: 07.05.2018
If you are interested in giving a seminar talk, please write an email to the lecturers and the assistent with your 3 most preferred topics. Slots will be given away on a first come, first served basis.
Dates and locations
Mondays, 14:1515:45, TU MA 648
Tuesdays, until 27 April: 10:1511:45, TU MA 751, from May: 14:1515:45, TU MA 748
Seminar calendar
Date of talk  Concept paper deadline  Title and speaker  Prerequisites 
12.06  29.05  #10: [S] by Tobias Max Hentschel  
18.06  04.06  #5: [H] by Saba Bokredenghel  
19.06  05.06  #8: [HJC] by Leonard Scharff  
25.06   Prof. Deuschel's conference  
26.06   Prof. Deuschel's conference  
02.07  18.06  #3: [AT] by Frederik Siedler  
03.07  19.06  #4: [DDLS] by Alexander Vogler  
09.07  25.06  #2: [DFMMT] by Regine Löffler  #1 [DBT] (no speaker). The description of this talk has slightly changed! 
10.07  26.06  #6: [BY1] by Heide Langhammer  
16.07  02.07  #7: [BY2] by Josephine Paikert  #2, #6 (for reference, [BY2] is mostly selfcontained) 
17.07  03.07  #12: [FDTsT] by Raphael Eichhorn  
Papers (the list may change according to the number of speakers)
The content recommendations are included as an orientation for planning your talk. Nevertheless, you should read the entire paper that you are working on!
Complexity levels:
+: relatively simple, also accessible for Bachelor students.
++: more complex, for Bachelor students who are interested in writing a Bachelor's thesis about some topic related to the lecture&seminar, or for Master students in general.
+++: rather advanced, for Master students who want to specialize in the topic (e.g, who are interested in writing a Master's thesis related to the lecture&seminar).
Prerequisites
Within one topic, the talks follow each other in consecutive order. It may be useful to check the earlier papers in the topic of your talk.
Numbers in brackets (n): prerequisite talks that are needed for the audience to understand the given talk.
In case the speaker for the prerequisite talk is missing, we will kindly ask the speaker to choose a different topic, e.g., the prerequisite talk itself.
List of topics for the student talks
Topic 1: Continuum percolation (including signaltointerference ratio percolation)
1.1 Signaltointerference ratio percolation for Poisson point processes

+ [DBT]: O. Dousse, F. Baccelli, P. Thiran. Impact of interferences on connectivity in adhoc networks.
(Introduction of the SINR percolation model. Theorem 1 with proof. Phase transitions: Theorems 2 and 4 with proof sketch. Role of bounded support+boundedness of the attenuation function in these theorems. For Section IV, a short summary is enough.)
WARNING: This paper also has a nonfull version available online, in which the section "D. Asymptotic Results for Large lambda" is missing.

++ (1) [DFMMT]: O. Dousse, M. Franceschetti, N. Macris, R. Meester and P. Thiran, Percolation in the signal to interference ratio graph.
(Introducing the SINR model, conditions on the attenuation function. Percolation: Theorem 1 with sketch of proof, explaining how it improves Theorem 2 of [DBT]. How would you prove Corollary 1? Does it always hold if the attenuation function has compact support?)
1.2 Other new models of continuum percolation based on Poisson point processes

++ [AT] D. Ahlberg, J. Tykesson. Gilbert's disc model with geostatistical marking.
(Model definition. Phase transitions: Theorem 1 with sketch of proof. Overview of all results of Section 2. Free choice: proof sketch of the main result from Section 2.2, 2.3 or 2.4.
Overview of Sections 3 and 5, proofs can be sketched or omitted here.)

+++ [DDLS] D. Coupier, D. Dereudre and S. Le Stum. Absence of percolation for Poisson outdegreeone graphs.
(Introduction of the model, main examples. Theorem 3.1, sketch of proof from Section 4.1, and all other parts of the proof that you find important to mention, the rest can be omitted. Theorem 3.2 with main ideas of the proof.)

++ [H] C. Hirsch. Bounded hop percolation.
(Model definition. Subcritical phase: Proposition 1 + Theorem 2 with sketch of proof. Theorem 3 and its corollaries, main steps of proof. Theorem 6 with main ideas of proof, technical computations can be left out, but explain Figure 2 if it fits into time.)
1.3 Continuum percolation for nonPoissonian point processes

++ [BY1] B. Błaszczyszyn, D. Yogeshwaran. Directionally Convex Ordering of Random Measures, Shot Noise Fields and Some Applications to Wireless Communications.
(Definition of dcx ordering, Theorem 2.1 with main steps of proof. Overview of the results of Section 3. Free choice: 12 proofs from Section 3, 12 examples from Section 5 and 12 applications from Section 6.)

++ (6) [BY2] B. Błaszczyszyn, D. Yogeshwaran. Clustering and percolation of point processes.
(Main goals of the paper, definitions of sub/superPoisson processes, recalling dcx ordering from [BY1] /see 6th talk/.
Theorem 1.3+results of Section 3.3 with main ideas of proof, and with the auxiliary results from Sections 2, 3.1, 3.2 if they are needed.
Afterwards, free choice: either stating the SINR percolation results of Section 3.4 with main ideas of proof and a comparison to [DFMMT, Theorem 1], or sketching the example of Section 4 and explaining its importance.)
For motivation why to study such SINR graphs, see also: Connectivity in subPoisson networks by the same authors.

++ [HJC] C. Hirsch, B. Jahnel and E. Cali. Continuum percolation for Cox point processes.
(Model definition. Phase transitions: Theorems 2.4, 2.5 with proof. Palm calculus for Cox processes. Overview of the results of Sections 2.2, the proofs of which can be sketched or completely omitted.
Examples 3.1, 3.2 with the computations therein.)
 +++ [GKP] S. Ghosh, M. Khrisnapur, Y. Peres. Continuum Percolation for Gaussian zeroes and Ginibre eigenvalues.
PART 1 of the paper: Existence of a critical radius for the GAF process.
(The goal of the talk is to explain and to prove the first sentence of Theorem 1.2. Definition of the GAF zero process, results of Section 3 with sketch of proof. Main steps of the proof of Theorem 1.2 [existence of a critical radius] in Section 4.1: without many technical details, but with an explanation what the Cantor set type construction is used for. The Ginibre ensemble and Section 5 about uniqueness of the infinite cluster should be left out from the talk, it is enough to read these parts. )

++ [S] K. Stucki. Continuum percolation for Gibbs point processes.
(Model definition and preliminaries from Section 2. Theorem 3.1 with Remark 3.2 and main ideas of proof, Theorem 3.3 with proof, Remark 3.4 and Example 3.5. Proposition 4.1 with proof, the discussion after the proof is not necessary.)
This may be a useful reference: David Dereudre: Introduction to the theory of Gibbs point processes.
Topic 2: Capacity of wireless networks (followup works of the GuptaKumar paper)
 + [GTs] M. Grossglauser, D. Tse. Mobility increases the capacity of adhoc networks.
(Short overview of the results without mobility. Results of Sections III.B and III.C with proof, longer computations can be shortened. Section III.E can be omitted, and for Sections III.D, III.F and IV., a short summary is sufficient.)

++ [FDTsT] M. Franceschetti, O. Dousse, D. Tse and P. Thiran. Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory.
(Main result of the paper and its relevance. Sketch of the proof, highway construction. Overview of Section VII about dense networks. Technical details can be omitted, the proof of the results in the Appendix can be left out.)
Topic 3: Timedependence and mobility in networks (thermodynamic limit)

++ [DFK] H. Döring, G. Faraud and W. König. Connection times in large adhoc mobile networks.
PART 1 of the paper: Connection time of two participants in the thermodynamic limit.
(Model definition. Theorem 1.2 with sketch of proof and interpretation (local+global constraint). Discussion of Section 1.3. Sections 1.4 and 4 should be left out from the talk, it is enough to read them.)
Requirements and auxiliary materials