Related papers: On the Genus of a Random Riemann Surface
We describe a new family of $k$-uniform hypergraphs with independent random edges. The hypergraphs have a high probability of being peelable, i.e. to admit no sub-hypergraph of minimum degree $2$, even when the edge density (number of edges…
Bauer and Itzykson showed that associated to each labeled map embedded on an oriented Riemann surface there was a group generated by a pair of permutations. From this result an algorithm may be constructed for enumerating labeled maps, and…
We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…
Recently Bowden, Hensel and Webb defined the fine curve graph for surfaces, extending the notion of curve graphs for the study of homeomorphism or diffeomorphism groups of surfaces. Later Long, Margalit, Pham, Verberne and Yao proved that…
Normally one assumes isolated surface singularities to be normal. The purpose of this paper is to show that it can be useful to look at nonnormal singularities. By deforming them interesting normal singularities can be constructed, such as…
We consider the moduli space of bordered Riemann surfaces with boundary and marked points. Such spaces appear in open-closed string theory, particularly with respect to holomorphic curves with Lagrangian submanifolds. We consider a…
Exponential random graph models (ERGMs) are a widely used framework for network data, enabling hypothesis testing on the structural mechanisms underlying observed networks. Bayesian ERGMs provide principled uncertainty quantification and…
We study the construction of substitution tilings of the plane based on certain simplicial configurations of tangents of the deltoid with evenly distributed orientations. The random tiling ensembles are obtained as a result of tile…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
The goal of this tutorial is to promote interest in the study of random Boolean networks (RBNs). These can be very interesting models, since one does not have to assume any functionality or particular connectivity of the networks to study…
We provide a survey of results on the statistics of random sections of holomorphic line bundles on K\"ahler manifolds, with an emphasis on the resulting asymptotics when a line bundle is raised to increasing tensor powers. We conclude with…
Probability density estimation is a central task in statistics. Copula-based models provide a great deal of flexibility in modelling multivariate distributions, allowing for the specifications of models for the marginal distributions…
We study the expected behavior of the Betti numbers of arrangements of the zeros of random (distributed according to the Kostlan distribution) polynomials in $\mathbb{R}\mathrm{P}^n$. Using a random spectral sequence, we prove an…
Amit and Linial showed that a random lift of a graph with minimum degree $\delta\ge3$ is asymptotically almost surely $\delta$-connected, and mentioned the problem of estimating this probability as a function of the degree of the lift. We…
We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…
Within classical optics, one may add microscopic "roughness" to a macroscopically flat mirror so that parallel rays of a given angle are reflected at different outgoing angles. Taking the limit (as the roughness becomes increasingly…
In this thesis we consider a way to construct a rich family of compact Riemann Surfaces in a combinatorial way. Given a 3-regualr graph with orientation, we construct a finite-area hyperbolic Riemann surface by gluing triangles according to…
We define a class a metric spaces we call Brownian surfaces, arising as the scaling limits of random maps on general orientable surfaces with a boundary and we study the geodesics from a uniformly chosen random point. These metric spaces…