Some new problems on random walks and exclusion processes
Ricardo Mendonça (Uni. de Sao Paolo)
In this informal talk I am going to present two problems related with random walks and exclusion processes: the longest-increasing subsequence (LIS) problem for random walks and the symmetric simple exclusion process in discrete time over graphs. The first problem corresponds to a new incarnation of the LIS problem for discrete i.i.d. variables (random permutations), but now with correlated variables, while the second problem touches on many interesting (and hard) problems in combinatorics, computer science, and graph theory. So far I have more questions than answers, so your attendance, comments and contributions are welcome!