Some new procedures in Pajek
In: Dagstuhl Seminar 05361, 04 Sep - 09 Sep 2005, Dagstuhl, Germany.
We present some newest additions to Pajek -
a program for analysis and visualization of large
1. network multiplication: in general the
multiplication of large sparse networks is a
'dangerous' operation since the result can
'explode' - it is not sparse. In some cases we can
show that it remains sparse and provides us with
useful information. One such application is the
computation of basic kinship relations from
2. bipartite cores: for analysis of 2-mode
(bipartite) networks the notion of core can be
extended to $(p,q)$-cores - all degrees in the
first set are at least $p$, and in the second set
at least $q$. The $(p,q)$-cores can be efficiently
determined, but how to select the right $p$ and $q$ ?
3. 4-rings: to identify dense parts in 2-mode
networks we can use as the weight of lines the
number (and type, in directed networks) of
4-(semi)cycles that contain the line.
The contribution is a joint work with Andrej Mrvar.
|EPrint Type:||Conference or Workshop Item (Talk)|
|Project Keyword:||Project Keyword UNSPECIFIED|
|Subjects:||Theory & Algorithms|
|Deposited By:||Vladimir Batagelj|
|Deposited On:||07 January 2006|