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.
We study in this thesis the asymptotic behavior of optimal paths on a random graph model, the configuration model, for which we assign continuous random positive weights on its edges.
We start by describing the asymptotic behavior of the diameter and the f ...
We prove small data modified scattering for the Vlasov-Poisson system in dimension d=3 using a method inspired from dispersive analysis. In particular, we identify a simple asymptotic dynamic related to the scattering mass. ...
We consider various versions of the obstacle and thin-obstacle problems, we interpret them as variational inequalities, with non-smooth constraint, and prove that they satisfy a new constrained Lojasiewicz inequality. The difficulty lies in the fact that, ...
One essential ingredient in many machine learning (ML) based methods for atomistic modeling of materials and molecules is the use of locality. While allowing better system-size scaling, this systematically neglects long-range (LR) effects such as electrost ...
Air mass factors (AMFs) are used in passive trace gas remote sensing for converting slant column densities (SCDs) to vertical column densities (VCDs). AMFs are traditionally computed with 1D radiative transfer models assuming horizontally homogeneous condi ...
Large efforts have been devoted in the past to understanding size effect in shear failures of members without transverse reinforcement. Experimental works have demonstrated that increasing the size reduces the nominal shear strength provided that the failu ...
A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane and to each edge a straight-line segment connecting the corresponding two points. The rectilinear crossing number of a graph G, (cr) over bar (G), is the mi ...
A family of subsets of {1, ... , n} is called intersecting if any two of its sets intersect. A classical result in extremal combinatorics due to Erdos, Ko and Rado determines the maximum size of an intersecting family of k-subsets of {1, ... , n}. In this ...
