Metadata-Version: 2.1
Name: paninipy
Version: 0.2
Summary: Packageof Algorithms for Nonparametric Inference on Networks in Python
Home-page: https://paninipy.readthedocs.io/en/latest/index.html
Author: Baiyue He
Author-email: baiyueh@hku.hk
License: The Unlicense
Requires-Python: >=3.9, <3.12
Description-Content-Type: text/markdown
License-File: LICENSE.txt

# ScholarCodeCollective

ScholarCodeCollective is a Python package designed for nonparametric inference with complex network data, with methods for identifying hubs in networks, regionalizing mobility or distributional data over spatial networks, clustering network populations, and constructing hypergraphs from temporal data among other features. 

## Table of Contents

- [Installation](#installation)
- [Modules](#modules)
  - [Binning Temporal Hypergraphs](#binning-temporal-hypergraphs)
  - [Clustering Network Populations](#clustering-network-populations)
  - [Regionalization with Distributional Data](#regionalization-with-distributional-data)
  - [Identifying Network Hubs](#identifying-network-hubs)
  - [Regionalization with Community Detection](#regionalization-with-community-detection)
- [Documentation](#documentation)
- [License](#license)

## Installation

pip install ScholarCodeCollective
### [PyPI] (https://pypi.org/project/ScholarCodeCollective/)

## Modules
### [Binning Temporal Hypergraphs](https://scholarcodecollective.readthedocs.io/en/latest/Papers/hypergraph_binning.html)

Identify MDL-optimal temporally contiguous partitions of event data between distinct node sets (e.g. users and products).\
Utilizes method derived in “Inference of dynamic hypergraph representations in temporal interaction data” (Kirkley, 2024, https://arxiv.org/abs/2308.16546).


### [Clustering Network Populations](https://scholarcodecollective.readthedocs.io/en/latest/Papers/population_clustering.html)

Generate synthetic network population datasets and perform clustering of observed network populations, multilayer network layers, or temporal networks.\
Utilizes method derived in “Compressing network populations with modal networks reveals structural diversity” (Kirkley et al., 2023, https://arxiv.org/pdf/2209.13827).

### [Regionalization with Distributional Data](https://scholarcodecollective.readthedocs.io/en/latest/Papers/distributional_regionalization.html)

Perform MDL-based regionalization on distributional (e.g. census) data over space.\
Utilizes method derived in “Spatial regionalization as optimal data compression” (Kirkley, 2022, https://arxiv.org/pdf/2111.01813).

### [Identifying Network Hubs](https://scholarcodecollective.readthedocs.io/en/latest/Papers/hub_identification.html)

Identify hub nodes in a network using different information theoretic criteria.\
Utilizes methods derived in “Identifying hubs in directed networks” (Kirkley, 2024, https://arxiv.org/pdf/2312.03347).


### [Regionalization with Community Detection](https://scholarcodecollective.readthedocs.io/en/latest/Papers/community_regionalization.html)

Perform community detection-based regionalization on network data.\
Utilizes method derived in “Urban Boundary Delineation from Commuting Data with Bayesian Stochastic Blockmodeling: Scale, Contiguity, and Hierarchy” (Morel-Balbi and Kirkley, 2024, https://arxiv.org/pdf/2405.04911).

## Documentation 

Detailed documentation for each module and function is available at the link below:

### [ScholarCodeCollective Documentation](https://scholarcodecollective.readthedocs.io/en/latest/)

## License 
Distributed under the MIT License. See LICENSE for more information.
