This talk is about the complex dynamics, which cares the iteration of holomorphic map (usually a rational map on the Riemann sphere), and the shift locus is a nice set of polynomials that all critical points escape to infinity under iteration. Understanding the shape and topology of shift locus is a challenge for decades, and accumulated works are done by Blanchard, Branner, Hubbard, Keen, McMullen, and recently Calegari introduce a nice lamination model. In this talk I will explain the basic complex dynamics and introduce the topology of the shift locus of cubic polynomials done by Calegari's paper 'Sausages and Butcher paper' and if time allows, I will end this talk with the connection to the Big mapping class group, the MCG of Sphere - Cantor set.

Compositional data analysis with a high proportion of zeros has gained increasing popularity, especially in chemometrics and human gut microbiomes research. Statistical analyses of this type of data are typically carried out via a log-ratio transformation after replacing zeros with small positive values. We should note, however, that this procedure is geometrically improper, as it causes anomalous distortions through the transformation. We propose a radial transformation that does not require zero substitutions and more importantly results in essential equivalence between domains before and after the transformation. We show that a rich class of kernels on hyperspheres can successfully define a kernel embedding for compositional data based on this equivalence. The applicability of the proposed approach is demonstrated with kernel principal component analysis.

We will discuss on large time behavior of the one dimensional barotropic compressible Navier-Stokes equations with initial data connecting two different constant states. When the two constant states are prescribed by the Riemann data of the associated Euler equations, the Navier-Stokes flow would converge to a viscous counterpart of Riemann solution. This talk will present the latest result on the cases where the Riemann solution consist of two shocks, and introduce the main idea for using to prove.

Deep neural networks have proven to work very well on many complicated tasks. However, theoretical explanations on why deep networks are very good at such tasks are yet to come. To give a satisfactory mathematical explanation, one recently developed theory considers an idealized network where it has infinitely many nodes on each layer and an infinitesimal learning rate. This simplifies the stochastic behavior of the whole network at initialization and during the training. This way, it is possible to answer, at least partly, why the initialization and training of such a network is good at particular tasks, in terms of other statistical tools that have been previously developed. In this talk, we consider the limiting behavior of a deep feed-forward network and its training dynamics, under the setting where the width tends to infinity. Then we see that the limiting behaviors can be related to Bayesian posterior inference and kernel methods. If time allows, we will also introduce a particular way to encode heavy-tailed behaviors into the network, as there are some empirical evidences that some neural networks exhibit heavy-tailed distributions.