Automorphism Group of the Rank-decreasing Graph Over the Semigroup of Upper Triangular Matrices

Let F_q be a finite field with q elements, n ≥ 2 a positive integer, and T(n, q) the semigroup of all n × n upper triangular matrices over F_q. The rank-decreasing graph 𝕋 of T(n, q) is a directed graph which has T(n, q) as vertex set, and there is a directed edge from A ∈ T(n, q) to B ∈ T(n, q) if and only if r(AB) < r(B). The zero-divisor graph 𝒯 of T(n, q), with vertex set of all nonzero zero-divisors of T(n, q) and there is a directed edge from a vertex A to a vertex B if and only if AB = 0, can be viewed as a subgraph of 𝕋. In [16 Wang, L. (2015). A note on automorphisms of the zero-divisor graph of upper triangular matrices. Lin. Alg. Appl. 465:214–220.[Crossref], [Web of Science ®] , [Google Scholar]], L. Wang has determined the automorphisms of the zero-divisor graph 𝒯 of T(n, q). In this article, by applying the main result of [17 Wong, D., Ma, X., Zhou, J. (2014). The group of automorphisms of a zero-divisor graph based on rank one upper triangular matrices. Lin. Alg. Appl. 460:242–258.[Crossref], [Web of Science ®] , [Google Scholar]] we determine the automorphisms of the rank-decreasing graph 𝕋 of T(n, q).     

基于图切割的相位展开

剪切散斑干涉术中,普遍采取相移法提取相位,只可得到被包裹的相位信息,进一步量化计算之前,必须展开相位,但是大量的散斑噪音使相位展开变得非常困难.本文提出基于图切割理论的相位展开算法,将相位展开等价于整数的最优估计问题,通过最小化能量函数展开相位,无需对散斑包裹相位图进行滤波,就可以从包含大量散斑噪音的包裹相位图中准确地提取出真实相位,极大程度地保留了相位包裹图中的细节信息.对于同一幅模拟的散斑包裹相位图,传统的质量导向枝切法和最小二乘法的均方根误差分别为11.7076和4.9775,新算法的均方根误差则为0.9459,数值模拟与实验结果均验证了新算法优良的抗噪性能.     

Four Constructions of Highly Symmetric Tetravalent Graphs

Given a connected, dart‐transitive, cubic graph, constructions of its Hexagonal Capping and its Dart Graph are considered. In each case, the result is a tetravalent graph which inherits symmetry from the original graph and is a covering of the line graph.Similar constructions are then applied to a map (a cellular embedding of a graph in a surface) giving tetravalent coverings of the medial graph. For each construction, conditions on the graph or the map to make the constructed graph dart‐transitive, semisymmetric or ‐transitive are considered.     

A method for detection of abrupt changes in the financial market combining wavelet decomposition and correlation graphs

The objective of this work is to propose a new methodology to detect the imminence of abrupt changes in the stock market by combining a numerical indicator based on the wavelet decomposition technique with a measure of the interdependency of the markets using graph theory. While the indicator based on wavelet decomposition is based on a single time series, an approach based on network representation can provide information on the interdependency of the various markets. More specifically, the stock market indices are associated with nodes of a network and the correlation between pairs of nodes with links. Results from the theory of graphs can then be used to indicate numerically the connectivity of this network. Experimentations with a variety of financial time series shows that the connectivity varies as trends of the financial time series varies. Combining the indicator based on the wavelet decomposition with the proposed measure of the connectivity of the network, it was possible to refine the authors previous results in terms of detecting abrupt changes in the stock market. In order to illustrate the methodology a case study involving twelve stock market indices was presented.     

The disjunctive domination number of a graph

Abstract

For a positive integer b, we define a set S of vertices in a graph G as a b-disjunctive dominating set if every vertex not in S is adjacent to a vertex of S or has at least b vertices in S at distance 2 from it. The b-disjunctive domination number is the minimum cardinality of such a set. This concept is motivated by the concepts of distance domination and exponential domination. In this paper, we start with some simple results, then establish bounds on the parameter especially for regular graphs and claw-free graphs. We also show that determining the parameter is NP-complete, and provide a linear-time algorithm for trees.     

Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.

Consider the random graph on n vertices 1,…,n. Each vertex i is assigned a type x_i with x₁,…,x_n being independent identically distributed as a nonnegative random variable X. We assume that EX³< ∞. Given types of all vertices, an edge exists between vertices i and j independent of anything else and with probability \begin{align*}\min \{1, \frac{x_ix_j}{n}\left(1+\frac{a}{n^{1/3}} \right) \}\end{align*}. We study the critical phase, which is known to take place when EX² = 1. We prove that normalized by n^‐2/3the asymptotic joint distributions of component sizes of the graph equals the joint distribution of the excursions of a reflecting Brownian motion with diffusion coefficient \begin{align*}\sqrt{{\textbf{ E}}X{\textbf{ E}}X^3}\end{align*}and drift \begin{align*}a-\frac{{\textbf{ E}}X^3}{{\textbf{ E}}X}s\end{align*}. In particular, we conclude that the size of the largest connected component is of order n^2/3. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 43, 486–539, 2013