Concept

Relationships among probability distributions

Publications associées (33)

Connection-type-specific biases make uniform random network models consistent with cortical recordings

Wulfram Gerstner, Carl Petersen, Tim Vogels, Michael Avermann, Christian Tomm

Uniform random sparse network architectures are ubiquitous in computational neuroscience, but the implicit hypothesis that they are a good representation of real neuronal networks has been met with skepticism. Here we used two experimental data sets, a stu ...
American Physiological Society2014

Robust Data-Driven Dynamic Programming

Daniel Kuhn, Grani Adiwena Hanasusanto

In stochastic optimal control the distribution of the exogenous noise is typically unknown and must be inferred from limited data before dynamic programming (DP)-based solution schemes can be applied. If the conditional expectations in the DP recursions ar ...
2013

A new approach to synthesize heterogeneous agents and their associations for urban microsimulations

Michel Bierlaire, Gunnar Flötteröd, Bilal Farooq

Microsimulation of urban transportation and land use evolution require base year, individual characteristics and disaggregate locations of the households and persons living in the study area. On the other hand, mainly due to privacy reasons, at best the ce ...
2012

Simulation based Approach for Agents Synthesis in Large-Scale Urban Systems Modelling

Michel Bierlaire, Gunnar Flötteröd, Bilal Farooq, Ricardo Daniel Hurtubia González

Microsimulation of urban transportation and land use evolution require base year, individual characteristics and disaggregate locations of the households and persons living in the study area. On the other hand, mainly due to privacy reasons, at best the ce ...
2012

Analysing Neuronal Network Architectures

Christian Tomm

The connections cortical neurons forms are different in each individual human or animal. Although there are known and determined large scale connections between areas of the brain that are common across individuals, the local connectivity on smaller scales ...
EPFL2012

Irregular Product Codes

Mohammad Amin Shokrollahi, Ghid Maatouk, Seyed Omid Etesami, Masoud Alipour Babaei

We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...
Ieee2012

Adaptive sensing using deterministic partial Hadamard matrices

Emre Telatar, Emmanuel Abbé, Saeid Haghighatshoar

This paper investigates the construction of determin- istic measurement matrices preserving the entropy of a random vector with a given probability distribution. In particular, it is shown that for a random vector with i.i.d. discrete components, this is a ...
Ieee2012

Large deviations for voter model occupation times in two dimensions

Thomas Mountford, Grégory Maillard

We study the decay rate of large deviation probabilities of occupation times, up to time t, for the voter model eta : Z(2) x [0, infinity) -> {0, 1} with simple random walk transition kernel, starting from a Bernoulli product distribution with density rho ...
2009

Radial and azimuthal 235U fission and 238U capture distributions in BWR UO2 pins: CASMO-4 and MCNP4C versus activation foil measurements

Rakesh Chawla, Fabian Jatuff, Michaël Plaschy

In the context of the LWR-PROTEUS program, radial and azimuthal 235U fission (F5) and 238U capture (C8) rate distributions have been calculated for zero-burnup pins of a Westinghouse SVEA-96 Optima2 boiling water reactor fuel assembly using the stochastic ...
ANS2007

A Generalization of the Finite-Length Scaling Approach Beyond the BEC

Rüdiger Urbanke, Jérémie Ezri

We want to extend the approximation of the error probability via a scaling approach from the BEC to general binary-input memoryless output-symmetric (BMS) channels. In particular, we consider such scaling laws for regular LDPC ensembles and message-passing ...
2007

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.