Related papers: From modular invariants to graphs: the modular spl…
Our work proposes a unified approach to three different topics in a general Riemannian setting: splitting theorems, symmetry results and overdetermined elliptic problems. By the existence of a stable solution to the semilinear equation…
Topological phases of matter in (2+1) dimensions are commonly equipped with global symmetries, such as electric-magnetic duality in gauge theories and bilayer symmetry in fractional quantum Hall states. Gauging these symmetries into local…
The partition function of a factor graph and the partition function of the dual factor graph are related to each other by the normal factor graph duality theorem. We apply this result to the classical problem of computing the partition…
This thesis is concerned with the application of operadic methods, particularly modular operads, to questions arising in the study of moduli spaces of surfaces as well as applications to the study of homotopy algebras and new constructions…
Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian…
Modular graph forms are a class of non-holomorphic modular forms that arise in the low-energy expansion of genus-one closed string amplitudes. In this work, we introduce a systematic procedure to convert lattice-sum representations of…
We perform a detailed investigation of Bipartite Field Theories (BFTs), a general class of 4d N=1 gauge theories which are defined by bipartite graphs. This class of theories is considerably expanded by identifying a new way of assigning…
A graph $G$ is a {\em chordal-$k$-generalized split graph} if $G$ is chordal and there is a clique $Q$ in $G$ such that every connected component in $G[V \setminus Q]$ has at most $k$ vertices. Thus, chordal-$1$-generalized split graphs are…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
We study the problem of partitioning the vertex set of a given graph so that each part induces a graph with components of bounded order; we are also interested in restricting these components to be paths. In particular, we say a graph $G$…
We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (a cospectral mate), or at least one other graph with the same Smith normal form…
The SU(3) modular invariant partition functions were first completely classified in Ref.\ \SU. The purpose of these notes is four-fold: \item{(i)} Here we accomplish the SU(3) classification using only the most basic facts: modular…
We review a method of construction of exceptional graphs generalising the ADE Dynkin diagrams which encode the spectrum of conformal field theories described by conformal embeddings of $\widehat{sl}(n)_k$.
Normalized-cut graph partitioning aims to divide the set of nodes in a graph into $k$ disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters. In this paper, we consider a fair variant of the…
Partition of unity methods (PUMs) on graphs represent straightforward and remarkably adaptable auxiliary techniques for graph signal processing. By relying solely on the intrinsic graph structure, we propose the generation of a partition of…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
We use the tropical geometry approach to compute absolute and relative Gromov-Witten invariants of complex surfaces which are $\CC P^1$-bundles over an elliptic curve. We also show that the tropical multiplicity used to count curves can be…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well as over the choice of tractable families used for the…
The recent emergence of the modern conformal bootstrap method for the study of conformal field theories (CFTs) has enabled the revisiting of old problems in classical critical phenomena described by three-dimensional CFTs. The study of such…