Related papers: Nesting statistics in the $O(n)$ loop model on ran…
We study continuous countably (strictly) monotone maps defined on a tame graph, i.e., a special Peano continuum for which the set containing branchpoints and endpoints has a countable closure. In our investigation we confine ourselves to…
We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…
The dynamics of one dimensional iterative maps in the regime of fully developed chaos is studied in detail. Motivated by the observation of dynamical structures around the unstable fixed point we introduce the geometrical concept of a…
Weak gravitational lensing maps compactly encode the evolution of cosmic large-scale structure and are a key tool for cosmological analyses. Performing inference directly at the map level allows flexible choices of statistics and can…
Consider the setting of sparse graphs on N vertices, where the vertices have distinct "names", which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as cN log N for some…
In this paper we propose a model of random compositions of cylinder maps, which in the simplified form is as follows: $(\theta,r)\in \mathbb T\times \mathbb R=\mathbb A$ and \begin{eqnarray} \nonumber f_{\pm 1}:…
We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…
Studying the virtual Euler characteristic of the moduli space of curves, Harer and Zagier compute the generating function $C_g(z)$ of unicellular maps of genus $g$. They furthermore identify coefficients, $\kappa^{\star}_{g}(n)$, which…
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…
This article presents a general approximation-theoretic framework to analyze measure transport algorithms for probabilistic modeling. A primary motivating application for such algorithms is sampling -- a central task in statistical…
The loop $O(n)$ model is a model for a random collection of non-intersecting loops on the hexagonal lattice, which is believed to be in the same universality class as the spin $O(n)$ model. It has been predicted by Nienhuis that for $0\le…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
We compute, for each genus $g\geq 0$, the generating function $L_g\equiv L_g(t;p_1,p_2,\dots)$ of (labelled) bipartite maps on the orientable surface of genus $g$, with control on all face degrees. We exhibit an explicit change of variables…
Probabilistic clustering models (or equivalently, mixture models) are basic building blocks in countless statistical models and involve latent random variables over discrete spaces. For these models, posterior inference methods can be…
Let $N_n(F)$ denote the ring of strictly upper triangular matrices with entries in a field $F$ of characteristic zero and center $Z(N_n(F))$. We characterize the $2$-power commuting maps over $N_n(F)$, maps satisfying the identity…
We compute a number of distance-dependent universal scaling functions characterizing the distance statistics of large maps of genus one. In particular, we obtain explicitly the probability distribution for the length of the shortest…
We study the volume of rigid loop-$O(n)$ quadrangulations with a boundary of length $2p$ in the non-generic critical regime. We prove that, as the half-perimeter $p$ goes to infinity, the volume scales in distribution to an explicit random…
The leaves of angiosperms contain highly complex venation networks consisting of recursively nested, hierarchically organized loops. We describe a new phenotypic trait of reticulate vascular networks based on the topology of the nested…
The loop $O(n)$ model is a family of probability measures on collections of non-intersecting loops on the hexagonal lattice, parameterized by a loop-weight $n$ and an edge-weight $x$. Nienhuis predicts that, for $0 \leq n \leq 2$, the model…
We study the problem of determining the minimal genus of a simple finite connected graph. We present an algorithm which, for an arbitrary graph $G$ with $n$ vertices and $m$ edges, determines the orientable genus of $G$ in…