相关论文: Analyse harmonique sur le graphe de Pascal
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
We study the Laplacian on a metrized graph, and its eigenfunctions.
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…
A mechanism is described to symmetrize the ultraspherical spectral method for self-adjoint problems. The resulting discretizations are symmetric and banded. An algorithm is presented for an adaptive spectral decomposition of self-adjoint…
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…
We study how the number $c(X)$ of components of a graph $X$ can be expressed through the number and properties of the components of a quotient graph $X/\sim.$ We partially rely on classic qualifications of graph homomorphisms such as…
We describe the spectral theory of the adjacency operator of a graph which is isomorphic to homogeneous trees at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the…
In the context of complex algebraic varieties, the decomposition theorem for semi-small maps provides a decomposition of the direct image of the constant sheaf. In this work, we develop a decomposition theorem for branched coverings of…
Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method of spectral analysis on self-similar graphs. We give an…
Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…
In this paper we investigate a spectra of the Laplacian matrix of cyclic groups using the properties of their characteristic polynomials. We have proved several assertions about the relationship between the spectra of different groups.
We show that a compact representation of a semisimple Lie group has an orthogonal decomposition into finite length representations. This generalises and simplifies a number of more special spectral theorems in the literature. We apply it to…
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…
In the recent literature, various authors have studied spectral comparison results for Schr\"odinger operators with discrete spectrum in different settings including Euclidean domains and quantum graphs. In this note we derive such spectral…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
Graph theory is emerging as a new source of tools for time series analysis. One promising method is to transform a signal into its visibility graph, a representation which captures many interesting aspects of the signal. Here we introduce…
I will show that operator of analytic (harmonic) continuation on a lattice graph has a positive spectrum. I use a theorem about positivity of eigenvalues of totally positive matrices. I conjecture that by approximation the similar result…