Simulated annealing
Markov chain usage models were successfully used to model systems and software. The most prominent approaches are the so-called failure state models Whittaker and Thomason (1994) and the arc-based Bayesian models Sayre and Poore (2000). In this paper we propose arc-based semi-Markov usage models to test systems. We extend previous studies that rely on the Markov chain assumption to the more general semi-Markovian setting. Among the obtained results we give a closed form representation of the first...
Les processus de Schramm-Loewner (SLE) induisent des courbes aléatoires du plan complexe, qui vérifient une propriété d’invariance conforme. Ce sont des outils fondamentaux pour la compréhension du comportement asymptotique en régime critique de certains modèles discrets intervenant en physique statistique ; ils ont permis notamment d’établir rigoureusement certaines conjectures importantes dans ce domaine.
This work is concerned with asymptotic properties of multi-dimensional random walks in random environment. Under Kalikow’s condition, we show a central limit theorem for random walks in random environment on , when . We also derive tail estimates on the probability of slowdowns. These latter estimates are of special interest due to the natural interplay between slowdowns and the presence of traps in the medium. The tail behavior of the renewal time constructed in [25] plays an important role in...
We consider models of random walk in uniformly elliptic i.i.d. random environment in dimension greater than or equal to 4, satisfying a condition slightly weaker than the ballisticity condition . We show that for every and large enough, the annealed probability of linear slowdown is bounded from above by . This bound almost matches the known lower bound of , and significantly improves previously known upper bounds. As a corollary we provide almost sharp estimates for the quenched probability...
This paper is concerned with the small time behaviour of a Lévy process . In particular, we investigate thestabilitiesof the times, and , at which , started with , first leaves the space-time regions (one-sided exit), or (two-sided exit), , as . Thus essentially we determine whether or not these passage times behave like deterministic functions in the sense of different modes of convergence; specifically convergence in probability, almost surely and in . In many instances these are...
Branching Processes in Random Environment (BPREs) are the generalization of Galton–Watson processes where in each generation the reproduction law is picked randomly in an i.i.d. manner. In the supercritical case, the process survives with positive probability and then almost surely grows geometrically. This paper focuses on rare events when the process takes positive but small values for large times. We describe the asymptotic behavior of , as . More precisely, we characterize the exponential...
For a finite measure Λ on [0, 1], the Λ-coalescent is a coalescent process such that, whenever there are b clusters, each k-tuple of clusters merges into one at rate ∫01xk−2(1−x)b−kΛ(dx). It has recently been shown that if 1<α<2, the Λ-coalescent in which Λ is the Beta (2−α, α) distribution can be used to describe the genealogy of a continuous-state branching process (CSBP) with an α-stable branching mechanism. Here we use facts about CSBPs to establish new results about the small-time...
In this paper we establish a decoupling feature of the random interlacement process at level , . Roughly speaking, we show that observations of restricted to two disjoint subsets and of are approximately independent, once we add a sprinkling to the process by slightly increasing the parameter . Our results differ from previous ones in that we allow the mutual distance between the sets and to be much smaller than their diameters. We then provide an important application of this...