Some old and recent results on automata networks and update modes
Speaker: Prof. Sylvain Sené (Université de Marseille, France)
Thời gian: 14h chiều Thứ 5, ngày 19/11/2026
Địa điểm: Phòng 507 nhà A6
Tóm tắt: An automata network is classically defined as a set of entities (the automata) which interact with each other over discrete time. More formally, an automata network composed of n automata is a collection of n local functions which define how each automaton computes its state based on the states of those influencing it. Research on these objects has shown that, given an automata network, distinct dynamics can be associated with it depending on how the updates of the automaton states are organized over time (i.e., the update modes). By restricting ourselves to Boolean networks and periodic update modes, we will discuss in this presentation some of the main results highlighting the importance of not ignoring update modes when studying automata networks, whether in the computational context or in the modeling context.
Related Seminars
- Superconcentration in Some Models of Statistical Physics (Tính siêu tập trung của một số mô hình trong vật lý thống kê)
- Moments and logarithmic intermittency of the Critical 2D Stochastic Heat Flow
- On the proof of Gaussian Product Inequality
- Lyapunov exponents for the simple random walk in random potentials
- On the Geometry of Separation in Finite Gaussian Mixtures
- Convergence Rates for Latent Mixing Measures in Infinite Homoscedastic Location-Scale Mixture Models
- Fluctuation of the mangetization and maximum likelihood estimator in mean field spin models
- Edgeworth expansion on Wiener chaos
- On the stability for the convergence in law of polynomial chaoses
- On critical points and zeros of iterated derivatives of random polynomials
Featured News
View allUpcoming Conferences
View allNo upcoming conferences/workshops yet.
New Publications
View allInstitute Lectures
View allSpeaker: Claude Sabbah (CNRS, École Polytechnique, Institut Polytechnique de Paris, France)