Related papers: Combinatorially random curves on surfaces

The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a…

We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…

One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…

We investigate the minimal and isoperimetric surface problems in a large class of sub-Riemannian manifolds, the so-called Vertically Rigid spaces. We construct an adapted connection for such spaces and, using the variational tools of…

We establish a criterion that ensures a bounded almost complex curve in a bounded almost complex 4-manifold minimizes genus amongst all smooth surfaces that share its homology class and the transverse link on its boundary. An immediate…

The most useful and interesting line bundles over algebraic curves of a very high genus have the ratio \delta of the degree to the genus close to half-integer values, usually \delta \approx 0, \delta \approx 1/2, or \delta \approx 1; the…

We prove that compact 3-manifolds $M$ of constant curvature +1 with boundary a minimal surface are locally naturally parametrized by the conformal class of the boundary metric $\gamma$ in the Teichmuller space of $\partial M$, when…

This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…

We consider isomorphism properties of infinite random geometric graphs defined over a variety of metrics. In previous work, it was shown that for $\mathbb{R}^n$ with the $L_{\infty}$-metric, the infinite random geometric graph is, with…

A theorem of Grove and Searle directly establishes that positive curvature 2d manifolds M with effective circular symmetry group of dimension 8 or less have positive Euler characteristic X(M): the fixed point set N consists of even…

We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

We prove an isoperimetric inequality for conjugation-invariant sets of size $k$ in $S_n$, showing that these necessarily have edge-boundary considerably larger than some other sets of size $k$ (provided $k$ is small). Specifically, let…

Jiang, Tidor, Yao, Zhang, and Zhao recently showed that connected bounded degree graphs have sublinear second eigenvalue multiplicity (always referring to the adjacency matrix). This result was a key step in the solution to the problem of…

Random walks on spaces with hyperbolic properties tend to sublinearly track geodesic rays which point in certain hyperbolic-like directions. Qing-Rafi-Tiozzo recently introduced the sublinearly Morse boundary and proved that this boundary…

In this note, we develop a condition on a closed curve on a surface or in a 3-manifold that implies that the curve has the property that its length function on the space of all hyperbolic structures on the surface or 3-manifold completely…

Motivated by the aspect of large-scale symplectic topology, we prove that for any pair $g_0, \, g_1$ of complete Riemannian metrics of bounded curvature and \emph{of injectivity radius bounded away from zero}, the convex sum $g_s: = (1-s )…

In this note we prove an effective characterization of when two finite-degree covers of a connected, orientable surface of negative Euler characteristic are isomorphic in terms of which curves have simple elevations, weakening the…

For integers $g,m \geq 0$ and $n>0$, let $S_{g}(n,m)$ denote the graph taken uniformly at random from the set of all graphs on $\{1,2, \ldots, n\}$ with exactly $m=m(n)$ edges and with genus at most $g$. We use counting arguments to…

An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…