Concept

Level (logarithmic quantity)

Publications associées (17)

A note on the large charge expansion in 4d CFT

In this letter, we discuss certain universal predictions of the large charge expansion in conformal field theories with U (1) symmetry, mainly focusing on four-dimensional theories. We show that, while in three dimensions quantum fluctuations are responsib ...

ELSEVIER2021

Performance analysis of the differential pulse-width pair Brillouin optical time domain analysis using the log normalized and linearly normalized gain

Luc Thévenaz, Zhisheng Yang, Simon Adrien Zaslawski

The performance of the differential pulse-width pair Brillouin optical time domain analysis (DPP-BOTDA) is evaluated experimentally using either the gain from log normalization or linear normalization for the subtraction of traces collected with pump pulse ...

SPIE2019

Quantifying high-order interdependencies via multivariate extensions of the mutual information

Michael Christoph Gastpar, Fernando Rosas de Andraca

This paper introduces a model-agnostic approach to study statistical synergy, a form of emergence in which patterns at large scales are not traceable from lower scales. Our framework leverages various multivariate extensions of Shannon's mutual information ...

2019

A logarithmic epiperimetric inequality for the obstacle problem

Maria Colombo

We study the regularity of the regular and of the singular set of the obstacle problem in any dimension. Our approach is related to the epiperimetric inequality of Weiss (Invent Math 138:23-50, Wei99a), which works at regular points and provides an alterna ...

2018

Revisiting the quest for a universal log-law and the role of pressure gradient in "canonical" wall-bounded turbulent flows

Peter Monkewitz

The trinity of so-called "canonical" wall-bounded turbulent flows, comprising the zero pressure gradient turbulent boundary layer, abbreviated ZPG TBL, turbulent pipe flow, and channel/duct flows has continued to receive intense attention as new and more r ...

Amer Physical Soc2017

Scaling a Reliable Distributed System

Alexandre David Olivier Maurer

We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...

LPD EPFL2016

Distribution of Pico- and Nanosecond Motions in Disordered Proteins from Nuclear Spin Relaxation

Geoffrey Bodenhausen, Nicola Salvi, Fabien Ferrage

Intrinsically disordered proteins and intrinsically disordered regions (IDRs) are ubiquitous in the eukaryotic proteome. The description and understanding of their conformational properties require the development of new experimental, computational, and th ...

Elsevier2015

Statistical Models for Querying and Managing Time-Series Data

Saket Sathe

In recent years we are experiencing a dramatic increase in the amount of available time-series data. Primary sources of time-series data are sensor networks, medical monitoring, financial applications, news feeds and social networking applications. Availab ...

EPFL2013

Shear velocity estimates in rough-bed open-channel flow

Ulrich Lemmin, Fereshteh Bagherimiyab Hunkeler

Shear velocity u(*) is an important parameter in geophysical flows, in particular with respect to sediment transport dynamics. In this study, we investigate the feasibility of applying five standard methods [the logarithmic mean velocity profile, the Reyno ...

Wiley-Blackwell2013

Fractional Brownian motion and anomalous diffusion in vibrated granular materials

Daniele Mari, Gérard Gremaud, Alessandro Luigi Sellerio

We propose a new approach to the study of diffusion dynamics in vibrated granular systems. The dynamic of a granular material is mainly defined by dry friction interactions. This type of interaction is difficult to model for a large quantity of particles. ...

2012

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.

Connectez-vous pour utiliser Chat avec Graph Search