Mon, 09 Sep 2019 12:00 -
Wed, 11 Sep 2019 12:00
L5

Workshop on Higher-order Interaction Networks: Dynamics, Structure, Data

See below for speaker information
(Speakers from several universities)
Further Information

The goal of the research workshop "Higher-order interaction networks: dynamics, structure, data" is to bring together researchers from these different communities with distinct perspectives on network dynamics —- from network science, dynamical systems, and data science/machine learning -- to develop novel approaches to understand networked systems. By cutting across different mathematical communities, this will allow to develop new tools, for example by exploring links between data driven methods (such as machine learning) and dynamics. A particular focus of this workshop will be on the role of non-dyadic dynamical interactions (joint interactions between more than two nodes) whose importance for the modeling, analysis, and control of such networked systems have recently been highlighted.

Expressions of interest are now open with an initial deadline of June 1, 2019, with notification of acceptance no later than June 15, 2019.

Participation in the workshop will cost a nominal fee of £50 which will be used to cover catering during the workshop. Participants will also have the chance to attend the workshop dinner on Wednesday 10th September at the nearby Somerville College, the cost of which will be £30.  

Thanks to generous funding from EU and the London Mathematical Society, there is limited travel support for UK-based early career researchers available. Please indicate whether you wish to apply for support during registration.

For further information including registration please click here.

Confirmed Speakers:

Lou Pecora (Naval Research Labs)
Tanya Berger-Wolf (Illinois)
Santiago Segarra (Rice)
Tiago Pereira (USP Sao Carlos)
Marta Sales-Pardo (Barcelona)
Jacopo Grilli (Santa Fe Institute/ICTP Trieste)
Marya Bazzi (ATI)
Rebecca Hoyle (Southampton)
Ana Paula Dias (Porto)
Laetitia Gauvin (ISI Torino)
Heather Harrington (Oxford)
Rodolphe Sepulchre (Cambridge)
Jess Enright (Stirling)
Peter Ashwin (Exeter)
Pawel Dlotko (Swansea)

Fri, 26 Apr 2019

16:00 - 17:00
L1

Mathematics in developing countries

Federico Danieli and Christian Bick
(University of Oxford)
Abstract

How do you create a self-sustaining, flourishing academic community in a developing country? What kind of challenges need to be overcome to ensure that quality education becomes available? What can we do to help make it happen? In this talk, we will describe our experience visiting the University of Yangon in Myanmar. During the visit, we delivered a course to the academic staff, and discussed future collaborations between Oxford and Yangon, as well as further directions for Mathematical education in Myanmar, all the while marvelling at the wonders of the Burmese culture.

Tue, 21 May 2019

14:30 - 15:30

Intervals in the Hales-Jewett Theorem

Christoph Spiegel
Further Information

The Hales–Jewett Theorem states that any r–colouring of [m]^n contains a monochromatic combinatorial line if n is large enough. Shelah’s proof of the theorem implies that for m = 3 there always exists a monochromatic combinatorial line whose set of active coordinates is the union of at most r intervals. I will present some recent findings relating to this observation. This is joint work with Nina Kamcev.

Tue, 14 May 2019

14:30 - 15:30
L6

Graphs which are expanders both locally and globally

Michael Chapman
Further Information

Expander graphs play a key role in modern mathematics and computer science. Random d-regular graphs are good expanders. Recent developments in PCP theory require families of graphs that are expanders both globally and locally. The meaning of “globally" is the usual one of expansion in graphs, and locally means that for every vertex the subgraph induced by its neighbors is also an expander graph. These requirements are significantly harder to satisfy and no good random model for such (bounded degree) graphs is presently known. In this talk we discuss two new combinatorial constructions of such graphs. We also say something about the limitations of such constructions and provide an Alon-Bopanna type bound for the (global) spectral gap of such a graph. In addition we discuss other notions of high dimensional expansion that our constructions do and do not satisfy, such as coboundary expansion, geometric overlap and mixing of the edge-triangle-edge random walk. This is a joint work with Nati Linial and Yuval Peled.
 

