Amod Basnet, UNC Charlotte
Title: Parallel computation of invariant distribution for Markov Chains with Islands and Ports
Amod Basnet, UNC Charlotte
Title: Parallel computation of invariant distribution for Markov Chains with Islands and Ports
Isaac Sonin, UNC Charlotte
Title: Censored Markov chains and their applications.
Boris Khoruzhenko, Queen Mary University of London
Title: How many stable equilibria will a large complex system have?
Abstract: In 1972 Robert May argued that (generic) complex systems become unstable to small displacements from equilibria as the system complexity increases. In search of a global signature of this instability transition, we consider a class of nonlinear dynamical systems whereby N degrees of freedom are coupled via a smooth homogeneous Gaussian vector field. Our analysis shows that with the increase in complexity, as measured by the number of degrees of freedom and the strength of interactions relative to the relaxation strength, such systems undergo an abrupt change from a simple set of equilibria (a single stable equilibrium for N large) to a complex set of equilibria. Typically, none of these equilibria are stable and their number is growing exponentially with N. This suggests that the loss of stability manifests itself on the global scale in an exponential explosion in the number of equilibria. [My talk based on a joint paper with Yan Fyodorov and on an unpublished work with Gerard Ben Arous and Yan Fyodorov]
Kevin McGoff, UNC Charlotte
Title: Random subshifts of finite type Part 3
Kevin McGoff, UNC Charlotte
Title: Random subshifts of finite type: Tools and methods
Kevin McGoff, UNC Charlotte
Title: Random subshifts of finite type: An introduction
Stanislav Molchanov, UNC Charlotte
Title: Symmetric random walks on dense subgroups of the real line: local and quasilocal theorems (Part 2)
Stanislav Molchanov, UNC Charlotte
Title: Symmetric random walks on dense subgroups of the real line: local and quasilocal theorems
Gabor Hetyei, UNC Charlotte |
Title: Nontransitive coins and semiacyclic tournaments |
Abstract: We provide necessary and sufficient conditions for a tournament to be the dominance graph of a set of unfair coins. We completely characterize the tournaments that are dominance graphs of sets of coins in which each coin displays its larger side with greater probability. The class of these tournaments coincides with the class of tournaments whose vertices can be numbered in a way that makes them semiacyclic, as defined by Postnikov and Stanley. We provide an example of a tournament on nine vertices that can not be made semiacyclic, yet it may be represented as a dominance graph of coins, if we also allow coins that display their smaller side with greater probability. We conclude with an example of a tournament with 81 vertices that is not the dominance graph of any system of coins. |
Stanislav Molchanov, UNC Charlotte
Title: Random Walks and Diffusion Processes on the Lobachevsky Plane Part 2