Titlebook: In and Out of Equilibrium 2; Vladas Sidoravicius,Maria Eulália Vares Book 2008 Birkhäuser Basel 2008 Brownian motion.Measure.disordered sy

Indict

神圣在玷污

A New REM Conjecture,nd H. Bauke. We establish our conjecture for a wide class of Gaussian and non-Gaussian Hamiltonians, which include the .-spin models, the Sherrington-Kirkpatrick model and the number partitioning problem. We prove that our universality result is optimal for the last two models by showing when this u

有其法作用

The Biham-Middleton-Levine Traffic Model for a Single Junction,efined rules. Computer simulations show this system exhibits many interesting phenomena: for low densities the system self organizes such that cars flow freely while for densities higher than some critical density the system gets stuck in an endless traffic jam. However, apart from the simulation re

离开就切除

Box-Crossings and Continuity Results for Self-Destructive Percolation in the Plane,viated as sdp model). A typical configuration for the sdp model with parameters . and δ is generated in three steps: First we generate a typical configuration for the ordinary site percolation model with parameter .. Next, we make all sites in the infinite occupied cluster vacant. Finally, each site

净礼

A Quenched Invariance Principle for Certain Ballistic Random Walks in i.i.d. Environments,ction, an annealed invariance principle and some mild integrability condition for regeneration times also satisfies a quenched invariance principle. The argument is based on intersection estimates and a theorem of Bolthausen and Sznitman.

gene-therapy

谄媚于性

职业

On the Large Deviations Properties of the Weighted-Serve-the-Longest-Queue Policy,he weighted-serve-the-longest-queue policy. The problem setup falls into the general category of systems with discontinuous statistics. Our analysis, which is largely based on a weak convergence approach, does not require any symmetry or dimensional restrictions.

都相信我的话

Exponential Inequalities for Empirical Unbounded Context Trees,ee is not necessarily bounded. The algorithm Context is a well-known tool to estimate the context tree of a Variable Length Markov Chain. As a consequence of the exponential bounds we obtain a strong consistency result. We generalize in this way several previous results in the field.

招募