Related papers: On the Genus of a Random Riemann Surface
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
We consider models of random groups in which the typical group is of intermediate rank (in particular, it is not hyperbolic). These models are parallel to M. Gromov's well-known constructions and include for example a "density model" for…
We develop an approach to generate random graphs to a target level of assortativity by using copula structures in graphons. Unlike existing random graph generators, we do not use rewiring or binning approaches to generate the desired random…
We study deformations of complex hyperbolic surfaces which furnish the simplest examples of: (i) negatively curved K\"ahler manifolds and (ii) negatively curved Riemannian manifolds not having {\it constant} curvature. Although such complex…
Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…
In this work, we study a family of random geometric graphs on hyperbolic spaces. In this setting, N points are chosen randomly on a hyperbolic space and any two of them are joined by an edge with probability that depends on their hyperbolic…
We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…
An almost-Riemannian structure on a surface is a generalized Riemannian structure whose local orthonormal frames are given by Lie bracket generating pairs of vector fields that can become collinear. The distribution generated locally by…
We study the conformal type of surfaces spread over the sphere via random quasiconformal maps. Constructing a random Beltrami coefficient on the complex plane, we obtain a locally quasiconformal homeomorphism with prescribed dilatation that…
Shape restricted regressions, including isotonic regression and concave regression as special cases, are studied using priors on Bernstein polynomials and Markov chain Monte Carlo methods. These priors have large supports, select only…
Interpreting the number of ramified covering of a Riemann surface by Riemann surfaces as the relative Gromov-Witten invariants and applying a gluing formula, we derive a recursive formula for the number of ramified covering of a Riemann…
Recent literature on Weil-Petersson random hyperbolic surfaces has met a consistent obstacle: the necessity to condition the model, prohibiting certain rare geometric patterns (which we call tangles), such as short closed geodesics or…
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…
Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…
A restricted Boltzmann machine (RBM) is an undirected graphical model constructed for discrete or continuous random variables, with two layers, one hidden and one visible, and no conditional dependency within a layer. In recent years, RBMs…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
Motivated by the physical concept of special geometry two mathematical constructions are studied, which relate real hypersurfaces to tube domains and complex Lagrangean cones respectively. Me\-thods are developed for the classification of…
The random graph of Erdos and Renyi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its average properties. However, as a model of real-world networks…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Given $2n$ unit equilateral triangles, there are finitely many ways to glue each edge to a partner. We obtain a random sphere-homeomorphic surface by sampling uniformly from the gluings that produce a topological sphere. As $n$ tends to…