Tue, 16 Jan 2018

12:00 - 13:00
C3

Classifying Conversation in Digital Communication

Andrew Mellor
(University of Oxford)
Abstract

Many studies of digital communication, in particular of Twitter, use natural language processing (NLP) to find topics, assess sentiment, and describe user behaviour.
In finding topics often the relationships between users who participate in the topic are neglected.
We propose a novel method of describing and classifying online conversations using only the structure of the underlying temporal network and not the content of individual messages.
This method utilises all available information in the temporal network (no aggregation), combining both topological and temporal structure using temporal motifs and inter-event times.
This allows us to describe the behaviour of individuals and collectives over time and examine the structure of conversation over multiple timescales.
 

Tue, 27 Feb 2018

12:00 - 13:00
C3

Modular Structure in Temporal Protein Interaction Networks

Florian Klimm
(University of Oxford)
Abstract

Protein interaction networks (PINs) allow the representation and analysis of biological processes in cells. Because cells are dynamic and adaptive, these processes change over time. Thus far, research has focused either on the static PIN analysis or the temporal nature of gene expression. By analysing temporal PINs using multilayer networks, we want to link these efforts. The analysis of temporal PINs gives insights into how proteins, individually and in their entirety, change their biological functions. We present a general procedure that integrates temporal gene expression information with a monolayer PIN to a temporal PIN and allows the detection of modular structure using multilayer modularity maximisation.

Fri, 09 Mar 2018

14:15 - 15:15
C3

Particles in Fluid Flows: How Microscopic Processes Impact Macroscopic Evolution

Bruce Sutherland
(University of Alberta)
Abstract

Through laboratory experiments, we examine the transport, settling and resuspension of sediments as well as the influence of floating particles upon damping wave motion.   Salt water is shown to enhance flocculation of clay and hence increase their settling rate.   In studies modelling sediment-bearing (hypopycnal) river plumes, experiments show that the particles that eventually settle through uniform-density fluid toward a sloping bottom form a turbidity current.  Meanwhile, even though the removal of particles should increase the buoyancy and hence speed of the surface current, in reality the surface current stops.  This reveals that the removal of fresh water carried by the viscous boundary layers surrounding the settling particles drains the current even when their concentration by volume is less than 5%. The microscopic effect of boundary layer transport by particles upon the large scale evolution is dramatically evident in the circumstance of a mesopycnal particle-bearing current that advances along the interface of a two-layer fluid.  As the fresh water rises and particles fall, the current itself stops and reverses direction.  As a final example, the periodic separation and consolidation of particles floating on a surface perturbed by surface waves is shown to damp faster than exponentially to attain a finite-time arrest as a result of efficiently damped flows through interstitial spaces between particles - a phenomenon that may be important for understanding the damping of surface waves by sea ice in the Arctic Ocean (and which is well-known to anyone drinking a pint with a proper head or a margarita with rocks or slush).

Fri, 23 Feb 2018

14:15 - 15:15
C3

Brownian Motion, Polar Oceans, and the Statistical Physics of Climate

Srikanth Toppaladoddi
(All Souls College)
Abstract

In this talk, I show how concepts from non-equilibrium statistical physics can be employed in the study of climate. The specific problem addressed is the geophysical-scale evolution of Arctic sea ice. Using an analogy with Brownian motion, the original evolution equation for the sea ice thickness distribution function by Thorndike et al. (J. Geophys. Res. 80(33), pp. 4501 — 4513, 1975) is transformed to a Fokker-Planck-like conservation law. The steady solution is $g(h) = {\cal N}(q) h^q \mathrm{e}^{-~ h/H}$, where $q$ and $H$ are expressible in terms of moments over the transition probabilities between thickness categories. The solution exhibits the functional form used in observational fits and shows that for $h \ll 1$, $g(h)$ is controlled by both thermodynamics and mechanics, whereas for $h \gg 1$ only mechanics controls $g(h)$. We also derive the underlying Langevin equation governing the dynamics of the ice thickness $h$, from which we predict the observed $g(h)$. Further, seasonality is introduced by using the Eisenman-Wettlaufer model (Proc. Natl. Acad. Sci. USA 106, pp. 28-32, 2009) for the thermal growth of sea ice. The time-dependent problem is studied by numerically integrating the Fokker-Planck equation. The results obtained from these numerical integrations and their comparison with satellite observations are discussed.

Fri, 09 Feb 2018

14:15 - 15:15
C3

Modelling wells in oil reservoir simulation

Jonathan Holmes
(ex Schlumberger)
Abstract

Numerical simulation provides an important contribution to the management of oil reservoirs, and the ‘reservoir simulator’ has been an essential tool for reservoir engineers since the 1970’s. I will describe the role of the ‘well model’ in reservoir simulation. Its main purpose is to determine the production and injection flows of the reservoir fluids at the surface under a variety of operating constraints, and to supply source and sink terms to the grid cells of the reservoir model.

 

Advances in well technology (horizontal, multilateral, and smart wells containing flow control devices) have imposed additional demands on the well model. It must allow the fluid mixture properties to vary with position in the well, and enable different fluid streams to comingle. Friction may make an important contribution to the local pressure gradient. To provide an improved representation of the physics of fluid flow, the well is discretised into a network of segments, where each segment has its own set of variables describing the multiphase flow conditions. Individual segments can be configured to represent flow control devices, accessing lookup tables or built-in correlations to determine the pressure drop across the device as a function of the flow conditions.

 

