  In adversarial networks, edges correspond to negative interactions such as
competition or dominance. We introduce a new type of node called a low-key
leader in adversarial networks, distinguished by contrasting the centrality
measures of CON score and PageRank. We present a novel hypothesis that low-key
leaders are ubiquitous in adversarial networks and provide evidence by
considering data from real-world networks, including dominance networks in 172
animal populations, trading networks between G20 nations, and Bitcoin trust
networks. We introduce a random graph model that generates directed graphs with
low-key leaders.
