Related papers: On the Genus of a Random Riemann Surface
We will show that any open Riemann surface $M$ of finite genus is biholomorphic to an open set of a compact Riemann surface. Moreover, we will introduce a quotient space of forms in $M$ that determines if $M$ has finite genus and also the…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
We study random tiling models in the limit of high rotational symmetry. In this limit a mean-field theory yields reasonable predictions for the configurational entropy of free boundary rhombus tilings in two dimensions. We base our…
We initiate the study of random iteration of automorphisms of real and complex projective surfaces, or more generally compact K{\"a}hler surfaces, focusing on the fundamental problem of classification of stationary measures. We show that,…
This paper proposes an algorithm to find robust reliability-based topology optimized designs under a random-field material model. The initial design domain is made of linear elastic material whose property, i.e., Young's modulus, is modeled…
We define a new topological polynomial extending the Bollobas-Riordan one, which obeys a four-term reduction relation of the deletion/contraction type and has a natural behavior under partial duality. This allows to write down a completely…
For a prime $p$ we define the Paley graph to be the graph with the set of vertices $\mathbb{Z}/p\mathbb{Z}$, and with edges connecting vertices whose sum is a quadratic residue. Paley graphs are notoriously difficult to study, particularly…
Random graph (RG) models play a central role in the complex networks analysis. They help to understand, control, and predict phenomena occurring, for instance, in social networks, biological networks, the Internet, etc. Despite a large…
We study the asymptotic laws for the number, Betti numbers, and isotopy classes of connected components of zero sets of real Gaussian random fields, where the random zero sets almost surely consist of submanifolds of codimension greater…
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…
For a cubic hypersurface $X$, work of Galkin--Shinder and Voisin shows the existence of a birational map relating the Hilbert scheme of two points $X^{[2]}$ with a certain projective bundle over $X$. Belmans--Fu--Raedschelders show that…
We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it $p$-robust random graph. It means that every edge is present with probability at least $p$, regardless…
Topologically, a compact Riemann surface $X$ of genus $g$ is a $g$-holed torus (a sphere with $g$ handles). This paper is an introduction to the theory of compact Riemann surfaces and algebraic curves. It presents the basic ideas and…
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…
Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…
Mean density of lower dimensional random closed sets, as well as the mean boundary density of full dimensional random sets, and their estimation are of great interest in many real applications. Only partial results are available so far in…
It has long been known that random regular graphs are with high probability good expanders. This was first established in the 1980s by Bollob\'as by directly calculating the probability that a set of vertices has small expansion and then…
A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…
We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…
We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…