Spectral analysis for signed social networks

IF 0.6 4区工程技术 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-12-30 DOI:10.1007/s00200-023-00639-x

Anita Kumari Rao, Bableen Kaur, Sachin Somra, Deepa Sinha

引用次数: 0

Abstract

In complex real-world networks, the relation among vertices (people) changes over time. Even with millions of vertices, adding new vertices or deleting a few previous ones can drastically change the network’s dynamics. The Iterated Local Transitivity model is a deterministic model based on the principle of transitivity and local interaction among people. The same has been extended to signed social networks. Let \(\Sigma\) be a signed graph with underlying graph \(G = (V, E)\) and a function \(\sigma :E\rightarrow \{+,-\}\) assigning signs to the edges. We determine the relation between the characteristic polynomials of signed graph \(\Sigma\) and the signed graph obtained from \(\Sigma\) by adding (deleting) vertices or by adding (deleting) edges. Consequently, we present a recurrence relation for a characteristic polynomial of the Iterated Local Transitivity model for signed graphs.

Abstract Image

查看原文本刊更多论文

签名社交网络的频谱分析

在复杂的现实世界网络中，顶点（人）之间的关系会随着时间的推移而发生变化。即使有数百万个顶点，增加新的顶点或删除之前的几个顶点也会极大地改变网络的动态。迭代局部易变性模型是一个基于易变性原理和人与人之间局部互动的确定性模型。该模型已被扩展到签名社交网络。让 \(\Sigma\) 是一个有符号的图，其底层图是 \(G = (V, E)\) 和一个给边分配符号的函数 \(\sigma :E\rightarrow \{+,-\}\)。我们确定了有符号图 \(\sigma\)的特征多项式与通过添加（删除）顶点或添加（删除）边从 \(\sigma\)得到的有符号图之间的关系。因此，我们提出了有符号图的迭代局部传递性模型的特征多项式的递推关系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Applicable Algebra in Engineering Communication and Computing 工程技术-计算机：跨学科应用

CiteScore

2.90

自引率

14.30%

发文量

审稿时长

>12 weeks

期刊介绍： Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems. Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology. Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal. On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.