Multitype Contact Process on Z: Extinction and Interface
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.
Electricity swing options are Bermudan-style path-dependent derivatives on electrical energy. We consider an electricity market driven by several exogenous risk factors and formulate the pricing problem for a class of swing option contracts with energy and ...
We investigate the problem of optimal risk sharing between agents endowed with cash-invariant choice functions which are law-invariant with respect to different reference probability measures. We motivate a discrete setting both from an operational and a t ...
In this paper, we compare two methods to model the formation of choice sets in the context of discrete choice models. The first method is the probabilistic approach proposed by Manski in 1977, who models the choice probability as the joint probability of s ...
Attentional capture is often thought to be automatic and not modulable. For example, visual search experiments showed that salient distractor singletons strongly capture attention even when they had to be ignored by the observers. Recently, however, it was ...
In this paper, we compare two methods to model the formation of choice sets in the context of discrete choice models. The first method is the probabilistic approach proposed by Manski (1977), who models the choice probability as the joint probability of se ...
This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models ...
We introduce the notion of permissiveness in transactional memories (TM). Intuitively, a TM is permissive if it never aborts a transaction when it need not. More specifically, a TM is permissive with respect to a safety property p if the TM accepts every ...
In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...
Based on the results from a field survey campaign, this article describes three new developments which have been integrated to provide a comprehensive basis for the evaluation of overheating risk in offices. Firstly, a set of logistic regression equations ...
We introduce the notion of permissiveness in transactional memories (TM). Intuitively, a TM is permissive if it never aborts a transaction when it need not. More specifically, a TM is permissive with respect to a safety property p if the TM accepts every h ...
