Previous Page 3

Displaying 41 – 59 of 59

Showing per page

Process-level quenched large deviations for random walk in random environment

Firas Rassoul-Agha, Timo Seppäläinen (2011)

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

We consider a bounded step size random walk in an ergodic random environment with some ellipticity, on an integer lattice of arbitrary dimension. We prove a level 3 large deviation principle, under almost every environment, with rate function related to a relative entropy.

Processus de naissance avec interaction des voisins, évolution de graphes

Jacques Peyrière (1981)

Annales de l'institut Fourier

On définit de nouveaux processus de naissance à temps discret; la population est, à chaque instant, organisée en graphe. Pour obtenir la ( n + 1 ) -ième génération on remplace aléatoirement les sommets de la n -ième génération par des graphes que l’on accroche convenablement les uns aux autres. On autorise une certaine dépendance entre les substitutions de sommets voisins. On étudie, pour certains processus surcritiques, la croissance de la population et la structure des graphes générés : sous des hypothèses...

Product form solution for g-networks with dependent service

Pavel Bocharov, Ciro D'Apice, Evgeny Gavrilov, Alexandre Pechinkin (2004)

RAIRO - Operations Research - Recherche Opérationnelle

We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: (0) an exponential node with c n servers, infinite buffer and FIFO discipline; (1) an infinite-server node; (2) a single-server node with infinite buffer and LIFO PR discipline; (3) a single-server...

Product form solution for g-networks with dependent service

Pavel Bocharov, Ciro D'Apice, Evgeny Gavrilov, Alexandre Pechinkin (2010)

RAIRO - Operations Research

We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: Negative customers arriving at each node also form a Poisson flow. A negative customer entering a node with k customers in service, with probability 1/k chooses one of served positive customer...

Currently displaying 41 – 59 of 59

Previous Page 3