Degrees of freedom of sparsely connected wireless networks
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 use probability theory to prove in suitable conditions the equivalence of equilibrium time correlation functions of microscopic density fields with the time correlation functions of local macroscopic density fields evolved by hydrodynamic ...
In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competition between repulsion of neighboring edges and attraction of next-to-neighbori ...
Feature fusion reflects temporal integration. Previous studies mostly employed foveal presentations with no attention manipulation. In this study we examined the effects of sustained spatial attention on temporal integration using feature-fusion with perip ...
We present a probabilistic approach to quantify the hazard posed by volcanic ballistic projectiles (VBP) and their potential impact on the built environment. A model named Great Balls of Fire (GBF) is introduced to describe ballistic trajectories of VBPs a ...
In the context of dam safety, reliable safety flood estimation methods are necessary to guarantee a sufficiently designed spillway capacity. Todayâs state of the art allows to approach this topic under different angles. Statistical extrapolations are com ...
The present invention concerns a method for a communication device to transmit a data packet in a wireless communication system. The method comprises: determining (21) a first set of transmission parameters comprising a first central transmission frequency ...
Studying the complexity of distributed algorithms typically boils down to evaluating how the number of messages exchanged (resp. communication steps performed or shared memory operations executed) by nodes to reliably achieve some common task, evolves with ...
In this thesis, we study systems of linear and/or non-linear stochastic heat equations and fractional heat equations in spatial dimension 1 driven by space-time white noise. The main topic is the study of hitting probabilities for the solutions to these ...
Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree on a message from a designated sender, even if some processes (including the sender) are Byzantine. Existing broadcast protocols for this setting scale poorly, as ...
Schloss Dagstuhl--Leibniz-Zentrum fer Informatik2019
To quantify a player's commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a "canonical extension," which allows each player to adjust his or her move with a certain probability. The commitment meas ...
