Concept

Probability space

Related publications (197)

Metastability of reversible condensed zero range processes on a finite set

Let r : S x S -> R+ be the jump rates of an irreducible random walk on a finite set S, reversible with respect to some probability measure m. For alpha > 1, let g : N -> R+ be given by g(0) = 0, g(1) = 1, g(k) = (k/k - 1)(alpha), k >= 2. Consider a zero ra ...

2012

Modelling the effect of size on the aerial dispersal of microorganisms

Edward Mitchell, Isabelle Bey, Symeon Koumoutsaris

Aim We investigate the long-standing question of whether the small size of microbes allows most microbial species to colonize all suitable sites around the globe or whether their ranges are limited by opportunities for dispersal. In this study we use a mod ...

2012

Tight Bounds on the Redundancy of Huffman Codes

Ali Kakhbod

In this paper, we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman c ...

Ieee-Inst Electrical Electronics Engineers Inc2012

Degrees of freedom of sparsely connected wireless networks

Michael Christoph Gastpar, Naveen Goela

We investigate how the network connectivity can affect the degrees of freedom (DoF) of wireless networks. We consider a network of n source-destination (SD) pairs and assume that any two nodes are connected with a positive probability p, independent of oth ...

IEEE2012

This Time Is the Same: Using Bank Performance in 1998 to Explain Bank Performance during the Recent Financial Crisis

Rüdiger Fahlenbrach

Are some banks prone to perform poorly during crises? If yes, why? In this paper, we show that a bank's stock return performance during the 1998 crisis predicts its stock return performance and probability of failure during the recent financial crisis. Thi ...

Wiley-Blackwell2012

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Serge Vaudenay, Aikaterini Mitrokotsa

At ACM~CCS 2008, Rasmussen and Capkun introduced a distance-bounding protocol RC07 (henceforth RC protocol) where the prover and verifier use simultaneous transmissions and the verifier counts the delay between sending a challenge (starting with a hidden m ...

IEEE2012

A Quasi-Likelihood Approach to Zero-Inflated Spatial Count Data

Anthea Monod

The increased accessibility of data that are geographically referenced and correlated increases the demand for techniques of spatial data analysis. The subset of such data comprised of discrete counts exhibit particular difficulties and the challenges furt ...

EPFL2012

Blackouts risk evaluation by Monte Carlo Simulation regarding cascading outages and system frequency deviation

Mokhtar Bozorg, Omid Alizadeh Mousavi

In this paper, a blackout risk assessment method is proposed considering the effects of cascading outages, the active power and frequency response of the system. Here, the Monte Carlo Simulation (MCS) is used to analyze the risk of blackouts by generating ...

Elsevier2012

Daylighting Metrics: Is there a relation between Useful Daylight Illuminance and Daylight Glare Probabilty?

Marilyne Andersen, Nicolas Roy

The establishment of climate-based daylight modeling within research and practice has led to a fundamental reassessment of both the basis and purpose of daylight metrics. Whilst there is no consensus yet on the precise nature of the metric(s) that should r ...

2012

Risk analysis in research environment

Thierry Meyer, Amela Groso, Aristide Ramondgwendé Ouédraogo

Available risk analysis techniques are well adapted to industry since they were developed for its purpose. All hazards met in industry are also present in research/academia (although quantities of some hazardous substances are smaller). Still, because of i ...

2012

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.