Networks with Complex Weights: Green Function and Power Series

Mathematics

卷:10

Anna Muranova¹  Wolfgang Woess² 

[1] Faculty of Mathematics and Computer Science, Uniwersytet Warmińsko-Mazurski, 10-710 Olsztyn, Poland;

[2] Institute of Discrete Mathematics, Graz University of Technology, 8010 Graz, Austria;

关键词: weighted graph;    network;    Green kernel;    recurrence;    transience;   

DOI  :  10.3390/math10050820

来源: DOAJ

【 摘 要 】

We introduce a Green function and analogues of other related kernels for finite and infinite networks whose edge weights are complex-valued admittances with positive real part. We provide comparison results with the same kernels associated with corresponding reversible Markov chains, i.e., where the edge weights are positive. Under suitable conditions, these lead to comparison of series of matrix powers which express those kernels. We show that the notions of transience and recurrence extend by analytic continuation to the complex-weighted case even when the network is infinite. Thus, a variety of methods known for Markov chains extend to that setting.

【 授权许可】

Unknown