Franco-Dutch YEP Workshop
May 28 - Jun 1
“Mathematical Statistical Mechanics, Random Graphs and Related Topics”
Aléa-Networks-Eurandom fellowships for the Franco-Dutch YEP
To apply for support for travel/accommodation, please see: GdRI CNRS AléaNetworks
The model of the workshop will be the Young European Probalilists series (YEP) that are held annually in Eurandom, consisting of mini-courses and regular talks from both “junior” or “senior” researchers from the Dutch and French probabililist communities.
The meeting is co-organized within the stochastic groups of TU Eindhoven and Université Paris-Est Créteil within their common CNRS affiliation, and intend to be the occasion to advert and celebrate the renewal of the CNRS-UMI affiliation of Eurandom.
Remco van der Hofstad (TU Eindhoven)
Arnaud Le Ny (CNRS UPEC Paris Est)
The conference will contain two mini-courses of
– Pierre Picco (CNRS Marseille)
– Béatrice de Tilière (UPEC Paris-Est)
There will be talks from invited speakers, in and around the mini-course areas ; Currently confirmed speakers are
– Luca Avena (Leiden University)
– Rob van den Berg (CWI Amsterdam)
– Hao Can (Kyoto University)
– Aurélia Deshayes (Université Paris Diderot)
– Robert Fitzner (TU Eindhoven)
– Hakan Guldas (Leiden University)
– Alexandre Gaudillière (CNRS Marseille)
– Bénédicte Haas (Université Paris Nord)
– Frank den Hollander (Leiden University)
– Tim Hulshof (TU Eindhoven)
– Bruno Kimura (TU Delft)
– Irène Marcovici (Université de Lorraine)
– Cyril Marzouk (Université Paris-Sud)
– Frank Redig (TU Delft)
– Clara Stegehuis (TU Eindhoven)
– Daniel Valesin (University of Groningen)
On Friday afternoon, June 1, there will be a celebration of the extension of the CNRS label UMI that is awarded to Eurandom. We cordially invite you to attend this special afternoon.
Random walks on dynamic configuration models: a trichotomy
In this talk, first I will introduce dynamic configuration model which is a dynamic random graph model in discrete time. Then, I will go into details of our results about mixing times of random walks on dynamic configuration model. The results I will give identify the behaviour of mixing times in terms of the proportion of edges that changes at every step of graph dynamics when the number of vertices is large.
(joint work with Luca Avena, Remco van der Hofstad and Frank den Hollander)
Frank den Hollander
Spatially Extended Pinning
We consider a directed polymer interacting with a linear interface. The
monomers carry random charges. Each monomer contributes an energy to the
interaction Hamiltonian that depends on its charge as well as its height
with respect to the interface, modulated by an interaction potential.
The configurations of the polymer are weighted according to the Gibbs
measure associated with the interaction Hamiltonian at a given inverse
temperature, where the reference measure is given by a recurrent Markov
We are interested in both the quenched and the annealed free energy per
monomer in the limit as the polymer becomes large. We find that each
exhibits a phase transition along a critical curve separating a localized
phase (where the polymer stays close to the interface) from a delocalized
phase (where the polymer wanders away from the interface). We obtain
variational formulas for the critical curves, and find that the quenched
phase transition is at least of second order. We obtain upper and lower
bounds on the quenched critical curve in terms of the annealed critical
curve. In addition, for the special case where the reference measure is
given by a Bessel random walk, we identify the weak disorder scaling limit
of the annealed free energy and the annealed critical curve in three
different regimes for the tail exponent of the interaction potential.
(joint work with Francesco Caravenna, University of Milano-Bicocca, Italy)
Ergodicity of some classes of cellular automata subject to noise
Cellular automata (CA) are dynamical systems on symbolic configurations on the lattice. They are also used as models of massively parallel computers. As dynamical systems, one would like to understand the effect of small random perturbations on the dynamics of CA. As models of computation, they can be used to study the reliability of computation against noise.
We consider various families of CA and prove that they are highly unstable against noise, meaning that they forget their initial conditions under slightest positive noise. This is manifested as the ergodicity of the resulting probabilistic CA. For instance, we prove that if the deterministic model is either nilpotent (highly stable) or permutive (highly chaotic), its small random perturbations are ergodic.
We are also interested in the sensitivity of tilings against noise, and I will briefly discuss the links between these two problems.
(joint work with Mathieu Sablik and Siamak Taati)
There is no registration fee, but registration is compulsory for organizational purposes.
Please follow this link to register online.
Link to Information Page