C4

We propose a novel class of network models for temporal dyadic interaction data. Our objective is to capture important features often observed in social interactions: sparsity, degree heterogeneity, community structure and reciprocity. We use mutually-exciting Hawkes processes to model the interactions between each (directed) pair of individuals. The intensity of each process allows interactions to arise as responses to opposite interactions (reciprocity), or due to shared interests between individuals (community structure). For sparsity and degree heterogeneity, we build the non time dependent part of the intensity function on compound random measures following (Todeschini et al., 2016). We conduct experiments on real- world temporal interaction data and show that the proposed model outperforms competing approaches for link prediction, and leads to interpretable parameters.

Link to paper: https://papers.nips.cc/paper/7502-modelling-sparsity-heterogeneity-reci…

Multiplicative preprojective algebras (MPAs) were originally defined by Crawley-Boevey and Shaw to encode solutions of the Deligne-Simpson problem as irreducible representations. 
MPAs have recently appeared in the literature from different perspectives including Fukaya categories of plumbed cotangent bundles (Etgü and Lekili) and, similarly, microlocal sheaves 
on rational curves (Bezrukavnikov and Kapronov.) After some motivation, I'll suggest a purely algebraic approach to study these algebras. Namely, I'll outline a proof that MPAs are 
2-Calabi-Yau if Q contains a cycle and an inductive argument to reduce to the case of the cycle itself.

Euler sums and p-adic L-functions

We examine the relationship between social structure and sentiment through the analysis of a large collection of tweets about the Irish Marriage Referendum of 2015. We obtain the sentiment of every tweet with the hashtags #marref and #marriageref that was posted in the days leading to the referendum, and construct networks to aggregate sentiment and use it to study the interactions among users. Our analysis shows that the sentiment of outgoing mention tweets is correlated with the sentiment of incoming mentions, and there are significantly more connections between users with similar sentiment scores than among users with opposite scores in the mention and follower networks. We combine the community structure of the follower and mention networks with the activity level of the users and sentiment scores to find groups that support voting ‘yes’ or ‘no’ in the referendum. There were numerous conversations between users on opposing sides of the debate in the absence of follower connections, which suggests that there were efforts by some users to establish dialogue and debate across ideological divisions. Our analysis shows that social structure can be integrated successfully with sentiment to analyse and understand the disposition of social media users around controversial or polarizing issues. These results have potential applications in the integration of data and metadata to study opinion dynamics, public opinion modelling and polling.

The problem of authorship attribution (AA) involves matching a text of unknown authorship with its creator, found among a pool of candidate authors. In this work, we examine in detail authorship attribution methods that rely on networks of function words to detect an “authorial fingerprint” of literary works. Previous studies interpreted these word adjacency networks (WANs) as Markov chains, giving transition rates between function words, and they compared them using information-theoretic measures. Here, we apply a variety of network flow-based tools, such as role-based similarity and community detection, to perform a direct comparison of the WANs. These tools reveal an interesting relation between communities of function words and grammatical categories. Moreover, we propose two new criteria for attribution based on the comparison of connectivity patterns and the similarity of network partitions. The results are positive, but importantly, we observe that the attribution context is an important limiting factor that is often overlooked in the field's literature. Furthermore, we give important new directions that deserve further consideration.

Coupling dynamics of the states of the nodes of a network to the dynamics of the network topology leads to generic absorbing and fragmentation transitions. The coevolving voter model is a typical system that exhibits such transitions at some critical rewiring. We study the robustness of these transitions under two distinct ways of introducing noise. Noise affecting all the nodes destroys the absorbing-fragmentation transition, giving rise in finite-size systems to two regimes: bimodal magnetization and dynamic fragmentation. Noise targeting a fraction of nodes preserves the transitions but introduces shattered fragmentation with its characteristic fraction of isolated nodes and one or two giant components. Both the lack of absorbing state for homogeneous noise and the shift in the absorbing transition to higher rewiring for targeted noise are supported by analytical approximations.

Paper Link:

https://journals.aps.org/pre/abstract/10.1103/PhysRevE.92.032803

With the introduction of supermarket loyalty cards in recent decades, there has been an ever-growing body of customer-level shopping data. A natural way to represent this data is with a bipartite network, in which customers are connected to products that they purchased. By predicting likely edges in these networks, one can provide personalised product recommendations to customers.
In this talk, I will first discuss a basic approach for recommendations, based on network community detection, that we have validated on a promotional campaign run by our industrial collaborators. I will then describe a multilayer network model that accounts for the fact that customers tend to buy the same grocery items repeatedly over time. By modelling such correlations explicitly, link-prediction accuracy improves considerably. This approach is also useful in other networks that exhibit significant edge correlations, such as social networks (in which people often have repeated interactions with other people), airline networks (in which popular routes are often served by more than one airline), and biological networks (in which, for example, proteins can interact in multiple ways). 
 

Many real-world networks contain small recurring connectivity patterns also known as network motifs. Although network motifs are widely considered to be important structural features of networks that are closely connected to their function methods for characterizing and modelling the local connectivity structure of complex networks remain underdeveloped. In this talk, we will present a non-parametric approach that is based on generative models in which networks are generated by adding not only single edges but also but also copies of larger subgraphs such as triangles to the graph. We show that such models can be formulated in terms of latent states that correspond to subgraph decompositions of the network and derive analytic expressions for the likelihood of such models. Following a Bayesian approach, we present a nonparametric prior for model parameters. Solving the resulting inference problem results in a principled approach for identifying atomic connectivity patterns of networks that do not only identify statistically significant connectivity patterns but also produces a decomposition of the network into such atomic substructures. We tested the presented approach on simulated data for which the algorithm recovers the latent state to a high degree of accuracy. In the case of empirical networks, the method identifies concise sets atomic subgraphs from within thousands of candidates that are plausible and include known atomic substructures.

Following recent papers by Nima Arkani-Hamed.

I will give an overview of the Nielsen-Thurston theory of the mapping class group and its connection to hyperbolic geometry and dynamics. Time permitting, I will discuss the surface entropy conjecture and a theorem of Hamenstadt on entropies of `generic' elements of the mapping class group. No prior knowledge of the concepts involved is required.