Related papers: Random surfaces with large systoles
We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.
Stochastic models of surface growth are usually based on randomly choosing a substrate site to perform iterative steps, as in the etching model [1]. In this paper I modify the etching model to perform sequential, instead of random,…
We introduce a model of a randomly growing interface in multidimensional Euclidean space. The growth model incorporates a random order model as an ingredient of its graphical construction, in a way that replicates the connection between the…
We study the systole of a model of random hyperbolic 3-manifolds introduced by Petri and Raimbault, answering a question posed in that same article. These are compact manifolds with boundary constructed by randomly gluing truncated…
A one-dimensional cellular automaton with a probabilistic evolution rule can generate stochastic surface growth in $(1 + 1)$ dimensions. Two such discrete models of surface growth are constructed from a probabilistic cellular automaton…
In this note we study the systoles of convex hypersurfaces in $\mathbb{R}^{2n}$ invariant under an anti-symplectic involution. We investigate a uniform upper bound of the ratio between the systole and the symmetric systole of the…
We exhibit orbits of the geodesic flow on a hyperbolic surface with at least one cusp such that every tubular neighborhood contains uncountably many distinct geodesic flow orbits. The proof relies on new phenomena, namely the existence of…
The goal of this work is to give new quantitative results about the distribution of semi-arithmetic hyperbolic surfaces in the moduli space of closed hyperbolic surfaces. We show that two coverings of genus $g$ of a fixed arithmetic surface…
In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…
We study the distributional properties of horizontal visibility graphs associated with random restrictive growth sequences and random set partitions of size $n.$ Our main results are formulas expressing the expected degree of graph nodes in…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…
In this note we show that the expected value of the separating systole of a random surface of genus $g$ with respect to Weil-Petersson volume behaves like $2\log g $ as the genus goes to infinity. This is in strong contrast to the behavior…
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…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains $N$ virtual vertices and no edges. Each time a vertex is…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
We give the asymptotic growth of the number of (multi-)arcs of bounded length between boundary components on complete finite-area hyperbolic surfaces with boundary. Specifically, if $S$ has genus $g$, $n$ boundary components and $p$…