Previous Page 16

Displaying 301 – 310 of 310

Showing per page

Dynamical sensitivity of the infinite cluster in critical percolation

Yuval Peres, Oded Schramm, Jeffrey E. Steif (2009)

Annales de l'I.H.P. Probabilités et statistiques

In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last decade. Here we focus on graphs which percolate at criticality, and investigate the dynamical sensitivity of the infinite cluster. We first give two examples of bounded degree graphs, one which percolates for all times at criticality and one which has exceptional...

Dynamics and density evolution in piecewise deterministic growth processes

Michael C. Mackey, Marta Tyran-Kamińska (2008)

Annales Polonici Mathematici

A new sufficient condition is proved for the existence of stochastic semigroups generated by the sum of two unbounded operators. It is applied to one-dimensional piecewise deterministic Markov processes, where we also discuss the existence of a unique stationary density and give sufficient conditions for asymptotic stability.

Dynamics of Stochastic Neuronal Networks and the Connections to Random Graph Theory

R. E. Lee DeVille, C. S. Peskin, J. H. Spencer (2010)

Mathematical Modelling of Natural Phenomena

We analyze a stochastic neuronal network model which corresponds to an all-to-all network of discretized integrate-and-fire neurons where the synapses are failure-prone. This network exhibits different phases of behavior corresponding to synchrony and asynchrony, and we show that this is due to the limiting mean-field system possessing multiple attractors. We also show that this mean-field limit exhibits a first-order phase transition as a function...

Dynamiques recuites de type Feynman-Kac : résultats précis et conjectures

Pierre Del Moral, Laurent Miclo (2006)

ESAIM: Probability and Statistics

Soit U une fonction définie sur un ensemble fini E muni d'un noyau markovien irréductible M. L'objectif du papier est de comparer théoriquement deux procédures stochastiques de minimisation globale de U : le recuit simulé et un algorithme génétique. Pour ceci on se placera dans la situation idéalisée d'une infinité de particules disponibles et nous ferons une hypothèse commode d'existence de suffisamment de symétries du cadre (E,M,U). On verra notamment que contrairement au recuit simulé, toute...

Currently displaying 301 – 310 of 310

Previous Page 16