Related papers: Limiting Behavior of Resistances in Triangular Gra…
We consider the statistical problem of recovering a hidden "ground truth" binary labeling for the vertices of a graph up to low Hamming error from noisy edge and vertex measurements. We present new algorithms and a sharp finite-sample…
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…
We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…
Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…
Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender…
In this paper, we study classes of graphs with three types of edges that capture the modified independence structure of a directed acyclic graph (DAG) after marginalisation over unobserved variables and conditioning on selection variables…
Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the…
We perform a massive evaluation of neural networks with architectures corresponding to random graphs of various types. We investigate various structural and numerical properties of the graphs in relation to neural network test accuracy. We…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We applied tensor network contraction algorithms to compute the hard-core lattice gas model, i.e., the enumeration of independent sets on grid graphs. We observed the influence of surface effect and parity effect on the enumeration (and…
In this era of data deluge, many signal processing and machine learning tasks are faced with high-dimensional datasets, including images, videos, as well as time series generated from social, commercial and brain network interactions. Their…
Consider the following stochastic graph process. We begin with the empty graph on n vertices and add edges one at a time, where each edge is chosen uniformly at random from the collection of potential edges that do not form triangles when…
We develop a generalized resistance geometry based on Kron reduction and effective resistance for directed graphs, paralleling classical undirected graph theory. For strongly connected directed graphs, we prove a Fiedler--Bapat identity…
Let $P$ be a set of $n$ vertices in the plane and $S$ a set of non-crossing line segments between vertices in $P$, called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any…
We introduce an efficient algorithm for reducing bond dimensions in an arbitrary tensor network without changing its geometry. The method is based on a novel, quantitative understanding of local correlations in a network. Together with a…
Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…
A sheet of graphene under magnetic bias attains anisotropic surface conductivity, opening the door for realizing compact devices such as Faraday rotators, isolators and circulators. In this paper, an accurate and analytical method is…
In his seminal paper from 1952 Dirac showed that the complete graph on $n\geq 3$ vertices remains Hamiltonian even if we allow an adversary to remove $\lfloor n/2\rfloor$ edges touching each vertex. In 1960 Ghouila-Houri obtained an…
This paper introduces the notion of weak rigidity to characterize a framework by pairwise inner products of inter-agent displacements. Compared to distance-based rigidity, weak rigidity requires fewer constrained edges in the graph to…
Given a resistive electrical network, we would like to determine whether all the resistances (edges) in the network are working, and if not, identify which edge (or edges) are faulty. To make this determination, we are allowed to measure…