Related papers: Random Geometric Graphs in Reflexive Banach Spaces
We consider a random geometric graph model, where pairs of vertices are points in a metric space and edges are formed independently with fixed probability $p$ between pairs within threshold distance $\delta $. A countable dense set in a…
Given a countable dense subset $S$ of a finite-dimensional normed space $X$, and $0<p<1$, we form a random graph on $S$ by joining, independently and with probability $p$, each pair of points at distance less than $1$. We say that $S$ is…
We prove the existence of Rado sets in the Banach space of continuous functions on [0,1]. A countable dense set S is Rado if with probability 1, the infinite geometric random graph on S, formed by probabilistically making adjacent elements…
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
A group G is representable in a Banach space X if G is isomorphic to the group of isometries on X in some equivalent norm. We prove that a countable group G is representable in a separable real Banach space X in several general cases,…
We study dentable maps from a closed convex subset of a Banach space into a metric space as an attempt of generalize the Radon-Nikod\'ym property to a "less linear" frame. We note that a certain part of the theory can be developed in rather…
We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$…
We prove that the class of reflexive asymptotic-$c_0$ Banach spaces is coarsely rigid, meaning that if a Banach space $X$ coarsely embeds into a reflexive asymptotic-$c_0$ space $Y$, then $X$ is also reflexive and asymptotic-$c_0$. In order…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
Recall that the Rado graph is the unique countable graph that realizes all one-point extensions of its finite subgraphs. The Rado graph is well-known to be universal and homogeneous in the sense that every isomorphism between finite…
In this paper we survey known results of characterizations of reflexive Banach spaces, which are based on convergence of usual and generalized arithmetic mean (or Ces\`aro sum), weakly compact subsets, affine sets in a Banach space or its…
All most all the function spaces over real or complex domains and spaces of sequences, that arise in practice as examples of normed complete linear spaces (Banach spaces), are reflexive. These Banach spaces are dual to their respective…
We characterize non-reflexive Banach spaces by a low-distortion (resp. isometric) embeddability of a certain metric graph up to a renorming. Also we study non-linear sufficient conditions for $\ell_1^n$ being $(1+\varepsilon)$-isomorphic to…
We present and study a family of metrics on the space of compact subsets of $R^N$ (that we call ``shapes''). These metrics are ``geometric'', that is, they are independent of rotation and translation; and these metrics enjoy many…
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…
We show that any separable stable Banach space can be represented as a group of isometries on a separable reflexive Banach space, which extends a result of S. Guerre and M. Levy. As a consequence, we can then represent homeomorphically its…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
We describe surjective linear isometries and linear isometry groups of a large class of Lipschitz-free spaces that includes e.g. Lipschitz-free spaces over any graph. We define the notion of a Lipschitz-free rigid metric space whose…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
The Rado Graph, sometimes also known as the (countable) Random Graph, can be generated almost surely by putting an edge between any pair of vertices with some fixed probability $p \in (0, 1)$, independently of other pairs. In this article,…