Related papers: Grove arctic curves from periodic cluster modular …
We study the pressure of the "edge-triangle model", which is equivalent to the cumulant generating function of triangles in the Erd\"os-R\'enyi random graph. By analyzing finite graphs of increasing volume, as well as the graphon…
In the paper arXiv:1803.11463, the authors study the arctic curve arising in random tilings of some planar domains with an arbitrary distribution of defects on one edge. Using the tangent method they derive a parametric equation for…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
A graph generative model defines a distribution over graphs. One type of generative model is constructed by autoregressive neural networks, which sequentially add nodes and edges to generate a graph. However, the likelihood of a graph under…
We study the evolution of graphs densifying by adding edges: Two vertices are chosen randomly, and an edge is (i) established if each vertex belongs to a tree; (ii) established with probability $p$ if only one vertex belongs to a tree;…
Let X be an Abelian surface and C a holomorphic curve in X representing a primitive homology class. The space of genus g curves in the class of C is g dimensional. We count the number of such curves that pass through g generic points and we…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
The modular curves serve as excellent objects for testing conjectures in arithmetic geometry. They possess a natural geometric definition in contrast with rather nontrivial structure. On the other hand, they are well-studied from the…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
This is a survey article written for the Jahresberichte der DMV. Tropical geometry can be viewed as an efficient combinatorial tool to study degenerations in algebraic geometry. Abstract tropical curves are essentially metric graphs, and…
We examine complements (inside products of a smooth projective complex curve of arbitrary genus) of unions of diagonals indexed by the edges of an arbitrary simple graph. We use Gysin models associated to these quasi-projective manifolds to…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…
This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…
We consider a Gibbs distribution over all spanning trees of an undirected, edge weighted finite graph, where, up to normalization, the probability of each tree is given by the product of its edge weights. Defining the weighted degree of a…
Simple boundary expressions for the k-th power of the cotangent line class on the moduli space of stable 1-pointed genus g curves are found for k >= 2g. The method is by virtual localization on the moduli space of maps to the projective…
A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…
We study the T-system of type $A_\infty$, also known as the octahedron recurrence/equation, viewed as a 2+1-dimensional discrete evolution equation. Generalizing the study of [P. Di Francesco and R. Soto-Garrido. Arctic curves of the…