spectral graph theoryecological modelsMarkov chainsThe generalized distance matrix of a graph is the matrix whose entries depend only on the pairwise distances between vertices, and the generalized distance spectrum is the set of eigenvalues of this matrix. This framework generalizes many of the ...
Linear Algebra and its Applications Volume 442, 1 February 2014, Pages 165–177 Special Issue on Spectral Graph Theory on the occasion of the Latin Ibero-American Spectral Graph Theory Workshop (Rio de Janeiro, 27-28 September 2012) Edited By Nair Abreu, Domingos Cardoso and Vilmar Trevisan ...
The state of the system depends on the network load experienced by the BS and is defined as a discretized value. At the same time, the action of each state is determined by the tuple of spectral sharing parameters associated with each neighboring BS. The spectral sharing parameter for a BS...
Here we rely on the theory of the length spectrum function from algebraic topology, and its relationship to the non-backtracking cycles of a graph, in order to introduce two new techniques: Non-Backtracking Spectral Distance (NBD) for measuring the distance between undirected, unweighted graphs, ...
F. Chung, Spectral Graph Theory, Vol. 92 of CBMS Regional Conference Series in Mathematics (Am. Math. Soc., Washington DC, 1997). A. Grigor’yan, ‘‘Heat kernels on manifolds, graphs and fractals,’’ in Proceedings of the European Congress of Mathematics, Prog. Math. 201, 393–406...
1.Based on S R decomposition theorem and Fourier optical theory, a new technique using computer to analysze laser spectral images of finite deformation automatically was put forward.在 S- R和分解定理和 Fourier光学理论的基础上 ,提出了一种使用计算机对有限变形激光频谱图像进行自动分析的新方法 。 延伸...
The graph theory was adopted to examine the abnormal changes in the brain network topology of ASD. In general, graph can be represented by sets of nodes and edges between these nodes. If edge weight in a graph are either 1 (there is an edge between nodes) or 0 (there is no edge), ...
Basically, a graph with a "small" first non-trivial Laplacian eigenvalue has a relatively clean bisection (i.e., the smaller the spectral gap and the smaller the relative number of edges required to be cut away to generate a bipartition), conversely, a large spectral gap characterizes non-...
Computerized Fourier analysis, particularly in the form of theFFTalgorithm, is a powerful tool for furthering our understanding ofwaveformsand their related spectral components. This same mathematical routine programmed into theSPICEsimulator as the .fourier option is also programmed into a variety of ...
Based on S R decomposition theorem and Fourier optical theory, a new technique using computer to analysze laser spectral images of finite deformation automatically was put forward. 在S- R和分解定理和 Fourier光学理论的基础上 ,提出了一种使用计算机对有限变形激光频谱图像进行自动分析的新方法 。 更多...