相关论文: On Some Bounds on the Perturbation of Invariant Su…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
The compression of a matrix $A\in\mathbb C^{n\times n}$ onto a subspace $V\subset\mathbb C^n$ is the matrix $Q^*AQ$ where the columns of $Q$ form an orthonormal basis for $V$. This is an important object in both operator theory and…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…
For many Markov chains of practical interest, the invariant distribution is extremely sensitive to perturbations of some entries of the transition matrix, but insensitive to others; we give an example of such a chain, motivated by a problem…
Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…
In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…
The unitary transformation of path-integral differential measure is described. The main properties of perturbation theory in the phase space of action-angle, energy-time variables are investigated. The measure in cylindrical coordinates is…
We give sufficient conditions for the following problem: given a topological space X, a metric space Y, a subspace Z of Y, and a continuous map f from X to Y, is it possible, by applying to f an arbitrarily small perturbation, to ensure…
Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
We show, by explicit computation, that bare lattice perturbation theory in the two-dimensional O(n) nonlinear $\sigma$ models with superinstanton boundary conditions is divergent in the limit of an infinite number of points $|\Lambda|$.…
We study linear cosmological perturbations in the most general teleparallel gravity setting, where gravity is mediated by the torsion and nonmetricity of a flat connection alongside the metric. For a general linear perturbation of this…
Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…
We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a…
Perturbation analysis of Markov chains provides bounds on the effect that a change in a Markov transition matrix has on the corresponding stationary distribution. This paper compares and analyzes bounds found in the literature for finite…
In this paper, we study the relative perturbation bounds for joint eigenvalues of commuting tuples of normal $n \times n$ matrices. Some Hoffman-Wielandt type relative perturbation bounds are proved using the Clifford algebra technique. A…
We prove quadratic eigenvalue perturbation bounds for generalized Hermitian eigenvalue problems. The bounds are proportional to the square of the norm of the perturbation matrices divided by the gap between the spectrums. Using the results…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…