Essential connectedness and the rigidity problem for Gaussian symmetrization
Publications associées (34)
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.
We introduce the first passage set (FPS) of constant level -a of the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the boundary by a path on whi ...
We prove that the set of-y-thick points of a planar Gaussian free field (GFF) with Dirichlet boundary conditions is a.s. totally disconnected for all-y =6 0. Our proof relies on the coupling between a GFF and the nested CLE4. In particular, we show that th ...
The design of envelopes with complex geometries often leads to construction challenges. To overcome these difficulties, resorting to discrete differential geometry proved successful by establishing close links between mesh properties and the existence of g ...
Brightness has different meaning in different contexts and some of these are reviewed. The scientific definition of brightness does not represent our perception. The current definition is that from the IUPAC Gold Book and is mainly restricted to solutions. ...
Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...
In this thesis, we present a theory of value for the design and analysis of service ecosystems. The theory is based on general systems thinking. The concept of a system is used for relating knowledge from different disciplines (such as software engineering ...
Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...
The design of envelopes with complex geometries often leads to construction challenges. To overcome these difficulties, resorting to discrete differential geometry proved successful by establishing close links between mesh properties and the existence of g ...
In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...
Historically speaking, the notion of the type was reintroduced to the larger architectural discourse as a direct consequence of the crisis of the Modern. The task of revisiting the forms of the past also dictated the return of architectural methods that ha ...