The ability to couple the wells to a production facility model such as a pipeline network is a crucial advantage for field development and optimization studies, particularly for offshore fields. I will conclude by comparing two techniques for combining a network model with the reservoir simulation. One method is to extend the simulator’s well model to include the network, providing a fully integrated reservoir/well/network simulation. The other method is to run the reservoir and facility models as separate simulations coupled by a ‘controller’, which periodically balances them by exchanging boundary conditions. The latter approach allows the engineer to use a choice of specialist facility simulators.

Fri, 26 Jan 2018

14:15 - 15:15
C3

Obligate Mutualism

Roger Cropp
(Griffith University Australia)
Abstract

In contemporary ecology and mathematical biology undergraduate courses, textbooks focus on competition and predation models despite it being accepted that most species on Earth are involved in mutualist relationships. Mutualism is usually discussed more briefly in texts, often from an observational perspective, and obligate mutualism mostly not at all. Part of the reason for this is the lack of a simple math model to successfully explain the observations. Traditionally, particular nonlinearities  are used, which produce a variety of apparently disparate models.

The failure of the traditional linear model to describe coexisting mutualists has been documented from May (1973) through Murray (2001) to Bronstein (2015). Here we argue that this could be because of the use of carrying capacity, and propose the use of a nutrient pool instead, which implies the need for an autotroph (e.g. a plant) that converts nutrients into living resources for higher trophic levels. We show that such a linear model can successfully explain the major features of obligate mutualism when simple expressions for obligated growth are included.

Tue, 28 Nov 2017

12:00 - 13:00
C3

A networks perspective on automation

Maria del Rio Chanona
(University of Oxford)
Abstract

Current technological progress has raised concerns about automation of tasks performed by workers resulting in job losses. Previous studies have used machine learning techniques to compute the automation probability of occupations and thus, studied the impact of automation on employment. However, such studies do not consider second-order effects, for example, an occupation with low automation probability can have a  surplus of labor supply due to similar occupations being automated. In this work, we study such second-order effects of automation using a network approach.  In our network – the Job Space – occupations are nodes and edges link occupations which share a significant amount of work activities. By mapping employment, automation probabilities into the network, and considering the movement of workers, we show that an occupation’s position in the network may be crucial to determining its employment future.

 

Tue, 21 Nov 2017

12:00 - 13:00
C3

Complex Contagions with Timers

Se-Wook Oh
(University of Oxford)
Abstract

A great deal of effort has gone into trying to model social influence --- including the spread of behavior, norms, and ideas --- on networks. Most models of social influence tend to assume that individuals react to changes in the states of their neighbors without any time delay, but this is often not true in social contexts, where (for various reasons) different agents can have different response times. To examine such situations, we introduce the idea of a timer into threshold models of social influence. The presence of timers on nodes delays the adoption --- i.e., change of state --- of each agent, which in turn delays the adoptions of its neighbors. With a homogeneous-distributed timer, in which all nodes exhibit the same amount of delay, adoption delays are also homogeneous, so the adoption order of nodes remains the same. However, heterogeneously-distributed timers can change the adoption order of nodes and hence the "adoption paths" through which state changes spread in a network. Using a threshold model of social contagions, we illustrate that heterogeneous timers can either accelerate or decelerate the spread of adoptions compared to an analogous situation with homogeneous timers, and we investigate the relationship of such acceleration or deceleration with respect to timer distribution and network structure. We derive an analytical approximation for the temporal evolution of the fraction of adopters by modifying a pair approximation of the Watts threshold model, and we find good agreement with numerical computations. We also examine our new timer model on networks constructed from empirical data.

Link to arxiv paper: https://arxiv.org/abs/1706.04252

Tue, 14 Nov 2017

12:00 - 13:00
C3

The Temporal Event Graph

Andrew Mellor
(University of Oxford)
Abstract

Temporal networks are increasingly being used to model the interactions of complex systems. 
Most studies require the temporal aggregation of edges (or events) into discrete time steps to perform analysis.
In this article we describe a static, behavioural representation of a temporal network, the temporal event graph (TEG).
The TEG describes the temporal network in terms of both inter-event time and two-event temporal motifs.
By considering the distributions of these quantities in unison we provide a new method to characterise the behaviour of individuals and collectives in temporal networks as well as providing a natural decomposition of the network.
We illustrate the utility of the TEG by providing examples on both synthetic and real temporal networks.

Tue, 07 Nov 2017

12:00 - 13:00
C3

Optimal modularity maximisation in multilayer networks

Roxana Pamfil
(University of Oxford)
Abstract

Identifying clusters or "communities" of densely connected nodes in networks is an active area of research, with relevance to many applications. Recent advances in the field have focused especially on temporal, multiplex, and other kinds of multilayer networks.

One method for detecting communities in multilayer networks is to maximise a generalised version of an objective function known as modularity. Writing down multilayer modularity requires the specification of two types of resolution parameters, and choosing appropriate values is crucial for uncovering meaningful community structure. In the simplest case, there are just two parameters, one controlling the sizes of detected communities, and the other influencing how much communities change from layer to layer. By establishing an equivalence between modularity optimisation and a multilayer maximum-likelihood approach to community detection, we are able to determine statistically optimal values for these two parameters. 

When applied to existing multilayer benchmarks, our optimized approach performs significantly better than using parameter choices guided by heuristics. We also apply the method to supermarket data, revealing changes in consumer behaviour over time.

Subscribe to C3