Related papers: Random generation and scaling limits of fixed genu…
This manuscript studies a special case of the Hurwitz enumeration problem: for branched covers from genus g compact Riemann surface to the Riemann sphere, with three branch points, and require the branching data at one of the branch points…
Statistical fluctuations in population sizes of microbes may be quite large depending on the nature of their underlying stochastic dynamics. For example, the variance of the population size of a microbe undergoing a pure birth process with…
Our work studies the enumeration and random generation of unlabeled combinatorial classes of unrooted graphs. While the technique of vertex pointing provides a straightforward procedure for analyzing a labeled class of unrooted graphs by…
The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the…
This work discusses the homogenization analysis for diffusion processes on scale-free metric graphs, using weak variational formulations. The oscillations of the diffusion coefficient along the edges of a metric graph induce internal…
We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a…
We consider the following inference problem: Given a set of edge-flow signals observed on a graph, lift the graph to a cell complex, such that the observed edge-flow signals can be represented as a sparse combination of gradient and curl…
We present a procedure to sample uniformly from the set of combinatorial isomorphism types of balanced triangulations of surfaces - also known as graph-encoded surfaces. For a given number $n$, the sample is a weighted set of graph-encoded…
We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…
We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
Discrete mixture models provide a well-known basis for effective clustering algorithms, although technical challenges have limited their scope. In the context of gene-expression data analysis, a model is presented that mixes over a finite…
For a manifold $W$ and an $E_d$-algebra $A$, the factorisation homology $\int_W A$ can be seen as a generalisation of the classical configuration space of labelled particles in $W$. It carries an action by the diffeomorphism group…
We study a general factor analysis framework where the $n$-by-$p$ data matrix is assumed to follow a general exponential family distribution entry-wise. While this model framework has been proposed before, we here further relax its…
Grokking has been actively explored to reveal the mystery of delayed generalization and identifying interpretable representations and algorithms inside the grokked models is a suggestive hint to understanding its mechanism. Grokking on…
An acyclic mapping from an $n$ element set into itself is a mapping $\phi$ such that if $\phi^k(x) = x$ for some $k$ and $x$, then $\phi(x) = x$. Equivalently, $\phi^\ell = \phi^{\ell+1} = ...$ for $\ell$ sufficiently large. We investigate…
Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…
One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…