Concept

XFree86

Publications associées (17)

Quantitative convergence rates for scaling limit of SPDEs with transport noise

We consider on the torus the scaling limit of stochastic 2D (inviscid) fluid dynamics equations with transport noise to deterministic viscous equations. Quantitative estimates on the convergence rates are provided by combining analytic and probabilistic ar ...

Academic Press Inc Elsevier Science2024

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

Lukas Fritz Felix Vogl

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Elsevier2024

An adaptive space-time algorithm for the incompressible Navier-Stokes equations

Marco Picasso, Samuel Dubuis

A space-time adaptive algorithm is presented to solve the incompressible Navier-Stokes equations. Time discretization is performed with the BDF2 method while continuous, piecewise linear anisotropic finite elements are used for the space discretization. Th ...

San Diego2023

Lp-regularity theory for the stochastic reaction-diffusion equation with super-linear multiplicative noise and strong dissipativity

Jaeyun Yi

We study the existence, uniqueness, and regularity of the solution to the stochastic reaction-diffusion equation (SRDE) with colored noise F-center dot:partial derivative(t)u = aijuxixj +biuxi + cu - bu1+beta +xi u1+gamma F-center dot, (t, x) is ...

San Diego2023

Heteroclinic orbits for a system of amplitude equations for orthogonal domain walls

Boris Buffoni

Using a variational method, we prove the existence of heteroclinic solutions for a 6-dimensional system of ordinary differential equations. We derive this system from the classical Benard-Rayleigh problem near the convective instability threshold. The cons ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

On algebraic array theories

Viktor Kuncak, Rodrigo Raya

Automatic verification of programs manipulating arrays relies on specialised decision procedures. A methodology to classify the theories handled by these procedures is introduced. It is based on decomposition theorems in the style of Feferman and Vaught. T ...

New York2023

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

QFT without infinities and hierarchy problem

Sander Johannes Nicolaas Mooij

The standard way to do computations in Quantum Field Theory (QFT) often results in the requirement of dramatic cancellations between contributions induced by a "heavy" sector into the physical observables of the "light" (or low energy) sector - the phenome ...

ELSEVIER2023

Dynamic nuclear polarisation of 1H in Gd-doped In(OH)3

David Lyndon Emsley, Michael Allan Hope, Yuxuan Zhang, Amrit Venkatesh

Dynamic nuclear polarisation (DNP) of solids doped with high-spin metal ions, such as Gd3+, is a useful strategy to enhance the nuclear magnetic resonance (NMR) sensitivity for these samples. Spin diffusion can relay polarisation throughout a sample, which ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Cavitation bubble dynamics and microjet atomization near tissue-mimicking materials

Mohamed Farhat, Davide Bernardo Preso, Armand Baptiste Sieber

In recent years, considerable interest has been devoted to the interactions between cavitation bubbles and tissue-mimicking materials due to their promising applications in medicine and biomedical sciences. The strong fluid-structure interaction between a ...

AIP Publishing2023

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