Related papers: Grove arctic curves from periodic cluster modular …
In this survey article we describe some geometric results in the theory of noncommutative rings and, more generally, in the theory of abelian categories. Roughly speaking and by analogy with the commutative situation, the category of graded…
A $p$-adic version of Gromov-Witten invariants for counting plane curves of genus $g$ and degree $d$ through a given number of points is discussed. The multiloop version of $p$-adic string theory considered by Chekhov and others motivates…
For a given elliptic curve $\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\dots$ which complements earlier…
Regression trees and random forests are popular and effective non-parametric estimators in practical applications. A recent paper by Athey and Wager shows that the random forest estimate at any point is asymptotically Gaussian; in this…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
We consider a natural model of inhomogeneous random graphs that extends the classical Erd\H os-R\'enyi graphs and shares a close connection with the multiplicative coalescence, as pointed out by Aldous [AOP 1997]. In this model, the…
Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive…
A meander can be seen as a pair of transversally intersecting simple closed curves on a 2-sphere. We consider pairs of transversally intersecting simple closed curves on a closed oriented surface of arbitrary genus g. The number of such…
Let $E$ be an elliptic curve over a quartic field $K$. By the Mordell-Weil theorem, $E(K)$ is a finitely generated group. We determine all the possibilities for the torsion group $E(K)_{tor}$ where $K$ ranges over all quartic fields $K$ and…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
Convolution trees, loopy belief propagation, and fast numerical p-convolution are combined for the first time to efficiently solve networks with several additive constraints between random variables. An implementation of this "convolution…
The arboreal gas is the probability measure on (unrooted spanning) forests of a graph in which each forest is weighted by a factor $\beta>0$ per edge. It arises as the $q\to 0$ limit of the $q$-state random cluster model with $p=\beta q$.…
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…
We study (unrooted) random forests on a graph where the probability of a forest is multiplicatively weighted by a parameter $\beta>0$ per edge. This is called the arboreal gas model, and the special case when $\beta=1$ is the uniform forest…
Using Gromov-Witten theory the numbers of complex plane rational curves of degree d through 3d-1 general given points can be computed recursively with Kontsevich's formula that follows from the so-called WDVV equations. In this paper we…
Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…
Consider genus $g$ curves that admit degree $d$ covers to elliptic curves only branched at one point with a fixed ramification type. The locus of such covers forms a one parameter family $Y$ that naturally maps into the moduli space of…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
We propose principled Gaussian processes (GPs) for modeling functions defined over the edge set of a simplicial 2-complex, a structure similar to a graph in which edges may form triangular faces. This approach is intended for learning…
We study the topological structure of random geometric forests $G$ in the Euclidean plane under mild assumptions: non-crossing edges, stationarity, and finite edge intensity. The framework covers a broad range of constructions, including…