This work is about the disconnection of graphs by trajectories of random walks. Computer simulations show that the components left in a large graph after removing the trajectory of a simple random walk of a suitable timescale exhibit interesting phase transitions, not unlike the ones encountered in the widely studied field of random graphs. Disconnection phenomena of this kind are only beginning to be understood at a mathematically rigorous level. This thesis contributes to the field in several directions. The author studies the influence of a bias on the disconnection time of a discrete...

Depressionen, die Liebe und Kritiken an Drogen und Konsum sind die Hauptthemen dieser Gedichtsammlung. Es wird mit meist düsteren Texten zum Denken angeregt, nein vielmehr dazu aufgerufen.