Ictal epileptic headache. an old story with courses and appeals

The term "ictal epileptic headache" has been recently proposed to classify the clinical picture in which headache is the isolated ictal symptom of a seizure. There is emerging evidence from both basic and clinical neurosciences that cortical spreading depression and an epileptic focus may facilitate each other, although with a different degree of efficiency. This review address the long history which lead to the 'migralepsy' concept to the new emerging pathophysiological aspects, and clinical and electroencephalography evidences of ictal epileptic headache. Here, we review and discuss the common physiopathology mechanisms and the historical aspects underlying the link between headache and epilepsy. Either experimental or clinical measures are required to better understand this latter relationship: the development of animal models, molecular studies defining more precise genotype/phenotype correlations as well as multicenter clinical studies with revision of clinical criteria for headache-/epilepsy-related disorders represent the start of future research. Therefore, the definition of ictal epileptic headache should be used to classify the rare events in which headache is the only manifestation of a seizure. Finally, using our recently published criteria, we will be able to clarify if ictal epileptic headache represents an underestimated phenomenon or not

Entanglement entropy of two disjoint blocks in critical Ising models

We study the scaling of the Renyi and entanglement entropy of two disjoint blocks of critical Ising models, as function of their sizes and separations. We present analytic results based on conformal field theory that are quantitatively checked in numerical simulations of both the quantum spin chain and the classical two dimensional Ising model. Theoretical results match the ones obtained from numerical simulations only after taking properly into account the corrections induced by the finite length of the blocks to their leading scaling behavior.Comment: 4 pages, 5 figures. Revised version accepted for publication in PR

Metastability of Logit Dynamics for Coordination Games

Logit Dynamics [Blume, Games and Economic Behavior, 1993] are randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random and she chooses a new strategy according to a probability distribution biased toward strategies promising higher payoffs. This process defines an ergodic Markov chain, over the set of strategy profiles of the game, whose unique stationary distribution is the long-term equilibrium concept for the game. However, when the mixing time of the chain is large (e.g., exponential in the number of players), the stationary distribution loses its appeal as equilibrium concept, and the transient phase of the Markov chain becomes important. It can happen that the chain is "metastable", i.e., on a time-scale shorter than the mixing time, it stays close to some probability distribution over the state space, while in a time-scale multiple of the mixing time it jumps from one distribution to another. In this paper we give a quantitative definition of "metastable probability distributions" for a Markov chain and we study the metastability of the logit dynamics for some classes of coordination games. We first consider a pure $n$-player coordination game that highlights the distinctive features of our metastability notion based on distributions. Then, we study coordination games on the clique without a risk-dominant strategy (which are equivalent to the well-known Glauber dynamics for the Curie-Weiss model) and coordination games on a ring (both with and without risk-dominant strategy)

Convergence to Equilibrium of Logit Dynamics for Strategic Games

We present the first general bounds on the mixing time of the Markov chain associated to the logit dynamics for wide classes of strategic games. The logit dynamics with inverse noise beta describes the behavior of a complex system whose individual components act selfishly and keep responding according to some partial ("noisy") knowledge of the system, where the capacity of the agent to know the system and compute her best move is measured by the inverse of the parameter beta. In particular, we prove nearly tight bounds for potential games and games with dominant strategies. Our results show that, for potential games, the mixing time is upper and lower bounded by an exponential in the inverse of the noise and in the maximum potential difference. Instead, for games with dominant strategies, the mixing time cannot grow arbitrarily with the inverse of the noise. Finally, we refine our analysis for a subclass of potential games called graphical coordination games, a class of games that have been previously studied in Physics and, more recently, in Computer Science in the context of diffusion of new technologies. We give evidence that the mixing time of the logit dynamics for these games strongly depends on the structure of the underlying graph. We prove that the mixing time of the logit dynamics for these games can be upper bounded by a function that is exponential in the cutwidth of the underlying graph and in the inverse of noise. Moreover, we consider two specific and popular network topologies, the clique and the ring. For games played on a clique we prove an almost matching lower bound on the mixing time of the logit dynamics that is exponential in the inverse of the noise and in the maximum potential difference, while for games played on a ring we prove that the time of convergence of the logit dynamics to its stationary distribution is significantly shorter

Entanglement dynamics after quantum quenches in generic integrable systems

The time evolution of the entanglement entropy in non-equilibrium quantum systems provides crucial information about the structure of the time-dependent state. For quantum quench protocols, by combining a quasiparticle picture for the entanglement spreading with the exact knowledge of the stationary state provided by Bethe ansatz, it is possible to obtain an exact and analytic description of the evolution of the entanglement entropy. Here we discuss the application of these ideas to several integrable models. First we show that for non-interacting systems, both bosonic and fermionic, the exact time-dependence of the entanglement entropy can be derived by elementary techniques and without solving the dynamics. We then provide exact results for interacting spin chains that are carefully tested against numerical simulations. Finally, we apply this method to integrable one-dimensional Bose gases (Lieb-Liniger model) both in the attractive and repulsive regimes. We highlight a peculiar behaviour of the entanglement entropy due to the absence of a maximum velocity of excitations

Trajectory Perturbation in Surrogate Safety Indicators

Abstract Traffic conflicts based surrogate safety indicators have been applied extensively on real trajectories and in simulation. Such indicators can be useful to assess the safety of a given scenario without the need to use real crash data (which in many cases may be unavailable). Unfortunately, all traffic conflict indicators that are commonly used have a structural limitation: they are not able to consider potential conflicts with roadside obstacles or barriers and conflicts between vehicles which are travelling on non-conflicting trajectories. This limitation is a serious limitation since crash data analy sis shows that at least 40% of fatal crashes are originated by single vehicle accidents against a fixed object or by vehicles travelling in opposite directions. This paper is intended as a concept paper that presents an alternative view on conflict safety indicators showing that new indicators can be generated by the perturbation of vehicle trajectories overcoming the above indicated limitations