Abstract. We present exact results for the spectrum of the fractional Laplacian in a bounded domain and apply them to First Passage Time (FPT) Statistics of Lévy flights. We specifically show that the average is insufficient to describe the distribution of FPT, although it is the only quantity available in the existing literature. In particular, we show that the FPT distribution is not peaked a...

The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎.

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

This paper studies the problem of fault detection and isolation (FDI) for multi-agent systems (MAS) via complex Laplacian subject to actuator faults. A planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacian is achieved. The communication network is a directed, and yet connected graph with a fixed topology. The loss of symmetry in the...

the k-th semi total point graph of a graph g, , ‎is a graph‎ obtained from g by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎in this paper‎, a formula for laplacian polynomial of in terms of‎ characteristic and laplacian polynomials of g is computed‎, ‎where is a connected regular graph‎.the kirchhoff index of is also computed‎.

The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread, several upper bounds of the Nordhaus-Gaddum type of Laplacian eigenvalues are improved. Some operations on Laplacian spread are presented. Connected c...

A 3.5 GHz OAM antenna with ±1 mode was designed and fabricated, the channel measurement in frequency domain used to measure full angle under indoor multipath scenarios. Then, modified probability density function of Gaussian distribution, Laplacian Von Mises distribution are establish full-angle statistical model. The fitting curve results well represent characteristics scenario.

State of the art methods for image matching, content-based retrieval and recognition use local features. Most of these still exploit only the luminance information for detection. The color saliency boosting algorithm has provided an efficient method to exploit the saliency of color edges based on information theory. However, during the design of this algorithm, some issues were not addressed in...

State of the art methods for image matching, content-based retrieval and recognition use local features. Most of these still exploit only the luminance information for detection. The color saliency boosting algorithm has provided an efficient method to exploit the saliency of color edges based on information theory. However, during the design of this algorithm, some issues were not addressed in...

Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with interlayer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these interlayer...