Identifying communities plays a central role in understanding the structure of large networks. As practitioners analyze progressively larger networks, it becomes increasingly important to understand the computational complexity of candidate algorithms. We examine the complexity of the link clustering algorithm (Ahn et al., 2010) for overlapping community detection. We provide new, tight bounds ...

Overlapping domain decomposition methods are efficient and flexible. It is also important that such methods are inherently suitable for parallel computing. In this chapter, we will first explain the mathematical formulation and algorithmic composition of the overlapping domain decomposition methods. Afterwards, we will focus on a generic implementation framework and its applications within Diff...

The concept of quasiperiodicity is a generalization of the notion of periodicity where in contrast to periodicity the quasiperiods of a quasiperiodic string may overlap. A lot of research has been concentrated around algorithms for the computation of quasiperiodicities in strings while not much is known about bounds on their maximum number of occurrences in words. We study the overlapping facto...

Using set-theoretic considerations, we show that the forest formula for overlapping divergences comes from the Hopf algebra of rooted trees. Motivation and Introduction The process of renormalization is governed by the forest formula, as derived for example in [1]. The underlying combinatorics is directly related to the Hopf algebra structure of rooted trees. This is evident in the case of Feyn...

In multiagent domains, agents form coalitions to perform tasks. The usual models of cooperative game theory assume that the desired outcome is either the grand coalition or a coalition structure that consists of disjoint coalitions (i.e., a partition of the set of agents). However, in practice an agent may be involved in executing more than one task, and distributing his resources between sever...

Some experiments have been performed in which the perception of two consonant-vowel syllables, the starting time of one was delayed relative to the other, have been studied. The consonant was /w/ or /j/, the vowel /i/ or /a/, and the fundamental frequency of the syllable 100 or 150 Hz. The delay was varied from 0 ms (simultaneous presentation) to 200 ms (consecutive presentation). As expected, ...

This paper discusses the common pool problems that arise when multiple territorially overlapping governments share access to a common tax base. Contrary to a competitive Tiebout model in which increasing the number of governments in an area increases competition and improves efficiency, when jurisdictions overlap, increasing the number of governments worsens externalities and a “tragedy of the ...

Layered learning is a hierarchical machine learning paradigm that enables learning of complex behaviors by incrementally learning a series of sub-behaviors. A key feature of layered learning is that higher layers directly depend on the learned lower layers. In its original formulation, lower layers were frozen prior to learning higher layers. This article considers a major extension to the para...