[Club2] IDP, Lars Hupel: Tue., Nov. 20, 14:00, Room 01.09.014 ("Alonzo Church")

[Andrei Popescu]

Dear All,  
On Tuesday Nov. 20, Lars Hupel will give his Diploma presentation on random graph probabilities. 
Best regards,   Andrei 
Lars Hupel Proofs about Random Graphs in Isabelle: Subgraph Containment (IDP)====================================================Tue. Nov. 20, 14:00, Room 01.09.014 ("Alonzo Church") 
Random graphs are graphs with a fixed number of vertices,where each edge is present with a fixed probability. We are interestedin the probability that a random graph contains a certain pattern, forexample a circle or a clique. A very high edge probability gives rise toperhaps too many edges (which degrades performance for many algorithms),whereas a low edge probability might result in a disconnected graph. Inthis work, we
 proved a theorem about a threshold probability such that ahigher edge probability will asymptotically almost surely produce arandom graph containing the desired subgraph.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailmanbroy.informatik.tu-muenchen.de/pipermail/club2/attachments/20121109/fa0991fc/attachment.html>