Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, June 01, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Ahad N. Zehmakan

Opinion spreading in random geometry

Assume we have a population with N individuals, which have to decide whether or not to accept a reform proposal. In the initial configuration, the proposal has a support by N_+ individuals leaving N-N_+ persons against it. By starting from an initial configuration, at each round people gather randomly in fixed rooms (meeting cells) of different sizes, where the summation of the number of seats in all rooms is equal to N, and all individuals in a room adopt the most frequent opinion in the room and in case of a tie, they all adopt the negative opinion. We discuss different aspects of the behavior of this natural random process.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login