Related papers: Graphons, Geometry, and Dynamics: Forward and Inve…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
The Steklov problem is an eigenvalue problem with the spectral parameter in the boundary conditions, which has various applications. Its spectrum coincides with that of the Dirichlet-to-Neumann operator. Over the past years, there has been…
In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectra, by equality of cycle densities, and by a unitary…
We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $\delta$-type), which show how various types of changes of a local or…
Graph neural networks (GNNs) are composed of layers consisting of graph convolutions and pointwise nonlinearities. Due to their invariance and stability properties, GNNs are provably successful at learning representations from data…
Crofton's formula of integral geometry evaluates the total motion invariant measure of the set of $k$-dimensional planes having nonempty intersection with a given convex body. This note deals with motion invariant measures on sets of pairs…
Graphene research is currently one of the largest fields in condensed matter. Due to its unusual electronic spectrum with Dirac-like quasiparticles, and the fact that it is a unique example of a metallic membrane, graphene has properties…
We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…
We investigate dispersionless integrable systems in 3D associated with fourfolds in the Grassmannian Gr(3,5). Such systems appear in numerous applications in continuum mechanics, general relativity and differential geometry, and include…
This paper aims to establish theoretical foundations of graph product multilayer networks (GPMNs), a family of multilayer networks that can be obtained as a graph product of two or more factor networks. Cartesian, direct (tensor), and…
Data are often represented as graphs. Many common tasks in data science are based on distances between entities. While some data science methodologies natively take graphs as their input, there are many more that take their input in…
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…
Geometrical objects describing the material geometry of continuously defective graphene sheets are introduced and their compatibility conditions are formulated. Effective edge dislocations embedded in the Riemann-Cartan material space and…
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…
Graph convolutional networks (GCNs) are a widely used method for graph representation learning. To elucidate the capabilities and limitations of GCNs, we investigate their power, as a function of their number of layers, to distinguish…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
Recent work has introduced sparse exchangeable graphs and the associated graphex framework, as a generalization of dense exchangeable graphs and the associated graphon framework. The development of this subject involves the interplay…
Suspended graphene sheets exhibit correlated random deformations that can be studied under the framework of rough surfaces with a Hurst (roughness) exponent $0.72 \pm 0.01$. Here, we show that, independent of the temperature, the iso-height…
We initiate the study of spectral generalizations of the graph isomorphism problem. (a)The Spectral Graph Dominance (SGD) problem: On input of two graphs $G$ and $H$ does there exist a permutation $\pi$ such that $G\preceq \pi(H)$? (b) The…
Simplicial synchronization reveals the role that topology and geometry have in determining the dynamical properties of simplicial complexes. Simplicial network geometry and topology are naturally encoded in the spectral properties of the…