Category Archives: Research

Community Discovery for Complex Networks

Given: a network, especially a large one, directed or not, weighted or not.

Desired: a sensible decomposition of the graph into sub-graphs, wherein the nodes in each sub-graph have more to do with each other than with outsiders, i.e., form communities.

This is also called “module detection“.

Ref from here

Continue reading

Advertisements

Papers on TDA

Unread (new)

Read & Categorized

Conventional

  • H. Edelsbrunner and J. Harer, Computational Topology. An Introduction. (Amer. Math. Soc., 2010).
  • H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological persistence and simplificationDiscrete Comput. Geom. 28, 511 (2002)

Material science

Kernel method

Time-series + Dynamic system

Clustering

Benchmark

Other