English
Related papers

Related papers: Random surfaces with large systoles

200 papers

We introduce and study a new random surface which we call the hyperbolic Brownian plane and which is the near-critical scaling limit of the hyperbolic triangulations constructed in arXiv:1401.3297. The law of the hyperbolic Brownian plane…

Probability · Mathematics 2018-06-28 Thomas Budzinski

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…

Probability · Mathematics 2011-04-20 Jonathan Jordan

We propose a variational framework for accretive surface growth driven by an optimality principle. Rather than prescribing a kinetic law, the configuration at each time step is obtained, within a time-discrete setting, as the solution of a…

Mathematical Physics · Physics 2026-05-14 Rohan Abeyaratne , Roberto Paroni , Marco Picchi Scardaoni

In this paper, we investigate basic geometric quantities of a random hyperbolic surface of genus $g$ with respect to the Weil-Petersson measure on the moduli space $\mathcal{M}_g$. We show that as $g$ goes to infinity, a generic surface…

Geometric Topology · Mathematics 2023-07-04 Xin Nie , Yunhui Wu , Yuhao Xue

We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…

Probability · Mathematics 2017-12-12 Eric Ossami Endo , Daniel Valesin

We construct minimal laminations by hyperbolic surfaces whose generic leaf is a disk and contain any prescribed family of surfaces and with a precise control of the topologies of the surfaces that appear. The laminations are constructed via…

Geometric Topology · Mathematics 2022-02-03 Sébastien Alvarez , Joaquín Brum , Matilde Martínez , Rafael Potrie

Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…

Combinatorics · Mathematics 2011-04-06 Gareth A. Jones

We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…

Combinatorics · Mathematics 2019-06-26 David Conlon

In this paper, we investigate the asymptotic behavior of the non-simple systole, which is the length of a shortest non-simple closed geodesic, on a random closed hyperbolic surface on the moduli space $\mathcal{M}_g$ of Riemann surfaces of…

Geometric Topology · Mathematics 2025-08-21 Yuxin He , Yang Shen , Yunhui Wu , Yuhao Xue

A surface in the Teichm\"uller space, where the systole function admits its maximum, is called a maximal surface. For genus two, a unique maximal surface exists, which is called the Bolza surface, whose systolic geodesics give a…

Geometric Topology · Mathematics 2025-04-15 Achintya Dey , Bhola Nath Saha , Bidyut Sanki

Inspired by [6, 7], we study the boundary regularity of constant curvature hypersurfaces in the hyperbolic space $\mathbb{H}^{n+1}$, which have prescribed asymptotic boundary at infinity. Through constructing the boundary expansions of the…

Analysis of PDEs · Mathematics 2018-01-30 Xumin Jiang , Ling Xiao

We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…

Social and Information Networks · Computer Science 2017-02-10 Matthew Farrell , Timothy Goodrich , Nathan Lemons , Felix Reidl , Fernando Sánchez Villaamil , Blair D. Sullivan

We construct an infinite family of homologous, non-isotopic, symplectic surfaces of any genus greater than one in a certain class of closed, simply connected, symplectic four-manifolds. Our construction is the first example of this…

Geometric Topology · Mathematics 2018-12-24 B. Doug Park , Mainak Poddar , Stefano Vidussi

We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…

Combinatorics · Mathematics 2020-01-07 Carlos Hoppen , Giovane Mansan

The generating functions of the Severi degrees for sufficiently ample line bundles on algebraic surfaces are multiplicative in the topological invariants of the surface and the line bundle. Recently new proofs of this fact were given for…

Algebraic Geometry · Mathematics 2015-11-10 Lothar Göttsche , Benjamin Kikwai

We give sharp upper bounds on the injectivity radii of complete hyperbolic surfaces of finite area with some geodesic boundary components. The given bounds are over all such surfaces with any fixed topology; in particular, boundary lengths…

Geometric Topology · Mathematics 2020-05-14 Jason DeBlois , Kim Romanelli

The notion of a symplectic expansion directly relates the topology of a surface to formal symplectic geometry. We give a method to construct a symplectic expansion by solving a recurrence formula given in terms of the…

Geometric Topology · Mathematics 2012-07-20 Yusuke Kuno

The scaling properties of the maximal height of a growing self-affine surface with a lateral extent $L$ are considered. In the late-time regime its value measured relative to the evolving average height scales like the roughness: $h^{*}_{L}…

Statistical Mechanics · Physics 2009-11-07 Subhadip Raychaudhuri , Michael Cranston , Corry Pryzybla , Yonathan Shapir

This paper aims to develop the mathematical representation of a surface generated by elliptical arcs joining the sides of a regular polygon to a point lying vertically upward on the central axis of the polygon. The volume of the…

History and Overview · Mathematics 2020-09-02 Shahid Saeed Siddiqi , Abdul Rauf Nizami

We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…

Statistical Mechanics · Physics 2009-11-07 Duncan S. Callaway , John E. Hopcroft , Jon M. Kleinberg , M. E. J. Newman , Steven H. Strogatz
‹ Prev 1 4 5 6 7 8 10 Next ›