The quality of network clustering is often measured in terms of a commonly used metric known as “modularity”. Modularity compares the clusters found in a network to those present in a random graph (a “null model”). Unfortunately, modularity is somewhat ill suited for studying spatially embedded networks, since a random graph contains no basic geometrical notions. Regardless of their distance, the null model assigns a nonzero probability for an edge to appear between any pair of nodes. Here, we propose a variant of modularity that does not rely on the use of a null model. To demonstrate the essentials of our method, we analyze networks generated from granular ensemble. We show that our method performs better than the most commonly used Newman-Girvan (NG) modularity in detecting the best (physically transparent) partitions in those systems. Our measure further properly detects hierarchical structures, whenever these are present.
- Award ID(s):
- 1760102
- PAR ID:
- 10357234
- Date Published:
- Journal Name:
- Proceedings of the 11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management
- Volume:
- IC3K 2019
- Page Range / eLocation ID:
- 72 to 82
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract -
Networks that provide agents with access to a common database of the agents' actions enable an agent to easily learn by observing the actions of others, but are also susceptible to manipulation by “fake” agents. Prior work has studied a model for the impact of such fake agents on ordinary (rational) agents in a sequential Bayesian observational learning framework. That model assumes that ordinary agents do not have an ex-ante bias in their actions and that they follow their private information in case of an ex-post tie between actions. This paper builds on that work to study the effect of fake agents on the welfare obtained by ordinary agents under different ex-ante biases and different tie-breaking rules. We show that varying either of these can lead to cases where, unlike in the prior work, the addition of fake agents leads to a gain in welfare. This implies that in such cases, if fake agents are absent or are not adequately present, an altruistic platform could artificially introduce fake actions to effect improved learning.more » « less
-
more » « less
Abstract The obligate brood parasitic common cuckoo (
Cuculus canorus ) is best known for its two-note “cu-coo” call, which is uttered repeatedly by adult males during the breeding season. This call advertises the male’s claim for his territory. A rare, aberrant version (“cu-kee”) was discovered in a population of cuckoos in central Hungary. In a playback experiment, we simulated conspecific territorial intrusions using either aberrant call sequences or normal calls (as control). Cuckoos responded to both calls similarly by approaching the speaker, flying around it several times, and perching on nearby trees. To identify the role of each note of these cuckoo calls, we also played sequences of the first (“cu”) or second (“coo” or “kee”) notes of the calls. Territorial males responded to first notes at similarly high frequencies as to each of the full calls, whereas responses toward either second note type were nearly absent. Thus, the first notes of both typical and aberrant cuckoo calls contain sufficient information to recognize conspecific males and the novel calls did not reduce the efficiency of male-male communication in cuckoos because the aberration occurred in the less functional second note.Significance statement Birds use songs and calls to communicate with each other, including advertising their territories to keep competitors away. However, when the acoustic signal is atypical and distorted, the receiver individual may not process it correctly. Common cuckoos recognize a territorial intruder by their well-known “cu-coo” calls. We studied a rare, aberrant version of the common cuckoo call (“cu-kee”), which differed from the normal call in the second note of the two-partite call. However, cuckoos responded similarly to both of the normal and aberrant calls in a playback experiment. When the first or second parts of the different calls were played separately, only the first part of the cuckoo calls was effective in eliciting territorial defence. Consequently, the aberrant second note did not reduce cuckoos’ communication efficiency.
-
Ranzato, M. ; Beygelzimer, A. ; Dauphin, Y. ; Liang, P.S. ; Vaughan, J. Wortman (Ed.)The prevalence of graph-based data has spurred the rapid development of graph neural networks (GNNs) and related machine learning algorithms. Yet, despite the many datasets naturally modeled as directed graphs, including citation, website, and traffic networks, the vast majority of this research focuses on undirected graphs. In this paper, we propose MagNet, a GNN for directed graphs based on a complex Hermitian matrix known as the magnetic Laplacian. This matrix encodes undirected geometric structure in the magnitude of its entries and directional information in their phase. A charge parameter attunes spectral information to variation among directed cycles. We apply our network to a variety of directed graph node classification and link prediction tasks showing that MagNet performs well on all tasks and that its performance exceeds all other methods on a majority of such tasks. The underlying principles of MagNet are such that it can be adapted to other GNN architectures.more » « less
-
more » « less
Abstract Cluster synchronization in networks of coupled oscillators is the subject of broad interest from the scientific community, with applications ranging from neural to social and animal networks and technological systems. Most of these networks are directed, with flows of information or energy that propagate unidirectionally from given nodes to other nodes. Nevertheless, most of the work on cluster synchronization has focused on undirected networks. Here we characterize cluster synchronization in general directed networks. Our first observation is that, in directed networks, a cluster A of nodes might be one-way dependent on another cluster B: in this case, A may remain synchronized provided that B is stable, but the opposite does not hold. The main contribution of this paper is a method to transform the cluster stability problem in an irreducible form. In this way, we decompose the original problem into subproblems of the lowest dimension, which allows us to immediately detect inter-dependencies among clusters. We apply our analysis to two examples of interest, a human network of violin players executing a musical piece for which directed interactions may be either activated or deactivated by the musicians, and a multilayer neural network with directed layer-to-layer connections.
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.5220/0008069600720082
