Related papers: Direction sets, Lipschitz graphs and density
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…
If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We…
To characterize the location (mean, median) of a set of graphs, one needs a notion of centrality that is adapted to metric spaces, since graph sets are not Euclidean spaces. A standard approach is to consider the Frechet mean. In this work,…
A Poisson outdegree-one graph is an oriented graph based on a Poisson point process such that each vertex has only one outgoing edge. The paper focuses on the absence of percolation for such graphs. Our main result is based on two…
Let $X$ and $Y$ be length metric spaces. Let $\mathcal H^n$ denote the $n$-dimensional Hausdorff measure. The Lipschitz-Volume Rigidity is a property that if there exists a 1-Lipschitz map $f\colon X\to Y$ and $0<\mathcal H^n(X)=\mathcal…
We compare several notion of weak (modulus of) gradient in metric measure spaces. Using tools from optimal transportation theory we prove density in energy of Lipschitz maps independenly of doubling and Poincar\'e assumptions on the metric…
We study the question: when are Lipschitz mappings dense in the Sobolev space $W^{1,p}(M,\mathbf{H}^n)$? Here $M$ denotes a compact Riemannian manifold with or without boundary, while $\mathbf{H}^n$ denotes the $n$th Heisenberg group…
Let d_i(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadruples (d_0,d_1,d_2,d_3) that are arbitrary close to 3-vertex…
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
The $p$-modulus of curves, test plans, upper gradients, charts, differentials, approximations in energy and density of directions are all concepts associated to the theory of Sobolev functions in metric measure spaces. The purpose of this…
The (strong and weak) well-posedness is proved for singular SDEs depending on the distribution density point-wisely and globally, where the drift satisfies a local integrability condition in time-spatial variables, and is Lipschitz…
We consider a class of functions defined on metric spaces which generalizes the concept of piecewise Lipschitz continuous functions on an interval or on polyhedral structures. The study of such functions requires the investigation of their…
We consider the Grassman manifold $G(E)$ as the subset of all orthogonal projections of a given Euclidean space $E$ and obtain some explicit formulas concerning the differential geometry of $G(E)$ as a submanifold of $L(E,E)$ endowed with…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
We consider Laplace operators on periodic discrete graphs perturbed by guides, i.e., graphs which are periodic in some directions and finite in other ones. The spectrum of the Laplacian on the unperturbed graph is a union of a finite number…
There are several Teichm\"uller spaces associated to a surface of infinite topological type, after the choice of a particular basepoint (a complex or a hyperbolic structure on the surface). These spaces include the quasiconformal…
Density estimation is an important technique for characterizing distributions given observations. Much existing research on density estimation has focused on cases wherein the data lies in a Euclidean space. However, some kinds of data are…
We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic…
We construct a complete metric space $M$ of cardinality continuum such that every non-singleton closed separable subset of $M$ fails to be a Lipschitz retract of $M$. This provides a metric analogue to the various classical and recent…