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

[Tobias Nipkow]

Diploma -> Interdisciplinary Project (IDP)

Tobias

Am 10/11/2012 00:50, schrieb 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 interested
> in the probability that a random graph contains a certain pattern, for
> example a circle or a clique. A very high edge probability gives rise to
> perhaps too many edges (which degrades performance for many algorithms),
> whereas a low edge probability might result in a disconnected graph. In
> this work, we proved a theorem about a threshold probability such that a
> higher edge probability will asymptotically almost surely produce a
> random graph containing the desired subgraph.
> 
> 
> 
> _______________________________________________
> Club2 mailing list
> List page: https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/club2
> Webpage with calendar: http://www21.in.tum.de/club2
>