1,477 research outputs found

    Detection of cold pain, cold allodynia and cold hyperalgesia in freely behaving rats

    Get PDF
    BACKGROUND: Pain is elicited by cold, and a major feature of many neuropathic pain states is that normally innocuous cool stimuli begin to produce pain (cold allodynia). To expand our understanding of cold induced pain states we have studied cold pain behaviors over a range of temperatures in several animal models of chronic pain. RESULTS: We demonstrate that a Peltier-cooled cold plate with ± 1°C sensitivity enables quantitative measurement of a detection withdrawal response to cold stimuli in unrestrained rats. In naïve rats the threshold for eliciting cold pain behavior is 5°C. The withdrawal threshold for cold allodynia is 15°C in both the spared nerve injury and spinal nerve ligation models of neuropathic pain. Cold hyperalgesia is present in the spared nerve injury model animals, manifesting as a reduced latency of withdrawal response threshold at temperatures that elicit cold pain in naïve rats. We also show that following the peripheral inflammation produced by intraplantar injection of complete Freund's adjuvant, a hypersensitivity to cold occurs. CONCLUSION: The peltier-cooled provides an effective means of assaying cold sensitivity in unrestrained rats. Behavioral testing of cold allodynia, hyperalgesia and pain will greatly facilitate the study of the neurobiological mechanisms involved in cold/cool sensations and enable measurement of the efficacy of pharmacological treatments to reduce these symptoms

    Evolutionary Dynamics on Small-Order Graphs

    Get PDF
    Abstract. We study the stochastic birth-death model for structured finite populations popularized by Lieberman et al. [Lieberman, E., Hauert, C., Nowak, M.A., 2005. Evolutionary dynamics on graphs. Nature 433, 312-316]. We consider all possible connected undirected graphs of orders three through eight. For each graph, using the Monte Carlo Markov Chain simulations, we determine the fixation probability of a mutant introduced at every possible vertex. We show that the fixation probability depends on the vertex and on the graph. A randomly placed mutant has the highest chances of fixation in a star graph, closely followed by star-like graphs. The fixation probability was lowest for regular and almost regular graphs. We also find that within a fixed graph, the fixation probability of a mutant has a negative correlation with the degree of the starting vertex. 1
    corecore