{"id":7342,"date":"2015-03-11T12:18:08","date_gmt":"2015-03-11T19:18:08","guid":{"rendered":"http:\/\/blogs.ufv.ca\/announce\/?p=7342"},"modified":"2015-03-27T09:44:50","modified_gmt":"2015-03-27T16:44:50","slug":"analysis-of-randomized-algorithms-a-talk-by-petra-berenbrink","status":"publish","type":"post","link":"https:\/\/blogs.ufv.ca\/announce\/2015\/03\/11\/analysis-of-randomized-algorithms-a-talk-by-petra-berenbrink\/","title":{"rendered":"Analysis of Randomized Algorithms: a talk by Petra Berenbrink &#8212; March 19"},"content":{"rendered":"<p>The Math Club presents Petra Berenbrink.<\/p>\n<p>Thurs, March 19<br \/>\n2:30-4 pm<br \/>\nAbby B121<\/p>\n<p>Abstract: In my talk I will present several randomized graph-<br \/>\nbased algorithms. The first algorithm is a random walk process<br \/>\non a graph. Here we analyze the so-called cover time of the<br \/>\nprocess. The second algorithm comes from the area of game<br \/>\ntheory. The task of the selfish agents is to distribute their tasks<br \/>\nover a set of servers. The goal of every agent is to allocate his<br \/>\nown task to a server with minimum load. The last process is a<br \/>\nso-called voting process which spreads opinions in a network.<\/p>\n<p><a href=\"http:\/\/www.ufv.ca\/math\/math-club-talks\/\" target=\"_blank\">http:\/\/www.ufv.ca\/math\/math-club-talks\/<\/a><\/p>\n<p>For more information, contact Gabriel Murray at <a href=\"mailto:gabriel.murray@ufv.ca\">gabriel.murray@ufv.ca<\/a><\/p>\n<p style=\"color: #fff;\">03\/20\/2015<\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 &#8230; <a title=\"Analysis of Randomized Algorithms: a talk by Petra Berenbrink &#8212; March 19\" class=\"read-more\" href=\"https:\/\/blogs.ufv.ca\/announce\/2015\/03\/11\/analysis-of-randomized-algorithms-a-talk-by-petra-berenbrink\/\">Read more<\/a><\/p>\n","protected":false},"author":13,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"generate_page_header":"","footnotes":""},"categories":[1],"tags":[],"class_list":["post-7342","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/posts\/7342","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/users\/13"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/comments?post=7342"}],"version-history":[{"count":5,"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/posts\/7342\/revisions"}],"predecessor-version":[{"id":7379,"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/posts\/7342\/revisions\/7379"}],"wp:attachment":[{"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/media?parent=7342"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/categories?post=7342"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ufv.ca\/announce\/wp-json\/wp\/v2\/tags?post=7342"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}