Предложено формирование матриц инцидентности оргиперграфов с использованием корней из единицы подходящих степеней для ориентации гиперточек и гипердуг....

Research on complex networks is becoming a very hot topic in recent years, among which node matching problem is an important issue. The aim of node matching problem is to find out the corresponding relations between the individuals of associated networks. Traditional node matching problem of...

AMS classifications: 05C50; 05E99;

We consider correspondence analysis (CA) and taxicab correspondence analysis (TCA) of relational datasets that can mathematically be described as weighted loopless graphs. Such data appear in particular in network analysis. We present CA and TCA as relaxation methods for the graph partitioning...

Since the last decade, minimal spanning trees (MSTs) have become one of the main streams in econophysics to filter the important information contained, for example, in stock networks. The standard practice to find an MST is by using Kruskal’s algorithm. However, it becomes slower and slower...

In the context of spatial econometrics, we discuss the specification of one-directional effects, not mutual dependencies. Using an empirical study (a spatial autoregressive model of land price data in Fukui Prefecture, Japan) and Monte Carlo simulation results (contiguity matrices built based on...