Thu, 20 Jun 2019

13:00 - 14:00
L3

Spectral methods for certain inverse problems on graphs and time series data

Mihai Cucuringu
(Statistics Oxford University)
Further Information

We study problems that share an important common feature: they can all be solved by exploiting the spectrum of their corresponding graph Laplacian. We first consider a classic problem in data analysis and machine learning, of establishing a statistical ranking of a set of items given a set of inconsistent and incomplete pairwise comparisons. We formulate the above problem of ranking with incomplete noisy information as an instance of the group synchronization problem over the group SO(2) of planar rotations, whose least-squares solution can be approximated by either a spectral or a semidefinite programming relaxation, and consider an application to detecting leaders and laggers in financial multivariate time series data. An instance of the group synchronization problem over Z_2 with anchor information is broadly applicable to settings where one has available a sparse signal such as positive or negative news sentiment for a subset of nodes, and would like to understand how the available measurements propagate to the remaining nodes of the network. We also present a simple spectral approach to the well-studied constrained clustering problem, which captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. This line of work extends to the setting of clustering signed networks and correlation clustering, where the edge weights between the nodes of the graph may take either positive or negative values, for which we provide theoretical guarantees in the setting of a signed stochastic block model and numerical experiments for financial correlation matrices. Finally, we discuss a spectral clustering algorithm for directed graphs based on a complex-valued representation of the adjacency matrix, motivated by the application of extracting cluster-based lead-lag relationships in time series data.
 

Thu, 23 May 2019

13:00 - 14:00
L4

Monotone Solutions to the Moral Hazard Problem

Hanqing Jin
((Oxford University))
Abstract

We investigate monotone solutions of the moral hazard problems without the monotone likelihood ratio property. The solutions are explicitly characterised by a concave envelope relaxation approach for a two-action model in which the principal is risk neutral or exhibits constant absolute risk aversion.  

Fri, 15 Nov 2019

16:00 - 17:00
L1

Wave localization and its landscape

Doug Arnold
(University of Minnesota)
Further Information

The Oxford Mathematics Colloquia are generously sponsored by Oxford University Press.

Abstract

The puzzling phenonenon of wave localization refers to unexpected confinement of waves triggered by disorder in the propagating medium. Localization arises in many physical and mathematical systems and has many important implications and applications. A particularly important case is the Schrödinger equation of quantum mechanics, for which the localization behavior is crucial to the electrical properties of materials. Mathematically it is tied to exponential decay of eigenfunctions of operators instead of their expected extension throughout the domain. Although localization has been studied by physicists and mathematicians for the better part of a century, many aspects remain mysterious. In particular, the sort of deterministic quantitative results needed to predict, control, and exploit localization have remained elusive. This talk will focus on major strides made in recent years based on the introduction of the landscape function and its partner, the effective potential. We will describe these developments from the viewpoint of a computational mathematician who sees the landscape theory as a completely unorthodox sort of a numerical method for computing spectra.

Fri, 18 Oct 2019

16:00 - 17:00
L1

Geometry as a key to the virosphere: Mathematics as a driver of discovery in virology and anti-viral therapy

Reidun Twarock
(University of York)
Further Information

The Oxford Mathematics Colloquia are generously sponsored by Oxford University Press.

Abstract

Viruses encapsulate their genetic material into protein containers that act akin to molecular Trojan horses, protecting viral genomes between rounds of infection and facilitating their release into the host cell environment. In the majority of viruses, including major human pathogens, these containers have icosahedral symmetry. Mathematical techniques from group, graph and tiling theory can therefore be used to better understand how viruses form, evolve and infect their hosts, and point the way to novel antiviral solutions.

