Name
Abstract | ||
|---|---|---|
Identifying the nodes of small sub-graphs with no a priori information is a hard problem. In this work, we want to find each node of a sparse sub-graph embedded in both dynamic and static background graphs, of larger average degree. We show that by exploiting the summability over several background realizations of the Estrada-Benzi communicability and the Krylov approximation of the matrix exponential, it is possible to recover the sub-graph with a fast algorithm with computational complexity O(Nn + Nn log(n)) in the worst case, where n is the number of nodes and N is the number of backgrounds. Relaxing the problem to complete sub-graphs, the same performance is obtained with a single background, with a best case complexity O(n). Copyright (C) EPLA, 2014 |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1209/0295-5075/108/50006 | EPL |
Field | DocType | Volume |
Graph,A priori and a posteriori,Algorithm,Matrix exponential,Physics,Computational complexity theory | Journal | 108 |
Issue | ISSN | Citations |
5 | 0295-5075 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincenzo Fioriti | 1 | 41 | 7.09 |
| Marta Chinnici | 2 | 20 | 3.48 |