Timo Dewenter

Learn More
We study the vertex-cover problem, which is a nondeterministic polynomial-time hard optimization problem and a prototypical model exhibiting phase transitions on random graphs, such as Erdős-Rényi (ER) random graphs. These phase transitions coincide with changes of the solution space structure, e.g., for the ER ensemble at connectivity c=e≈2.7183 from(More)
We study the polygons governing the convex hull of a point set created by the steps of n independent two-dimensional random walkers. Each such walk consists of T discrete time steps, where x and y increments are independent and identically distributed Gaussian. We analyze area A and perimeter L of the convex hulls. We obtain probability densities for these(More)
  • 1