Related papers: Finite-Graph-Cover-Based Analysis of Factor Graphs…
Using functions from electrical networks (graphs with resistors assigned to edges), we prove existence (with explicit formulas) of a canonical Parseval frame in the energy Hilbert space $\mathscr{H}_{E}$ of a prescribed infinite (or finite)…
The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…
We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
We study the statistical complexity of estimating partition functions given sample access to a proposal distribution and an unnormalized density ratio for a target distribution. While partition function estimation is a classical problem,…
Since a long-time, the quantum integrable systems have remained an area where modern mathematical methods have given an access to interesting results in the study of physical systems. The exact computations, both numerical and asymptotic,…
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in…
Collaborative graph analysis across multiple institutions is becoming increasingly popular. Realistic examples include social network analysis across various social platforms, financial transaction analysis across multiple banks, and…
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…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…
We study the $F$-decomposition threshold $\delta_F$ for a given graph $F$. Here an $F$-decomposition of a graph $G$ is a collection of edge-disjoint copies of $F$ in $G$ which together cover every edge of $G$. (Such an $F$-decomposition can…
We study the first-order (FO) model checking problem of dense graphs, namely those which have FO interpretations in (or are FO transductions of) some sparse graph classes. We give a structural characterization of the graph classes which are…
In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…
In this paper we consider Simultaneous Feedback Edge Set (Sim-FES) problem. In this problem, the input is an $n$-vertex graph $G$, an integer $k$ and a coloring function ${\sf col}: E(G) \rightarrow 2^{[\alpha]}$ and the objective is to…
In this work, we rigorously investigate the robustness of graph neural fractional-order differential equation (FDE) models. This framework extends beyond traditional graph neural (integer-order) ordinary differential equation (ODE) models…
We construct an effective Quantum Field Theory for the wrapping effects in 1+1 dimensional models of factorised scattering. The recently developed graph-theoretical approach to TBA gives the perturbative desctiption of this QFT. For the…
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
In this paper, we present a new connection between representation theory of noncommutative hypersurfaces and combinatorics. Let $S$ be a graded ($\pm 1$)-skew polynomial algebra in $n$ variables of degree $1$ and $f =x_1^2 + \cdots +x_n^2…
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…
We often encounter probability distributions given as unnormalized products of non-negative functions. The factorization structures are represented by hypergraphs called factor graphs. Such distributions appear in various fields, including…