Displaying similar documents to “Asymptotic properties of random graphs”

Les Symétries dans les Réseaux de Petri Stochastiques (RdPS) Construction du Graphe Symbolique

M. Ioualalen, A. Aissani (2010)

RAIRO - Operations Research

Similarity:

The main purpose of this paper is to give a method for construction of the reduced reachability graph for Stochastic Petri Nets (SPN), the symbolic graph. This construction is achieved by exploiting the structural symetries in the net using the theory of bisimulation of places for detecting isomorphic parts in the net. The symbolic graph, being isomorphic to an agregated Markov chain, may be used to prove qualitative properties as liveness, boundness, ... Moreover, this reduced graph...

Existence et régularité höldérienne des fonctions de bosses

Moez Ben Abid (2009)

Colloquium Mathematicae

Similarity:

We discuss the almost sure existence of random functions that can be written as sums of elementary pulses. We then estimate their uniform Hölder regularity by applying some results on coverings by random intervals.

Sur quelques algorithmes récursifs pour les probabilités numériques

Gilles Pagès (2010)

ESAIM: Probability and Statistics

Similarity:

The aim of this paper is to take an in-depth look at the long time behaviour of some continuous time Markovian dynamical systems and at its numerical analysis. We first propose a short overview of the main ergodicity properties of time continuous homogeneous Markov processes (stability, positive recurrence). The basic tool is a Lyapunov function. Then, we investigate if these properties still hold for the time discretization of these processes, either with constant or decreasing...

Coloration de graphes : fondements et applications

Dominique de Werra, Daniel Kobler (2010)

RAIRO - Operations Research

Similarity:

The classical colouring models are well known thanks in large part to their applications to scheduling type problems; we describe the basic concepts of colourings together with a number of variations and generalisations arising from scheduling problems such as the creation of school schedules. Some exact and heuristic algorithms will be presented, and we will sketch solution methods based on tabu search to find approximate solutions to large problems. Finally we will also mention...

G-Réseaux dans un environnement aléatoire

Jean-Michel Fourneau, Dominique Verchère (2010)

RAIRO - Operations Research

Similarity:

We study networks with positive and negative customers (or Generalized networks of queues and signals) in a random environment. This environment may change the arrival rates, the routing probabilities, the service rates and also the effect of signals. We prove that the steady-state distribution has a product form. This property is obtained as a corollary of a much more general result on multidimensional Markov chains.

Fonction de Correlation pour des Mesures Complexes

Wei Min Wang (1998-1999)

Séminaire Équations aux dérivées partielles

Similarity:

We study a class of holomorphic complex measures, which are close in an appropriate sense to a complex Gaussian. We show that these measures can be reduced to a product measure of real Gaussians with the aid of a maximum principle in the complex domain. The formulation of this problem has its origin in the study of a certain class of random Schrödinger operators, for which we show that the expectation value of the Green’s function decays exponentially.

Sur des inégalités intégrales et applications à la stabilité de quelques systèmes distribués non dissipatifs

Aïssa Guesmia

Similarity:

First we prove some new integral inequalities to obtain a precise estimate on behavior at infinity of a positive and not necessarily decreasing functon. This extends in many directions and improves in certain cases some integral inequalities due to A. Haraux, V. Komornik, P. Martinez, M. Eller et al. and F. Alabau-Boussouira concerning decreasing functions. Then we give applications to (internal or boundary, linear or nonlinear) stabilization of certain nondissipative distributed...