Space lower bounds for low-stretch greedy embeddings
Graph Chatbot
Chat with Graph Search
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.
The mathematical facet of modern crystallography is essentially based on analytical geometry, linear algebra as well as group theory. This study endeavours to approach the geometry and symmetry of crystals using the tools furnished by differential geometry ...
The symmetry of a commensurately modulated crystal structure can be described in two different ways: in terms of a conventional three-dimensional space group or using the superspace concept in (3 + d) dimensions. The three-dimensional space group is obtain ...
We announce results on the structure of CAT(0) groups, CAT(0) lattices and of the underlying spaces. Our statements rely notably on a general study of the full isometry groups of proper CAT(0) spaces. Classical statements about Hadamard manifolds are estab ...
We discuss general notions of metrics and of Finsler structures which we call weak metrics and weak Finsler structures. Any convex domain carries a canonical weak Finsler structure, which we call its tautological weak Finsler structure. We compute distance ...
We prove a version of the Lp hodge decomposition for differential forms in Euclidean space and a generalization to the class of Lizorkin currents. We also compute the Lqp−cohomology of Rn. ...
Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range to each other have been extensively studied. This paper considers a variation in which a connection between two poi ...
We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metric, or more specifically Euclidean coordinates to infer network proximity. This is ...
In 1977, D. G. Kendall [J. Appl. Probab. 28 (1991), no. 1, 225--230; MR1090460 (92f:60135)] considered diffusions of shape induced by independent Brownian motions in Euclidean space. In this paper, we consider a different class of diffusions of shape, indu ...
Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-bas ...
Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range to each other have been extensively studied. This paper considers a variation in which a connection between two poi ...
