Related papers: Random Surfaces with Boundary
Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…
We study random covers of a closed hyperbolic surface $\Sigma$, subject to the condition that, for $k\geq 2$, the fundamental group is isomorphic to the free group $F_k$. We show that asymptotically they distribute according to a specific…
We construct a surface with a cylindrical end which has a finite number of Laplace eigenvalues embedded in its continuous spectrum. The surface is obtained by attaching a cylindrical end to a hyperbolic torus with a hole. To our knowledge,…
We obtain simple generating sets for various mapping class groups of a nonorientable surface with punctures and/or boundary. We also compute the abelianizations of these mapping class groups.
We present several problems and results relating the scalar curvatures of manifolds with mean curvatures of their boundaries
The random graph is an infinite graph with the universal property that any embedding of $G-v$ extends to an embedding of $G$, for any finite graph. In this paper we show that this graph embeds in the curve graph of a surface $\Sigma$ if and…
The influence of different boundary conditions on the density of random packings of disks is studied. Packings are generated using the random sequential adsorption algorithm with three different types of boundary conditions: periodic, open,…
We show that, under certain natural assumptions, large random plane bipartite maps with a boundary converge after rescaling to a one-parameter family ($\mathrm{BD}_L$, $0 < L < \infty$) of random metric spaces homeomorphic to the closed…
A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…
Fix an arbitrary compact orientable surface with a boundary and consider a uniform bipartite random quadrangulation of this surface with $n$ faces and boundary component lengths of order $\sqrt n$ or of lower order. Endow this…
The concept of a normal surface in a triangulated, compact 3-manifold was generalised by Thurston to a spun-normal surface in a non-compact 3-manifold with ideal triangulation. This paper defines a boundary curve map which takes a…
We develop a general method for constructing random manifolds and submanifolds in arbitrary dimensions. The method is based on associating colors to the vertices of a triangulated manifold, as in recent work for curves in 3-dimensional…
Finite pieces of locally isostatic networks have a large number of floppy modes because of missing constraints at the surface. Here we show that by imposing suitable boundary conditions at the surface, the network can be rendered…
The boundary layer of a finite domain [a, b] covers mesoscopic lateral neighbourhoods, inside [a, b], of the endpoints a and b. The correct diagnostic of the integrand behaviour at a and b, based on its sampling inside the boundary layer,…
Interpreting the number of ramified covering of a Riemann surface by Riemann surfaces as the relative Gromov-Witten invariants and applying a gluing formula, we derive a recursive formula for the number of ramified covering of a Riemann…
Let $F$ be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set $\mathbb{Z}$, so that the degrees of the vertices are i.i.d.\ random…
We prove existence and nonexistence results for annular type parametric surfaces with prescribed, almost constant mean curvature, characterized as normal graphs of compact portions of unduloids or nodoids in $\mathbb{R}^{3}$, and whose…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
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,…
We are interested in generating surfaces with arbitrary roughness and forming patterns on the surfaces. Two methods are applied to construct rough surfaces. In the first method, some superposition of wave functions with random frequencies…