相关论文: Drazin Inverses and Walk Structure of Oriented Dut…
The Drazin index is a fundamental invariant in the analysis of singular matrices and their generalized inverses. While sharp results are available for block triangular matrices, the corresponding theory for anti-triangular block matrices is…
We investigate generalized inverses of matrices associated with two classes of digraphs: double star digraphs and D-linked stars digraphs. For double star digraphs, we determine the Drazin index and derive explicit formulas for the Drazin…
Recently, the weak Drazin inverse and its characterization have been crucial studies for matrices of index k. In this article, we have revisited W-weighted DMP and MPD inverses and constructed a general class of unique solutions to certain…
The motivation of this paper is to investigate the dual Drazin inverse of adjacency matrices arising from several classes of connected dual-number-weighted digraphs over the dual complex algebra. Explicit formulas for the dual Drazin…
The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\cdots…
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding…
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
We present the first rigorous quantitative analysis of once-reinforced random walks (ORRW) on general graphs, based on a novel change of measure formula.~This enables us to prove large deviations estimates for the range of the walk to have…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
Drazin inverses are a special kind of generalized inverses that can be defined for endomorphisms in any category. A natural question to ask is whether one can somehow extend the notion of Drazin inverse to arbitrary maps - not simply…
Drazin inverses are a fundamental algebraic structure which have been extensively deployed in semigroup theory, ring theory, and matrix theory. Drazin inverses can also be defined for endomorphisms in any category. However, beyond a paper…
Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green's function of a graph also known as the communicability. The walk…
Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the…
Let $n \geq 4$ be an even integer and $W_n$ be the wheel graph with $n$ vertices. The distance $d_{ij}$ between any two distinct vertices $i$ and $j$ of $W_n$ is the length of the shortest path connecting $i$ and $j$. Let $D$ be the $n…
We introduce a novel harmonic analysis for functions defined on the vertices of a strongly connected directed graph of which the random walk operator is the cornerstone. As a first step, we consider the set of eigenvectors of the random…
The dual Drazin inverse is an important dual generalized inverse. In this paper, to extend it we introduce the weak dual Drazin inverse which is unique and exists for any square dual matrix. When the dual Drazin inverse exists, it coincides…
The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
There has recently been renewed recognition of the need to understand the consistency properties that must be preserved when a generalized matrix inverse is required. The most widely known generalized inverse, the Moore-Penrose…