421 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University College LondonGB63 papers
- Systemic Risk CentreGB48 papers
- University of OxfordGB20 papers
- University of WarwickGB18 papers
- King's College LondonGB16 papers
- London Mathematical LaboratoryGB12 papers
- University of Illinois Urbana-ChampaignUS12 papers
- Centre National de la Recherche ScientifiqueFR11 papers
- Queen Mary University of LondonGB11 papers
- The Open UniversityGB11 papers
- City, University of LondonGB10 papers
- ETH ZurichCH10 papers
13 papers · 1 filter
Toughness and Vertex Degrees
D. Bauer, H. J. Broersma, J. van den Heuvel +2
We study theorems giving sufficient conditions on the vertex degrees of a graph to guarantee is -tough. We first give a best monotone theorem when , but then show…
Families of parameters for SRNT graphs
Norman Biggs
The feasibility conditions obtained in a previous report are refined, and used to determine several infinite families of feasible parameters for strongly regular graphs with no tri…
Optimal investment with inside information and parameter uncertainty
Albina Danilova, Michael Monoyios, Andrew Ng
This paper has been withdrawn by the authors pending corrections.
Further calculations for the McKean stochastic game for a spectrally negative Levy process: from a point to an interval
Erik J. Baurdoux, Kees van Schaik
Following Baurdoux and Kyprianou [2] we consider the McKean stochastic game, a game version of the McKean optimal stopping problem (American put), driven by a spectrally negative L…
Regular Matroids with Graphic Cocircuits
Konstantinos Papalamprou, Leonidas Pitsoulis
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we…
The Gilbert Arborescence Problem
M. G. Volz, M. Brazil, C. J. Ras +2
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations in a normed space and with associated flo…
Community Cloud Computing
Alexandros Marinos, Gerard Briscoe
Cloud Computing is rising fast, with its data centres growing at an unprecedented rate. However, this has come with concerns over privacy, efficiency at the expense of resilience,…
Shadows of ordered graphs
Béla Bollobás, Graham Brightwell, Robert Morris
Isoperimetric inequalities have been studied since antiquity, and in recent decades they have been studied extensively on discrete objects, such as the hypercube. An important spec…
Digital Ecosystems in the Clouds: Towards Community Cloud Computing
Gerard Briscoe, Alexandros Marinos
Cloud Computing is rising fast, with its data centres growing at an unprecedented rate. However, this has come with concerns of privacy, efficiency at the expense of resilience, an…
On the representability of totally unimodular matrices on bidirected graphs
L. Pitsoulis, K. Papalamprou, G. Appa +1
Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called -…
How many times can a function be iterated?
Massimo Gobbino, Robert Samuel Simon
Let C be a closed subset of a topological space X, and let f : C --> X. Let us assume that f is continuous and f(x) lies in C for every x in the boundary of C. How many times can o…
Order-invariant measures on fixed causal sets
Graham Brightwell, Malwina Luczak
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type…
Order-invariant measures on causal sets
Graham Brightwell, Malwina Luczak
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumerati…