相关论文: Hyperwalk Formulae for Even and Odd Laplacians in …

Given a Hermitian vector bundle over an infinite weighted graph, we define the Laplacian associated to a unitary connection on this bundle and study the essential self-adjointness of a perturbation of this Laplacian by an operator-valued…

In the objective of studying concentration and oscillation properties of eigenfunctions of the discrete Laplacian on regular graphs, we construct a pseudo-differential calculus on homogeneous trees, their universal covers. We define symbol…

We consider Laplacians on periodic both discrete and metric equilateral graphs. Their spectrum consists of an absolutely continuous part (which is a union of non-degenerate spectral bands) and flat bands, i.e., eigenvalues of infinite…

Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study. In this paper, we propose a…

As a supplement to my talk at the workshop, this extended abstract motivates and summarizes my work with co-authors on problems in two separate areas: first, in the lambda-calculus with letrec, a universal model of computation, and second,…

We characterize positive critical Hardy weights for general Laplacians on weighted graphs. We then apply this result to fractional Laplacians on general graphs and use the characterization to identify an optimal Hardy weight under suitable…

We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…

Simplicial models have become a crucial tool for studying distributed computing. These models, however, are only able to account for the knowledge, but not for the beliefs of agents. We present a new semantics for logics of belief. Our…

In this work we consider the Laplacian controllability of a graph constructed by interconnecting a finite number of single-input Laplacian controllable graphs. We first study the interconnection realized by the composite graph of two…

The graph of a real symplectic linear transformation is an R-Lagrangian subspace of a complex symplectic vector space. The restriction of the complex symplectic form is thus purely imaginary and may be expressed in terms of the generating…

To a word $w$, we associate the rational function $\Psi_w = \prod (x_{w_i} - x_{w_{i+1}})^{-1}$. The main object, introduced by C. Greene to generalize identities linked to Murnaghan-Nakayama rule, is a sum of its images by certain…

In this article, various aspects of Laplacian spectra of power graphs of finite cyclic, dicyclic and finite $p$-groups are studied. Algebraic connectivity of power graphs of the above groups are considered and determined completely for that…

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…

In quantum logical terms, Hardy-type arguments can be uniformly presented and extended as collections of intertwined contexts and their observables. If interpreted classically those structures serve as graph-theoretic "gadgets" that enforce…

Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by…

Cycles of attacking arguments pose non-trivial issues in Dung style argumentation theory, apparent behavioural difference between odd and even length cycles being a notable one. While a few methods were proposed for treating them, to - in…

We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

We study the spectral determinant of the Laplacian on finite graphs characterized by their number of vertices V and of bonds B. We present a path integral derivation which leads to two equivalent expressions of the spectral determinant of…

In this paper we consider the question of the existence of Hamiltonian circuits in the tope graphs of central arrangements of hyperplanes. Some of the results describe connections between the existence of Hamiltonian circuits in the…