Related papers: A Complete Characterization of the Inverse Eigenve…
The Bayesian approach to inverse problems provides a practical way to solve ill-posed problems by augmenting the observation model with prior information. Due to the measure-theoretic underpinnings, the approach has raised theoretical…
In 1974, Erd\H{o}s asked the following question: given a graph $G$ and a directed graph $\vec{H}$, how many ways are there to orient the edges of $G$ such that it does not contain $\vec{H}$ as a subgraph? We denote this value by $D(G,…
A general treatment of the spectral problem of quantum graphs and tight-binding models in finite Hilbert spaces is given. The direct spectral problem and the inverse spectral problem are written in terms of simple algebraic equations…
We describe a way of assigning labels to the vertices of any undirected graph on up to $n$ vertices, each composed of $n/2+O(1)$ bits, such that given the labels of two vertices, and no other information regarding the graph, it is possible…
We study the spectral properties of certain non-self-adjoint matrices associated with large directed graphs. Asymptotically the eigenvalues converge to certain curves, apart from a finite number that have limits not on these curves.
A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
We consider the inverse boundary value problem in the case of discrete electrical networks containing nonlinear (non-ohmic) resistors. Generalizing work of Curtis, Ingerman, Morrow, Colin de Verdiere, Gitler, and Vertigan, we characterize…
For the direct problem, we give the asymptotic distribution of the (real and non-real) transmission eigenvalues for the Schrodinger operator on the half line. For the inverse problem, we prove that the potential can be uniquely determined…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge…
Identifying influential nodes and edges in directed networks remains a fundamental challenge across domains from social influence to biological regulation. Most existing centrality measures face a critical limitation: they either discard…
We consider non-trivial homomorphisms to reflexive oriented graphs in which some pair of adjacent vertices have the same image. Using a notion of convexity for oriented graphs, we study those oriented graphs that do not admit such…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
The eccentricity matrix of a connected graph $G$ is obtained from the distance matrix of $G$ by retaining the largest distances in each row and each column, and setting the remaining entries as $0$. In this article, a conjecture about the…
Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…
Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of…
Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs also hold for general directed uniform…
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically…