The probability of intransitivity in dice and close elections
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.
In this paper, we investigate the construction of compromise estimators of location and scale, by averaging over several models selected among a specified large set of possible models. The weight given to each distribution is based on the profile likelihoo ...
Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in an industrial and academic context. Model checking for timed automata has been studied extensively ...
CuGaS2 nanorods were synthesized by irradiating the precursor solution with intense X-rays. The products are single crystal nanorods with preferential [220] growth and a uniform size distribution. We also report on the photoresponse of drop-cast films of t ...
Increasingly, uncertainties are explicitly considered for important engineering tasks. Often, little case-specific information is available for characterizing these uncertainties. Uniform distributions are an easy way to describe errors in absence of more ...
This work investigates the potential for harnessing the association of bacterial proteins to biogenic selenium nanoparticles (SeNPs) to control the size distribution and the morphology of the resultant SeNPs. We conducted a proteomic study and compared pro ...
We introduce a definition of the notion of compressibility for infinite deterministic and i.i.d. random sequences which is based on the asymptotic behavior of truncated subsequences. For this purpose, we use asymptotic results regarding the distribution of ...
We consider the random walk among random conductances on Z(d). We assume that the conductances are independent, identically distributed and uniformly bounded away from 0 and infinity. We obtain a quantitative version of the central limit theorem for this r ...
A networked set of agents holding binary opinions does not seem to be able to compute its majority opinion by means of local binary interactions only. However, the majority problem can be solved using two or more bits, instead of one [1]. Pairs of agents a ...
In recent years, multi-atlas fusion methods have gained significant attention in medical image segmentation. In this paper, we propose a general Markov Random Field (MRF) based framework that can perform edge-preserving smoothing of the labels at the time ...
We study stochastically blinking dynamical systems as in the companion paper (Part I). We analyze the asymptotic properties of the blinking system as time goes to infinity. The trajectories of the averaged and blinking system cannot stick together forever, ...
