Analyse temporal network and hypergraphs efficiently.
Project description
Python bindings for Reticula
Installation
The library offers pre-compiled Wheels for manylinux2014
compatible systems.
That is, Linux systems with GNU C Library (glibc) version 2.17 and newer. The
library currently supports Python version 3.8, 3.9 and 3.10.
$ pip install reticula
Installing from source
Alternatively you can install the library from source:
Clone the library:
$ git clone https://github.com/arashbm/reticula-python.git
Build the Wheel:
$ cd reticula-python
$ pip install .
Note that compiling source requires an unbelievable amount (> 40GB) of RAM.
Basic examples
Generate a random static network and investigate:
import reticula as ret
state = ret.mersenne_twister(42) # create a pseudorandom number generator
g = ret.random_gnp_graph[ret.int64](n=100, p=0.02, random_state=state)
print(g) # => <undirected_network[int64] with 100 verts and 110 edges>
print(g.vertices()) # => [0, 1, 2, 3, .... 99]
print(g.edges())
# => [undirected_edge[int64](0, 16), undirected_edge[int64](0, 20),
# undirected_edge[int64](0, 31), undirected_edge[int64](0, 51),
# ...]
print(ret.connected_components(g))
# => [<component[int64] of 1 nodes: {9}>,
# <component[int64] of 1 node {33}>,
# ...]
lcc = max(ret.connected_components(g), key=len)
print(lcc) # => <component[int64] of 93 nodes: {99, 96, 95, 94, ...}>
g2 = ret.vertex_induced_subgraph(g, lcc)
print(g2) # => <undirected_network[int64] with 93 verts and 109 edges>
A more complete example of static network percolation analysis, running on
multiple threads, can be found in
examples/static_network_percolation/
Create a random fully-mixed temporal network and calculate simple (unconstrained) reachability from node 0 at time 0 to all nodes and times.
import reticula as ret
state = ret.mersenne_twister(42)
g = ret.random_fully_mixed_temporal_network[ret.int64](
size=100, rate=0.01, max_t=1024, random_state=state)
adj = ret.temporal_adjacency.simple[
ret.undirected_temporal_edge[ret.int64, ret.double]]()
cluster = ret.out_cluster(
temporal_network=g, temporal_adjacency=adj, vertex=0, time=0.0)
print(cluster)
# => <temporal_cluster[undirected_temporal_edge[int64, double],
# simple[undirected_temporal_edge[int64, double]]] with volume 100
# and lifetime (0 1.7976931348623157e+308]>
print(cluster.covers(vertex=12, time=100.0)) # => True
# Let's see all intervals where vert 15 is reachable from vert 0 at t=0.0:
print(list(cluster.interval_sets()[15]))
# => [(3.099055278145548, 1.7976931348623157e+308)]
Let's now try limited waiting-time (with dt = 5.0) reachability:
import reticula as ret
state = ret.mersenne_twister(42)
g = ret.random_fully_mixed_temporal_network[int64](
size=100, rate=0.01, max_t=1024, random_state=state)
adj = ret.temporal_adjacency.limited_waiting_time[
ret.undirected_temporal_edge[ret.int64, ret.double]](dt=5.0)
cluster = ret.out_cluster(
temporal_network=g, temporal_adjacency=adj, vertex=0, time=0.0)
print(cluster)
# => <temporal_cluster[undirected_temporal_edge[int64, double],
# limited_waiting_time[undirected_temporal_edge[int64, double]]] with
# volume 100 and lifetime (0 1028.9972186553928]>
print(cluster.covers(vertex=15, time=16.0)) # => True
print(list(cluster.interval_sets()[15]))
# => [(3.099055278145548, 200.17866501023616),
# (200.39858803326402, 337.96139372380003),
# ...
# (1017.5258263596586, 1028.9149586273347)]
# Total "human-hours" of reachability cluster
print(cluster.mass()) # => 101747.97444555275
# Survival time of the reachability cluster
print(cluster.lifetime()) # => (0.0, 1028.9972186553928)
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
Built Distributions
Hashes for reticula-0.2.0-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 54e31cb246050862eb09618079d30031327fd68a78e34700243aba58fb73fa46 |
|
MD5 | f508b563412b63ced9eec2383506d58d |
|
BLAKE2b-256 | 6712c56e38db9bb164c0dfd6b3c69b91aad81d51f02e3060dc00898016df0a09 |
Hashes for reticula-0.2.0-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 17ff75d5044596580fd9438066de8c3f073a9dd71c5e4b656ac705d4e8d79b7a |
|
MD5 | e5390cd3df487aeaa70834c4dbc9c7cd |
|
BLAKE2b-256 | 484b85865726dc7513c26570d45085c5b8ee429b89f319538f46964c9daab833 |
Hashes for reticula-0.2.0-cp38-cp38-manylinux_2_17_x86_64.manylinux2014_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | ecd068716bb72be60b827dbe96042c442ed14a32a1c14c84d247afa65008a7b9 |
|
MD5 | b3c2eb6bd2b7cf5afed983095d41b043 |
|
BLAKE2b-256 | efea8274e4b0aa875792279858dba24359ebf023de4f662964a52b1c5ea16179 |