-
+
Welcome
Recent Blog posts
-
+
+
+
https://www.nascol.net/about.html
- 2024-06-22T17:22:03.615Z
+ 2024-06-22T17:43:46.481Z
https://www.nascol.net/packages/index.html
- 2024-06-22T17:22:03.619Z
+ 2024-06-22T17:43:46.485Z
https://www.nascol.net/posts/welcome/index.html
- 2024-06-22T17:22:03.643Z
+ 2024-06-22T17:43:46.513Z
https://www.nascol.net/index.html
- 2024-06-22T17:22:03.619Z
+ 2024-06-22T17:43:46.485Z
https://www.nascol.net/blog.html
- 2024-06-22T17:22:03.619Z
+ 2024-06-22T17:43:46.485Z
+
+
+
+
+ 
+
+
+ backbone +
++ An implementation of methods for extracting an unweighted unipartite +graph (i.e. a backbone) from an unweighted unipartite graph, a weighted +unipartite graph, the projection of an unweighted bipartite graph, +or the projection of a weighted bipartite graph + +
+
+
+
+
+
+ 
+
+
+ incidentally +
++ Functions to generate incidence matrices and bipartite graphs that have +(1) a fixed fill rate, (2) given marginal sums, (3) marginal sums that +follow given distributions, or (4) represent bill sponsorships in the US +Congress. It can also generate an incidence +matrix from an adjacency matrix, or bipartite graph from a unipartite +graph, via a social process mirroring team, group, or organization +formation + +
+
+
diff --git a/packages/logos/backbone.png b/packages/logos/backbone.png
new file mode 100644
index 0000000..1f6a370
Binary files /dev/null and b/packages/logos/backbone.png differ
diff --git a/packages/logos/grand.png b/packages/logos/grand.png
new file mode 100644
index 0000000..d0009b6
Binary files /dev/null and b/packages/logos/grand.png differ
diff --git a/packages/logos/incidentally.png b/packages/logos/incidentally.png
new file mode 100644
index 0000000..1a58812
Binary files /dev/null and b/packages/logos/incidentally.png differ
diff --git a/search.json b/search.json
index 3352f01..8ae4488 100644
--- a/search.json
+++ b/search.json
@@ -11,7 +11,7 @@
"href": "packages/index.html",
"title": "NASCol - Network Analysis Software Collective",
"section": "",
- "text": "Python\n \n \n \n \n \n \n \n \n \n graph-tool\n \n \n Graph-tool is an efficient Python module for manipulation and statistical\nanalysis of graphs. Contrary to most other Python modules with similar\nfunctionality, the core data structures and algorithms are implemented in\nC++, making extensive use of template metaprogramming, based heavily on\nthe Boost Graph Library. This confers it a level of performance that is\ncomparable (both in memory usage and computation time) to that of a pure C/C++ library. \n\n \n \n \n \n \n \n \n \n \n \n NetworKit\n \n \n NetworKit is a growing open-source toolkit for large-scale network\nanalysis. \nIts aim is to provide tools for the analysis of large networks in the\nsize range \nfrom thousands to billions of edges. For this purpose, it implements\nefficient graph algorithms, \nmany of them parallel to utilize multicore architectures.\n\n \n \n \n \n \n \n \n \n \n \n NetworkX\n \n \n NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.\n\n \n \n \n \n \n \n \n \n \n \n textnets\n \n \n textnets represents collections of texts as networks of documents and words. This provides novel possibilities for the visualization and analysis of texts.\n\n \n \n \n \n \n \n \n \n \n \n Raphtory\n \n \n Raphtory is a Python package for the storage, modelling and analysis of temporal graphs/networks. It supports a very wide notion of temporal network \nincluding link-streams, edges with duration and sequences of network snapshots, complemented with an expressive API for analysing the graph over different\ntimes and timescales. Written with scalability to large networks in mind, its core engine is written in Rust to enable memory-efficient and fast \ncomputation but is wrapped in a Python module so that no Rust knowledge is required.\n\n \n \n \n \n \n \n \n \n \n \n netin\n \n \n NetIn is a python package for network inference.\nIt is based on the NetworkX package and provides a set of methods to study network inequalities.\nThe package is growing andwill be updated regularly.\n\n \n \n \n \n \n \n \n \n \n \n XGI\n \n \n The CompleX Group Interactions (XGI) library provides\ndata structures and algorithms for modeling and analyzing\ncomplex systems with group (higher-order) interactions.\n\n \n \n \n \n\n R\n \n \n \n \n \n \n \n \n \n statnet\n \n \n The statnet project publishes a suite of open source R-based software\npackages for network analysis\n\n \n \n \n \n \n \n \n \n \n \n graphlayouts\n \n \n This package implements some graph layout algorithms\n\n \n \n \n \n \n \n \n \n \n \n netrankr\n \n \n Implements methods for centrality related analyses of networks. \nWhile the package includes the possibility to build more than 20 indices, \nits main focus lies on index-free assessment of centrality via partial \nrankings obtained by neighborhood-inclusion or positional dominance\n\n \n \n \n \n \n \n \n \n \n \n signnet\n \n \n The package provides methods to analyse signed networks (i.e. networks with both positive and negative ties)\n\n \n \n \n \n \n \n \n \n \n \n snahelper\n \n \n snahelper provides a set RStudio Addin for social network analysis\n\n \n \n \n \n \n \n \n \n \n \n networkdata\n \n \n The package contains a large variety of different network datasets\n\n \n \n \n \n \n \n \n \n \n \n edgebundle\n \n \n An R package that implements several edge bundling/flow and metro map algorithms\n\n \n \n \n \n \n \n \n \n \n \n netUtils\n \n \n netUtils is a collection of tools for network analysis that may not deserve a package on their own and/or are missing from other network packages.\n\n \n \n \n \n \n \n \n \n \n \n rgraph6\n \n \n Functions in this package allow for encoding network data as strings of printable ASCII characters and back using graph6, sparse6, and digraph6 formats\n\n \n \n \n \n\n Multiplatform or standalone\n \n \n \n \n \n \n \n \n \n igraph\n \n \n igraph is a collection of network analysis tools with the emphasis on\nefficiency,\nportability and ease of use. igraph is open source and free. igraph can\nbe programmed in R, Python, Mathematica and C/C++.\n\n \n \n \n \n \n \n \n \n \n \n Gephi\n \n \n Gephi is the leading visualization and exploration software for all kinds of graphs and networks. \n\n \n \n \n \n \n \n \n \n \n \n Pajek\n \n \n Analysis and visualization of very large networks\n\n \n \n \n \n \n \n \n \n \n \n NodeXL\n \n \n NodeXL makes it easy to explore, analyze and visualize network graphs in Microsoft Office Excel\n\n \n \n \n \n \n \n \n \n \n \n SocNetV\n \n \n Social Network Analysis and Visualization Software\n\n \n \n \n \n \n \n \n \n \n \n Cytoscape\n \n \n Cytoscape is a free, open source software platform for visualizing complex networks and integrating diverse types of data. Over 350 apps are available for various kinds of problem domains, including biomedical research and social network analysis.\n\n \n \n \n \n\n\nNo matching items"
+ "text": "Python\n \n \n \n \n \n \n \n \n \n graph-tool\n \n \n Graph-tool is an efficient Python module for manipulation and statistical\nanalysis of graphs. Contrary to most other Python modules with similar\nfunctionality, the core data structures and algorithms are implemented in\nC++, making extensive use of template metaprogramming, based heavily on\nthe Boost Graph Library. This confers it a level of performance that is\ncomparable (both in memory usage and computation time) to that of a pure C/C++ library. \n\n \n \n \n \n \n \n \n \n \n \n NetworKit\n \n \n NetworKit is a growing open-source toolkit for large-scale network\nanalysis. \nIts aim is to provide tools for the analysis of large networks in the\nsize range \nfrom thousands to billions of edges. For this purpose, it implements\nefficient graph algorithms, \nmany of them parallel to utilize multicore architectures.\n\n \n \n \n \n \n \n \n \n \n \n NetworkX\n \n \n NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.\n\n \n \n \n \n \n \n \n \n \n \n textnets\n \n \n textnets represents collections of texts as networks of documents and words. This provides novel possibilities for the visualization and analysis of texts.\n\n \n \n \n \n \n \n \n \n \n \n Raphtory\n \n \n Raphtory is a Python package for the storage, modelling and analysis of temporal graphs/networks. It supports a very wide notion of temporal network \nincluding link-streams, edges with duration and sequences of network snapshots, complemented with an expressive API for analysing the graph over different\ntimes and timescales. Written with scalability to large networks in mind, its core engine is written in Rust to enable memory-efficient and fast \ncomputation but is wrapped in a Python module so that no Rust knowledge is required.\n\n \n \n \n \n \n \n \n \n \n \n netin\n \n \n NetIn is a python package for network inference.\nIt is based on the NetworkX package and provides a set of methods to study network inequalities.\nThe package is growing andwill be updated regularly.\n\n \n \n \n \n \n \n \n \n \n \n XGI\n \n \n The CompleX Group Interactions (XGI) library provides\ndata structures and algorithms for modeling and analyzing\ncomplex systems with group (higher-order) interactions.\n\n \n \n \n \n\n R\n \n \n \n \n \n \n \n \n \n statnet\n \n \n The statnet project publishes a suite of open source R-based software\npackages for network analysis\n\n \n \n \n \n \n \n \n \n \n \n graphlayouts\n \n \n This package implements some graph layout algorithms\n\n \n \n \n \n \n \n \n \n \n \n netrankr\n \n \n Implements methods for centrality related analyses of networks. \nWhile the package includes the possibility to build more than 20 indices, \nits main focus lies on index-free assessment of centrality via partial \nrankings obtained by neighborhood-inclusion or positional dominance\n\n \n \n \n \n \n \n \n \n \n \n signnet\n \n \n The package provides methods to analyse signed networks (i.e. networks with both positive and negative ties)\n\n \n \n \n \n \n \n \n \n \n \n snahelper\n \n \n snahelper provides a set RStudio Addin for social network analysis\n\n \n \n \n \n \n \n \n \n \n \n networkdata\n \n \n The package contains a large variety of different network datasets\n\n \n \n \n \n \n \n \n \n \n \n edgebundle\n \n \n An R package that implements several edge bundling/flow and metro map algorithms\n\n \n \n \n \n \n \n \n \n \n \n netUtils\n \n \n netUtils is a collection of tools for network analysis that may not deserve a package on their own and/or are missing from other network packages.\n\n \n \n \n \n \n \n \n \n \n \n rgraph6\n \n \n Functions in this package allow for encoding network data as strings of\nprintable ASCII characters and back using graph6, sparse6, and digraph6\nformats\n\n \n \n \n \n \n \n \n \n \n \n backbone\n \n \n An implementation of methods for extracting an unweighted unipartite\ngraph (i.e. a backbone) from an unweighted unipartite graph, a weighted\nunipartite graph, the projection of an unweighted bipartite graph,\nor the projection of a weighted bipartite graph \n\n \n \n \n \n \n \n \n \n \n \n incidentally\n \n \n Functions to generate incidence matrices and bipartite graphs that have\n(1) a fixed fill rate, (2) given marginal sums, (3) marginal sums that\nfollow given distributions, or (4) represent bill sponsorships in the US\nCongress. It can also generate an incidence\nmatrix from an adjacency matrix, or bipartite graph from a unipartite\ngraph, via a social process mirroring team, group, or organization\nformation\n\n \n \n \n \n \n \n \n \n \n \n grand\n \n \n Interactively applies the Guidelines for Reporting About Network Data\n(GRAND) to an igraph object, and generates a uniform narrative or\ntabular description of the object.\n\n \n \n \n \n\n Multiplatform or standalone\n \n \n \n \n \n \n \n \n \n igraph\n \n \n igraph is a collection of network analysis tools with the emphasis on\nefficiency,\nportability and ease of use. igraph is open source and free. igraph can\nbe programmed in R, Python, Mathematica and C/C++.\n\n \n \n \n \n \n \n \n \n \n \n Gephi\n \n \n Gephi is the leading visualization and exploration software for all kinds of graphs and networks. \n\n \n \n \n \n \n \n \n \n \n \n Pajek\n \n \n Analysis and visualization of very large networks\n\n \n \n \n \n \n \n \n \n \n \n NodeXL\n \n \n NodeXL makes it easy to explore, analyze and visualize network graphs in Microsoft Office Excel\n\n \n \n \n \n \n \n \n \n \n \n SocNetV\n \n \n Social Network Analysis and Visualization Software\n\n \n \n \n \n \n \n \n \n \n \n Cytoscape\n \n \n Cytoscape is a free, open source software platform for visualizing complex networks and integrating diverse types of data. Over 350 apps are available for various kinds of problem domains, including biomedical research and social network analysis.\n\n \n \n \n \n\n\nNo matching items"
},
{
"objectID": "posts/welcome/index.html",
diff --git a/sitemap.xml b/sitemap.xml
index 79fb444..3fdeead 100644
--- a/sitemap.xml
+++ b/sitemap.xml
@@ -2,22 +2,22 @@
+
+ 
+
+
+ grand +
++ Interactively applies the Guidelines for Reporting About Network Data +(GRAND) to an igraph object, and generates a uniform narrative or +tabular description of the object.