| [home] - [up] |
Abstract: In this talk I will introduce some relevant problems in computational molecular biology - from sequence analysis to chip design - and give a short overview of the current solutions and possible problems.
Colloquium - 16:00
Abstract: Given a graph H, a random maximal H-free graph is constructed by the following random greedy process. First assign to each edge of the complete graph on n vertices a birthtime which is uniformly distributed in [0,1]. At time p=0 start with the empty graph and increase p gradually. Each time a new edge is born, it is included in the graph if this does not create a copy of H. The question is then how many edges such a graph will have when p=1.
I want to talk about special cases where the number of edges is concentrated around more than one value.