Analysis and visualization of large networks with program package Pajek

A Mrvar, V Batagelj - Complex Adaptive Systems Modeling, 2016 - Springer
Pajek is a program package for analysis and visualization of large networks (networks
containing up to one billion of vertices, there is no limit—except the memory size—on the …

[Књига][B] Statistical analysis of network data with R

ED Kolaczyk, G Csárdi - 2014 - Springer
Networks and network analysis are arguably one of the largest growth areas of the early
twenty-first century in the quantitative sciences. Despite roots in social network analysis …

[Књига][B] The text mining handbook: advanced approaches in analyzing unstructured data

R Feldman, J Sanger - 2007 - books.google.com
Text mining is a new and exciting area of computer science research that tries to solve the
crisis of information overload by combining techniques from data mining, machine learning …

Pajek—analysis and visualization of large networks

V Batagelj, A Mrvar - International Symposium on Graph Drawing, 2001 - Springer
Pajek – Analysis and Visualization of Large Networks Page 1 Pajek – Analysis and
Visualization of Large Networks Vladimir Batagelj1 and Andrej Mrvar2 1 Department of …

An o (m) algorithm for cores decomposition of networks

V Batagelj, M Zaversnik - arxiv preprint cs/0310049, 2003 - arxiv.org
The structure of large networks can be revealed by partitioning them to smaller parts, which
are easier to handle. One of such decompositions is based on $ k $--cores, proposed in …

A model of Internet topology using k-shell decomposition

S Carmi, S Havlin, S Kirkpatrick, Y Shavitt… - Proceedings of the …, 2007 - pnas.org
We study a map of the Internet (at the autonomous systems level), by introducing and using
the method of k-shell decomposition and the methods of percolation theory and fractal …

The core decomposition of networks: Theory, algorithms and applications

FD Malliaros, C Giatsidis, AN Papadopoulos… - The VLDB Journal, 2020 - Springer
The core decomposition of networks has attracted significant attention due to its numerous
applications in real-life problems. Simply stated, the core decomposition of a network …

Large scale networks fingerprinting and visualization using the k-core decomposition

J Alvarez-Hamelin, L Dall'Asta… - Advances in neural …, 2005 - proceedings.neurips.cc
We use the k-core decomposition to develop algorithms for the analysis of large scale
complex networks. This decomposition, based on a recursive pruning of the least connected …

Fast algorithms for determining (generalized) core groups in social networks

V Batagelj, M Zaveršnik - Advances in Data Analysis and Classification, 2011 - Springer
The structure of a large network (graph) can often be revealed by partitioning it into smaller
and possibly more dense sub-networks that are easier to handle. One of such …

Identification and monitoring of possible disruptive technologies by patent-development paths and topic modeling

A Momeni, K Rost - Technological Forecasting and Social Change, 2016 - Elsevier
Understanding current technological changes is the basis for better forecasting of
technological changes. Because technology is path dependent, monitoring past and current …