A reaction network is a graphical configuration that describes an interaction between species (molecules). If the abundances of the network system is small, then the randomness inherent in the molecular
interactions is important to the system dynamics, and the abundances are modeled stochastically as a jump by jump fashion continuous-time Markov chain. One of challenging issues facing researchers who study biological

systems is the often extraordinarily complicated structure of their interaction networks. Thus, how to characterize network structures that induce characteristic behaviors of the system dynamics is one of the major open questions in this literature.

In this talk, I will provide an analytic approach to find a class of reaction networks whose associated Markov process has a stationary distribution. Moreover I will talk about the convergence rate for the process to its stationary distribution with the mixing time.

This talk concerns a twenty-thousand-year old mistake: The natural numbers record only the result of counting and not the process of counting. As algebra is rooted in the natural numbers, the higher algebra of Joyal and Lurie is rooted in a more basic notion of number which also records the process of counting. Long advocated by Waldhausen, the arithmetic of these more basic numbers should eliminate denominators. Notable manifestations of this vision include the Bökstedt-Hsiang-Madsen topological cyclic homology, which receives a denominator-free Chern character, and the related Bhatt-Morrow-Scholze integral p-adic Hodge theory, which makes it possible to exploit torsion cohomology classes in arithmetic geometry. Moreover, for schemes smooth and proper over a finite field, the analogue of de Rham cohomology in this setting naturally gives rise to a cohomological interpretation of the Hasse-Weil zeta function by regularized determinants, as envisioned by Deninger.

This is the seventh in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. We will continue discussing the Borel hierarchy.

In this talk, we shall study certain aspects of the long term behavior of stationary Gaussian process through building polynomials on the unit circle.  No prior knowledge of, or familiarity with, Gaussian processes are required to understand this talk.  Joint work with Naomi Feldheim, Ohad Feldheim, Fedor Nazarov, and Shahaf Nitzan.

This is the sixth in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. We will begin discussing the Borel hierarchy.