Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 42 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 217 tok/s Pro
GPT OSS 120B 474 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Forman-Ricci curvature and Persistent homology of unweighted complex networks (1912.11337v1)

Published 24 Dec 2019 in cs.DM

Abstract: We present the application of topological data analysis (TDA) to study unweighted complex networks via their persistent homology. By endowing appropriate weights that capture the inherent topological characteristics of such a network, we convert an unweighted network into a weighted one. Standard TDA tools are then used to compute their persistent homology. To this end, we use two main quantifiers: a local measure based on Forman's discretized version of Ricci curvature, and a global measure based on edge betweenness centrality. We have employed these methods to study various model and real-world networks. Our results show that persistent homology can be used to distinguish between model and real networks with different topological properties.

Citations (8)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube