Dynamical arrest, tracer diffusion and Kinetically Constrained Lattice Gases

We analyze the tagged particle diffusion for kinetically constrained models for glassy systems. We present a method, focusing on the Kob-Andersen model as an example, which allows to prove lower and upper bounds for the self diffusion coefficient $D_S$. This method leads to the exact density dependence of $D_{S}$, at high density, for models with finite defects and to prove diffusivity, $D_{S}>0$, at any finite density for highly cooperative models. A more general outcome is that under very general assumptions one can exclude that a dynamical transition, like the one predicted by the Mode-Coupling-Theory of glasses, takes place at a finite temperature/chemical potential for systems of interacting particles on a lattice.Comment: 28 pages, 4 figure

Group Testing with Random Pools: optimal two-stage algorithms

We study Probabilistic Group Testing of a set of N items each of which is defective with probability p. We focus on the double limit of small defect probability, p>1, taking either p->0 after $N\to\infty$ or $p=1/N^{\beta}$ with $\beta\in(0,1/2)$. In both settings the optimal number of tests which are required to identify with certainty the defectives via a two-stage procedure, $\bar T(N,p)$, is known to scale as $Np|\log p|$. Here we determine the sharp asymptotic value of $\bar T(N,p)/(Np|\log p|)$ and construct a class of two-stage algorithms over which this optimal value is attained. This is done by choosing a proper bipartite regular graph (of tests and variable nodes) for the first stage of the detection. Furthermore we prove that this optimal value is also attained on average over a random bipartite graph where all variables have the same degree, while the tests have Poisson-distributed degrees. Finally, we improve the existing upper and lower bound for the optimal number of tests in the case $p=1/N^{\beta}$ with $\beta\in[1/2,1)$.Comment: 12 page

Spiral Model: a cellular automaton with a discontinuous glass transition

We introduce a new class of two-dimensional cellular automata with a bootstrap percolation-like dynamics. Each site can be either empty or occupied by a single particle and the dynamics follows a deterministic updating rule at discrete times which allows only emptying sites. We prove that the threshold density $\rho_c$ for convergence to a completely empty configuration is non trivial, $0<\rho_c<1$, contrary to standard bootstrap percolation. Furthermore we prove that in the subcritical regime, $\rho<\rho_c$, emptying always occurs exponentially fast and that $\rho_c$ coincides with the critical density for two-dimensional oriented site percolation on \bZ^2. This is known to occur also for some cellular automata with oriented rules for which the transition is continuous in the value of the asymptotic density and the crossover length determining finite size effects diverges as a power law when the critical density is approached from below. Instead for our model we prove that the transition is {\it discontinuous} and at the same time the crossover length diverges {\it faster than any power law}. The proofs of the discontinuity and the lower bound on the crossover length use a conjecture on the critical behaviour for oriented percolation. The latter is supported by several numerical simulations and by analytical (though non rigorous) works through renormalization techniques. Finally, we will discuss why, due to the peculiar {\it mixed critical/first order character} of this transition, the model is particularly relevant to study glassy and jamming transitions. Indeed, we will show that it leads to a dynamical glass transition for a Kinetically Constrained Spin Model. Most of the results that we present are the rigorous proofs of physical arguments developed in a joint work with D.S.Fisher.Comment: 42 pages, 11 figure

Diffusive scaling of the Kob-Andersen model in Zd\mathbb{Z}^d

We consider the Kob-Andersen model, a cooperative lattice gas with kinetic constraints which has been widely analyzed in the physics literature in connection with the study of the liquid/glass transition. We consider the model in a finite box of linear size $L$ with sources at the boundary. Our result, which holds in any dimension and significantly improves upon previous ones, establishes for any positive vacancy density $q$ a purely diffusive scaling of the relaxation time $T_{\rm rel}$ of the system. Furthermore, as $q\downarrow 0$ we prove upper and lower bounds on $L^{-2} T_{\rm rel} (q,L)$ which agree with the physicists belief that the dominant equilibration mechanism is a cooperative motion of rare large droplets of vacancies. The main tools combine a recent set of ideas and techniques developed to establish universality results for kinetically constrained spin models, with methods from bootstrap percolation, oriented percolation and canonical flows for Markov chains

Kinetically Constrained Models

In this chapter we summarize recent developments in the study of kinetically constrained models (KCMs) as models for glass formers. After recalling the definition of the KCMs which we cover we study the possible occurrence of ergodicity breaking transitions and discuss in some detail how, before any such transition occurs, relaxation timescales depend on the relevant control parameter (density or temperature). Then we turn to the main issue: the prediction of KCMs for dynamical heterogeneities. We focus in particular on multipoint correlation functions and susceptibilities, and decoupling in the transport coefficients. Finally we discuss the recent view of KCMs as being at first order coexistence between an active and an inactive space-time phase.Comment: Chapter of "Dynamical heterogeneities in glasses, colloids, and granular media", Eds.: L. Berthier, G. Biroli, J-P Bouchaud, L. Cipelletti and W. van Saarloos (Oxford University Press, to appear), more info at http://w3.lcvn.univ-montp2.fr/~lucacip/DH_book.ht