The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation
Publications associées (106)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We present experimental results on the velocity statistics of a granular fluid with an effective stochastic thermostat, in a quasi-two-dimensional configuration. We find the base state, as measured by the single particle velocity distribution P(c) in the c ...
In this study, we evaluate eight autoconversion parameterizations against integration of the Kinetic Collection Equation (KCE) for cloud size distributions measured during the NASA CRYSTAL-FACE and CSTRIPE campaigns. KCE calculations are done using both th ...
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference between the long term distribution of nodes and the initial one, and sometimes the ...
To predict fluid phase distribution in porous media, the effect of geometric properties on flow processes must be understood. In this study, we analyze the effect of volume, surface, curvature and connectivity (the four Minkowski functionals) on the hydrau ...
We examine the fundamental properties that determine the basic performance metrics for opportunistic communications. We first consider the distribution of intercontact times between mobile devices. Using a diverse set of measured mobility traces, we find a ...
We define ``random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or non convex domains, random walk on torus, billiards, city section, space graph, intercity and other m ...
This article introduces a new measure of travel time reliability for implementation in the dynamic routing algorithm of an intelligent car navigation system. The measure is based on the log-normal distribution of travel time on a link and consists of two i ...
We analyze the distribution of the distances between tributaries of a given size (or of sizes larger than a given area) draining along either an open boundary or the mainstream of a river network. By proposing a description of the distance separating presc ...
The very existence of urban formations on all inhabited continents and throughout the history of mankind since the 3rd millennium B.C. leads to suppose a tendency of some structured societies to maximize interaction by minimizing physical distance. Were th ...
Decentralized processing algorithms are attractive alternatives to centralized algorithms for target tracking applications in smart sensor networks since they provide the ability to scale, reduce vulnerability, reduce communication and share processing res ...