Abstract: Given a graph G G and a vertex q ∈ G q∈G, the community search (CS) problem aims to efficiently find a subgraph of G G whose vertices are closely related to q q. Communities are prevalent in ...

In this article, we consider a decentralized stochastic optimization problem over a network of agents, modeled as a directed graph: Agents aim to asynchronously minimize the average of their ...