In this talk, I will present an overarching theory of virus architecture, that contains the seminal Caspar Klug theory as a special case and solves long-standing open problems in structural virology. Combining insights into virus structure with a range of different mathematical modelling techniques, such as Gillespie algorithms, I will show how viral life cycles can be better understood through the lens of viral geometry. In particular, I will discuss a recent model for genome release from the viral capsid. I will also demonstrate the instrumental role of the Hamiltonian path concept in the discovery of a virus assembly mechanism that occurs in many human pathogens, such as Picornaviruses – a family that includes the common cold virus– and Hepatitis B and C virus. I will use multi-scale models of a viral infection and implicit fitness landscapes in order to demonstrate that therapeutic interventions directed against this mechanism have advantages over conventional forms of anti-viral therapy. The talk will finish with a discussion of how the new mathematical and mechanistic insights can be exploited in bio-nanotechnology for applications in vaccination and gene therapy.

Fri, 14 Jun 2019

16:00 - 17:00
L1

Old and new on crystalline cohomology and the de Rham-Witt complex

Luc Illusie
(Université de Paris-Sud, Orsay)
Abstract

The subject of $p$-adic cohomologies is over fifty years old. Many new developments have recently occurred. I will mostly limit myself to discussing some pertaining to the de Rham-Witt complex. After recalling the historical background and the basic results, I will give an overview of the new approach of Bhatt, Lurie and Mathew.

Fri, 07 Jun 2019
16:00
L1

Optimal control of multiphase fluids and droplets

Michael Hintermueller
(Humboldt)
Abstract

Solidification processes of liquid metal alloys,  bubble dynamics (as in Taylor flows), pinch-offs of liquid-liquid jets, the formation of polymeric membranes, or the structure of high concentration photovoltaic cells are described by the dynamics of multiphase fluids. On the other hand, in applications such as mass spectrometry, lab-on-a-chip, and electro-fluidic displays, fluids on the micro-scale associated with a dielectric medium are of interest. Moreover, in many of these applications one is interested in influencing (or controlling) the underlying phenomenon in order to reach a desired goal. Examples for the latter could be the porosity structure of a polymeric membrane to achieve certain desired filtration properties of the membrane, or to optimize a microfluidic device for the transport of pharmaceutical agents.

A promising mathematical model for the behavior of multiphase flows associated with the applications mentioned above is given by a phase-field model of Cahn-Hilliard / Navier-Stokes (CHNS) type. Some strengths of phase field (or diffuse interface) approaches are due to their ability to overcome both, analytical difficulties of topological changes, such as, e.g., droplet break-ups or the coalescence of interfaces, and numerical challenges in capturing the interface dynamics between the fluid phases. Deep quenches in solidification processes of liquid alloys or rapid wall hardening in the formation of polymer membranes ask for non-smooth energies in connection with Cahn-Hilliard models. Analytically, this gives rise to a variational inequality coupled to the equations of hydrodynamics, thus yielding a non-smooth system (in the sense that the map associated with the underlying operator equation is not necessarily Frechet differentiable). In contrast to phase-field approaches,
one may consider sharp interface models. In view of this, our microfluidic applications alluded to above are formulated in terms of  sharp interface models and Hele-Shaw flows. In this context, we are particularly interested in applications of electrowetting on dielectric (EWOD) with contact line pinning. The latter phenomenon resembles friction, yields a variational inequality of the second kind, and – once again – it results in an overall nonsmooth mathematical model of the physical process.

   In both settings described above, optimal control problems are relevant in order to influence the underlying physical process to approach a desired system state.  The associated optimization problems are delicate as the respective constraints involve non-smooth structures which render the problems degenerate and prevent a direct application of sophisticated tools for the characterization of solutions. Such characterizations are, however, of paramount importance in the design of numerical solution schemes.

This talk addresses some of the analytical challenges associated with optimal control problems involving non-smooth structures, offers pathways to solutions, and it reports on numerical results for both problem classes introduced above.
 

Subscribe to