Related papers: Exterior-Interior Duality for Discrete Graphs
The notion of an exterior differential system (on a manifold) has recently been extended to the setting of a Lie algebroid. Here, we further develop the theory and we present two versions of the Cartan-K\"ahler theorem in the case where the…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We consider classes of simply connected planar domains which are isophasal, ie, have the same scattering phase $s(\l)$ for all $\l > 0$. This is a scattering-theoretic analogue of isospectral domains. Using the heat invariants and the…
We extend the use of derivative dispersion relations to the study of slopes of the real and imaginary amplitudes in pp and p-pbar elastic scattering. The new relations are tested against the solutions for the amplitudes obtained in the…
It is reported that dynamical systems over digraphs have superior performance in terms of system damping and tolerance to time delays if the underlying graph Laplacian has a purely real spectrum. This paper investigates the topological…
In this paper, we will consider scattering diagrams in the context of infinite-derivative theories. First, we examine a finite-order higher-derivative scalar field theory and find that we cannot eliminate the external momentum divergences…
The direct transition-matrix approach to determination of the electric polarizabilities of quantum bound systems developed in my recent work is applied to study the electric multipole polarizabilities of a two-particle bound complex with a…
In this talk, we review recent developments towards the calculation of multi-loop scattering amplitudes. In particular, we discuss how the colour-kinematics duality can provide new integral relations at one-loop level via the Loop-Tree…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
We consider the Laplacian in a domain squeezed between two parallel curves in the plane, subject to Dirichlet boundary conditions on one of the curves and Neumann boundary conditions on the other. We derive two-term asymptotics for…
We apply the multi-particle fields model to calculate the differential cross-section d{\sigma}/dt of elastic proton-proton scattering. This problem includes the calculation of multidimensional integrals arising from the loop Feynman…
The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…
We introduce a set of novel multiscale basis transforms for signals on graphs that utilize their "dual" domains by incorporating the "natural" distances between graph Laplacian eigenvectors, rather than simply using the eigenvalue ordering.…
We consider a metric graph consisting of two edges, one of which has length $\varepsilon$ which we send to zero. On this graph we study the resolvent and spectrum of the Laplacian subject to a general vertex condition at the connecting…
We examine the transient scattered and transmitted fields generated when an incident electromagnetic wave impinges on a dielectric scatterer or a coated conductor embedded in an infinite space. By applying a boundary-field equation method,…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
We study the $p$-independence of spectra of Laplace operators on graphs arising from regular Dirichlet forms on discrete spaces. Here, a sufficient criterion is given solely by a uniform subexponential growth condition. Moreover, under a…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
Strong matrix properties, roughly speaking, refer to generic conditions on a matrix such that its spectral perturbation and pattern perturbation interact nicely to cover a neighborhood in the ambient space. With a rich history, these strong…