English
Related papers

Related papers: Short cycles in high genus unicellular maps

200 papers

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

Dynamical Systems · Mathematics 2015-12-03 Pierre-Antoine Guihéneuf

The main goal of this article is to understand how the length spectrum of a random surface depends on its genus. Here a random surface means a surface obtained by randomly gluing together an even number of triangles carrying a fixed metric.…

Geometric Topology · Mathematics 2016-04-28 Bram Petri

A stationary Poisson line tessellation is considered whose directional distribution is concentrated on two different atoms with some positive weights. The shape of the typical cell of such a tessellation is studied when its area or its…

Probability · Mathematics 2014-07-08 Mareen Beermann , Claudia Redenbach , Christoph Thaele

We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…

Statistical Mechanics · Physics 2010-09-14 Dmitri Krioukov , Fragkiskos Papadopoulos , Maksim Kitsak , Amin Vahdat , Marian Boguna

A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any…

Combinatorics · Mathematics 2012-03-15 Guillaume Chapuy

Let $S_{g,n}$ be a surface of genus $g $ with $n$ marked points. Let $X$ be a complete hyperbolic metric on $S_{g,n}$ with $n$ cusps. Every isotopy class $[\gamma]$ of a closed curve $\gamma \in \pi_{1}(S_{g,n})$ contains a unique closed…

Geometric Topology · Mathematics 2016-01-14 Maryam Mirzakhani

We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a Poisson process on the torus of length L (the line segment [0,L] with periodic boundary conditions), and where an edge is present between two…

Probability · Mathematics 2022-10-21 Michael Wilsher , Carl Dettmann , Ayalvadi Ganesh

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…

Combinatorics · Mathematics 2011-02-09 Deepak Bal , Alan Frieze

We present two constructions, both inspired by ideas from graph theory, of sequences random surfaces of growing area, whose systoles grow logarithmically as a function of their area. This also allows us to prove a new lower bound on the…

Geometric Topology · Mathematics 2024-03-04 Mingkun Liu , Bram Petri

We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of…

Combinatorics · Mathematics 2019-10-10 Mohamed Slim Kammoun , Mylène Maïda

We study geometric random graphs defined on the points of a Poisson process in $d$-dimensional space, which additionally carry independent random marks. Edges are established at random using the marks of the endpoints and the distance…

Probability · Mathematics 2022-08-10 Peter Gracar , Arne Grauer , Peter Mörters

A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with m edges, graphs with loops,…

Combinatorics · Mathematics 2009-11-02 Greg Brockman , Bill Kay , Emma E. Snively

Consider the tesselation of the hyperbolic plane by m-gons, l per vertex. In its 1-skeleton, we compute the growth series of vertices, geodesics, tuples of geodesics with common extremities. We also introduce and enumerate "holly trees", a…

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi , Tullio G. Ceccherini-Silberstein

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…

Combinatorics · Mathematics 2018-03-23 Michael Krivelevich , Matthew Kwan , Benny Sudakov

We study the combinatorial geometry of a random closed multicurve on a surface of large genus and of a random square-tiled surface of large genus. We prove that primitive components of a random multicurve represent linearly independent…

Geometric Topology · Mathematics 2023-04-06 Vincent Delecroix , Elise Goujard , Peter Zograf , Anton Zorich

Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C \subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1},…

Combinatorics · Mathematics 2010-06-09 Alan Frieze , Michael Krivelevich , Po-Shen Loh

Brooks and Makover introduced an approach to studying the global geometric quantities (in particular, the first eigenvalue of the Laplacian, injectivity radius and diameter) of a ``typical'' compact Riemann surface of large genus based on…

Probability · Mathematics 2007-05-23 Alex Gamburd

We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…

Differential Geometry · Mathematics 2017-05-17 Bram Petri

The purpose this article is to try to understand the mysterious coincidence between the asymptotic behavior of the volumes of the Moduli Space of closed hyperbolic surfaces of genus $g$ with respect to the Weil-Petersson metric and the…

Geometric Topology · Mathematics 2021-11-01 Cayo Dória

We consider random rooted maps without regard to their genus, with fixed large number of edges, and address the problem of limiting distributions for six different parameters: vertices, leaves, loops, root edges, root isthmus, and root…

Combinatorics · Mathematics 2018-02-21 Olivier Bodini , Julien Courtiel , Sergey Dovgal , Hsien-Kuei Hwang