Related papers: New relations between discrete and continuous tran…
A new class of exclusion type processes acting in continuum with synchronous updating is introduced and studied. Ergodic averages of particle velocities are obtained and their connections to other statistical quantities, in particular to…
We consider Laplacians on $\Z^2$-periodic discrete graphs. The following results are obtained: 1) The Floquet-Bloch decomposition is constructed and basic properties are derived. 2) The estimates of the Lebesgue measure of the spectrum in…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
We study the spectral theory of a class of piecewise centrosymmetric Jacobi operators defined on an associated family of substitution graphs. Given a finite centrosymmetric matrix viewed as a weight matrix on a finite directed path graph…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
For any graph, we define a rank-1 operator on a bipartite tensor product space, with components associated to the set of vertices and edges respectively. We show that the partial traces of the operator are the Laplacian and the…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
A graph operator is a mapping $\phi$ which maps every graph $G$ from some class of graphs to a new graph $\phi(G)$. In this paper, we introduce and study the properties of the mincut operator, specifically the effects of iteration of the…
The convergence of a new general variable metric algorithm based on compositions of averaged operators is established. Applications to monotone operator splitting are presented.
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…
We provide a class of self-adjoint Laplace operators on metric graphs with the property that the solutions of the associated wave equation satisfy the finite propagation speed property. The proof uses energy methods, which are adaptions of…
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…
We describe a general approach to the theory of self consistent transfer operators. These operators have been introduced as tools for the study of the statistical properties of a large number of all to all interacting dynamical systems…
As key subjects in spectral geometry and combinatorial graph theory respectively, the (continuous) Hodge Laplacian and the combinatorial Laplacian share similarities in revealing the topological dimension and geometric shape of data and in…
The objective of this note is to provide an interpretation of the discrete version of Morse inequalities, following Witten's approach via supersymmetric quantum mechanics, adapted to finite graphs, as a particular instance of Morse-Witten…
Graph Laplacians as well as related spectral inequalities and (co-)homology provide a foray into discrete analogues of Riemannian manifolds, providing a rich interplay between combinatorics, geometry and theoretical physics. We apply some…
We describe operators driving the time evolution of singular diffusion on finite graphs whose vertices are allowed to carry masses. The operators are defined by the method of quadratic forms on suitable Hilbert spaces. The model also covers…
We study the convergence of message passing graph neural networks on random graph models to their continuous counterpart as the number of nodes tends to infinity. Until now, this convergence was only known for architectures with aggregation…