## Abstract

World Wide Web, the Internet, coupled biological and chemical systems, neural networks, and social interacting species, are only a few examples of systems composed by a large number of highly interconnected dynamical units. These networks contain characteristic patterns, termed network motifs, which occur far more often than in randomized networks with the same degree sequence. Several algorithms have been suggested for counting or detecting the number of induced or non-induced occurrences of network motifs in the form of trees and bounded treewidth subgraphs of size O(log n), and of size at most 7 for some motifs. In addition, counting the number of motifs a node is part of was recently suggested as a method to classify nodes in the network. The promise is that the distribution of motifs a node participate in is an indication of its function in the network. Therefore, counting the number of network motifs a node is part of provides a major challenge. However, no such practical algorithm exists. We present several algorithms with time complexity O(e^{2k} k·n·|E|· log1/δ/ε^{2}) that, for the first time, approximate for every vertex the number of non-induced occurrences of the motif the vertex is part of, for k-length cycles, k-length cycles with a chord, and (k - 1)-length paths, where k = O(log n), and for all motifs of size of at most four. In addition, we show algorithms that approximate the total number of non-induced occurrences of these network motifs, when no efficient algorithm exists. Some of our algorithms use the color coding technique.

Original language | English |
---|---|

Pages (from-to) | 13-24 |

Number of pages | 12 |

Journal | Lecture Notes in Computer Science |

Volume | 5427 LNCS |

DOIs | |

State | Published - 2009 |

Externally published | Yes |

Event | 6th International Workshop on Algorithms and Models for the Web-Graph, WAW 2009 - Barcelona, Spain Duration: 12 Feb 2009 → 13 Feb 2009 |