Pascal Maillard

Learn More
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but evolve over time, traditional static approaches can be inappropriate for specific tasks. In this work we pioneer the NP-hard problem of online dynamic modularity maximization. We(More)
Maximizing the quality index <i>modularity</i> has become one of the primary methods for identifying the clustering structure within a graph. Since many contemporary networks are not static but evolve over time, traditional static approaches can be inappropriate for specific tasks. In this work, we pioneer the NP-hard problem of online dynamic modularity(More)
Consider a d-ary rooted tree (d ≥ 3) where each edge e is assigned an i.i.d. (bounded) random variable X(e) of negative mean. Assign to each vertex v the sum S(v) of X(e) over all edges connecting v to the root, and assume that the maximum S * n of S(v) over all vertices v at distance n from the root tends to infinity (necessarily, linearly) as n tends to(More)
  • 1