Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality. Learn more →
Top 6 Python graph-analysis Projects
-
Built from this data... https://github.com/networkx/networkx/blob/main/examples/grap...
-
pykale
Knowledge-Aware machine LEarning (KALE): accessible machine learning from multiple sources for interdisciplinary research, part of the 🔥PyTorch ecosystem. ⭐ Star to support our work!
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
This is interesting to me because it's advancing the work on the notion of quantum graph problem solving.
I'm sure we've all heard how quantum computers can be used in the future to decrypt information from today. There's a lot of research out there on how QC may be able to efficiently factor large semiprimes and bust our existing cryptographic algorithms, but to me this is the more mundane side of QC.
The exciting side to me is that many graph problems, particularly whole graph problems like connectivity and shortest paths have a potential quantum advantage. This is particularly advantageous for sparse and hypersparse graphs that have billions of nodes but relatively low node degree. Language Models, chemical assay databases, proteomics, causal inference, and fraud detection are just a few problems that involve huge sparse graphs that could get a huge boost from quantum.
And to show my own bias here [1], I think the future of graph algorithms, including quantum, is expressing them in Linear Algebraic form with the GraphBLAS API. Using the GraphBLAS, you can write your algorithm in a mathematical form using the multiplication of adjacency matrices that is then synthesized to some optimal form for a given architecture.
The same code you write can then be run on a variety of backends, currently CPUs and CUDA using SuiteSparse's new JIT, but soon FPGAs and yes, quantum computers. Parallelism will become so broad and conceptually divergent that you won't even be able to conceive of an efficient hand written single function for all possible platforms.
-
-
-
social-balance
A library-agnostic project for calculating exactly and efficiently social balance, based on the Aref, Mason and Wilson paper (https://arxiv.org/abs/1611.09030)
Python graph-analysis related posts
- NetworkX 3.0
- PyKale Preprint: Knowledge-Aware Machine Learning from Multiple Sources in Python [P][R]
- [S] A library agnostic Python project for computing exactly and efficiently social balance in graphs. Can be easily used with NetworkX, graph_tool and igraph
- [S] A library agnostic Python project for computing exactly and efficiently social balance in graphs. Can be easily used with NetworkX, graph_tool and igraph
- [Topic][Open] Open Discussion Monday — Anybody can post a general visualization question or start a fresh discussion!
-
A note from our sponsor - InfluxDB
www.influxdata.com | 18 Apr 2024
Index
What are some of the best open-source graph-analysis projects in Python? This list will help you:
Project | Stars | |
---|---|---|
1 | NetworkX | 14,153 |
2 | pykale | 427 |
3 | pygraphblas | 338 |
4 | graphblas-algorithms | 60 |
5 | lightning-tools | 22 |
6 | social-balance | 3 |