Related papers: Random geometric subdivisions

We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…

We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that this variant is undecidable regardless of the shapes,…

The notion of geometric version of an infinitely divisible law is introduced. Concepts parallel to attraction and partial attraction are developed and studied in the setup of geometric summing of random variables.

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

It is shown that the geometry of parallelizable manifolds can be extended to non-parallelizable ones by extending the connection that a global frame field would define on a parallelizable manifold to a connection that a singular frame field…

We study the local geometry of the space of horizontal curves with endpoints freely varying in two given submanifolds $\mathcal P$ and $\mathcal Q$ of a manifold $\mathcal M$ endowed with a distribution $\mathcal D\subset T\M$. We give a…

Let d = (d1, d2, ..., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.…

The purpose of the present paper is twofold: firstly to extend to non-orientable compact 4-manifolds the notion of gem-induced trisection, directly obtained from colored triangulations (or, equivalently, from colored graphs encoding them,…

Subdivision surfaces provide an elegant isogeometric analysis framework for geometric design and analysis of partial differential equations defined on surfaces. They are already a standard in high-end computer animation and graphics and are…

We consider links that are alternating on surfaces embedded in a compact 3-manifold. We show that under mild restrictions, the complement of the link decomposes into simpler pieces, generalising the polyhedral decomposition of alternating…

The notion of a parallelizable distribution has been introduced and investigated. A non-integrable parallelizable distribution carries a natural sub-Riemannian structure. The geometry of this structure has been studied from the bi-viewpoint…

In this article, we summarize the results on symmetric conformal geometries. We review the results following from the general theory of symmetric parabolic geometries and prove several new results for symmetric conformal geometries. In…

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…

We investigate the topologies of random geometric complexes built over random points sampled on Riemannian manifolds in the so-called "thermodynamic" regime. We prove the existence of universal limit laws for the topologies; namely, the…

We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed…

Cannon and Swenson have shown that each hyperbolic 3-manifold group has a natural subdivision rule on the space at infinity, and that this subdivision rule captures the action of the group on the sphere. Explicit subdivision rules have also…

We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…

This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for…

The stable and unstable manifolds of an invariant set of a piecewise-smooth map are themselves piecewise-smooth. Consequently, as parameters of a piecewise-smooth map are varied, an invariant set can develop a homoclinic connection when its…

Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…