相关论文: Spectral Curve of Periodic Fisher Graphs
In this paper, we investigate the spectral stability of periodic traveling waves for a cubic-quintic and double dispersion equation. Using the quadrature method we find explict periodic waves and we also present a characterization for all…
We investigate the limit behaviour of the spectral measures of matrices following the Gibbs measure for the Ising model on random graphs, Potts model on random graphs, matrices coupled in a chain model or induced QCD model. For most of…
The wave equation for vectors and symmetric tensors in spherical coordinates is studied under the divergence-free constraint. We describe a numerical method, based on the spectral decomposition of vector/tensor components onto spherical…
We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. In a temporal graph, the vertex set is fixed but the edges have (discrete) time labels. Since the corresponding…
In this paper we study the effect of dependence on detecting a class of structured signals in Ferromagnetic Ising models. Natural examples of our class include Ising Models on lattices, and Mean-Field type Ising Models such as dense…
We develop an abstract method to identify spectral points of definite type in the spectrum of the operator $T_1\otimes I_2 + I_1\otimes T_2$. The method is applicable in particular for non-self-adjoint waveguide type operators with…
We propose an alternative variational principle whose critical point is the algebraic plane curve associated to a matrix model (the spectral curve, i.e. the large $N$ limit of the resolvent). More generally, we consider a variational…
In this paper, we study how the distance spectral radius behaves when the graph is perturbed by grafting edges. As applications, we also determine the graph with $k$ cut vertices (respectively, $k$ cut edges) with the minimal distance…
We construct continuous families of pairwise isospectral metrics on various Riemannian manifolds (e.g., Lie groups, projective spaces and products of these with tori) which arise as quotients of other manifolds. This is done by developing a…
Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest…
Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…
We study the relationship between singularities of finite-dimensional integrable systems and singularities of the corresponding spectral curves. For the large class of integrable systems on matrix polynomials, which is a general framework…
For a graph $G$, the spectral radius of $G$ is the largest eigenvalue of its adjacency matrix. A connected factor of $G$ is a connected spanning subgraph of $G$. For example, a spanning tree of $G$ is a 1-connected factor of $G$. Let $G$ be…
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
We compare the spectral properties of two kinds of linear operators characterizing the (classical) geodesic flow and its quantization on connected locally finite graphs without dead ends. The first kind are transfer operators acting on…
We study the spectral stability of small-amplitude Stokes waves in a family of weakly nonlinear, unidirectional models of the form $u_t + L u + (u^2)_x = 0$. We introduce a perturbation method to expand the spectral data in wave amplitude…
The study of the existence of hamiltonian cycles in a graph is a classic problem in graph theory. By incorporating toughness and spectral conditions, we can consider Chv\'{a}tal's conjecture from another perspective: what is the spectral…
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…