The Math Club presents Petra Berenbrink.
Thurs, March 19
2:30-4 pm
Abby B121
Abstract: In my talk I will present several randomized graph-
based algorithms. The first algorithm is a random walk process
on a graph. Here we analyze the so-called cover time of the
process. The second algorithm comes from the area of game
theory. The task of the selfish agents is to distribute their tasks
over a set of servers. The goal of every agent is to allocate his
own task to a server with minimum load. The last process is a
so-called voting process which spreads opinions in a network.
http://www.ufv.ca/math/math-club-talks/
For more information, contact Gabriel Murray at gabriel.murray@ufv.ca
03/20/2015