相关论文: Fractional revival between twin vertices

In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence…

Two graphs are said to be $Q$-cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if there exists no other non-isomorphic simple…

Graphic statics is undergoing a renaissance, with computerized visual representation becoming both easier and more spectacular as time passes. While methods of the past are revived and tweaked, little emphasis has been placed on studying…

Many multi-dimensional signals appear in the real world, such as digital images and data that has spatial and temporal dimensions. How to show the spectrum of these multi-dimensional signals correctly is a key challenge in the field of…

We have provided a fractional generalization of the Poisson renewal processes by replacing the first time derivative in the relaxation equation of the survival probability by a fractional derivative of order $\alpha ~(0 < \alpha \leq 1)$. A…

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…

We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…

Random-lattice fermions have been shown to be free of the doubling problem if there are no interactions or interactions of a non-gauge nature. On the other hand, gauge interactions impose stringent constraints as expressed by the…

We address the Laplacian on a perturbed periodic graph which might not be a periodic graph. We present a class of perturbed graphs for which the essential spectra of the Laplacians are stable even when the graphs are perturbed by adding and…

In this note, we establish a relationship between fractional Dehn twist coefficients of Riemann surface automorphisms and modular invariants of holomorphic families of algebraic curves. Specially, we give a characterization of…

Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…

Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…

In this paper we study the bilateral filter proposed by Tomasi and Manduchi, as a spectral domain transform defined on a weighted graph. The nodes of this graph represent the pixels in the image and a graph signal defined on the nodes…

We prove a categorical duality between a class of abstract algebras of partial functions and a class of (small) topological categories. The algebras are the isomorphs of collections of partial functions closed under the operations of…

Bootstrap percolation is a type of cellular automaton on graphs, introduced as a simple model of the dynamics of ferromagnetism. Vertices in a graph can be in one of two states: `healthy' or `infected' and from an initial configuration of…

We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…

The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs…

We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…

In this paper, we explore the topic of graph learning from the perspective of the Irregularity-Aware Graph Fourier Transform, with the goal of learning the graph signal space inner product to better model data. We propose a novel method to…

Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…