skip to content
 

Seminars (CMP)

Videos and presentation materials from other INI events are also available.

Search seminar archive

Event When Speaker Title
CMPW01 5th August 2002
11:30 to 12:30
S Janson Estimates for large deviations of sums of dependent variables
CMPW01 5th August 2002
14:00 to 15:00
C Smyth Reimer's inequality and a conjecture of Tardos
CMPW01 5th August 2002
16:00 to 17:00
M Jerrum Mixing time and its relation to other Markov chain parameters
CMPW01 6th August 2002
10:00 to 11:00
R Kannan Blocking Conductance --- an improved measure of convergence
CMPW01 6th August 2002
11:30 to 12:30
C Greenhill The differential equations method
CMPW01 6th August 2002
14:00 to 15:00
A Barvinok The distribution of values in the quadratic assignment problem
CMPW01 6th August 2002
16:00 to 17:00
C Cooper The cover time of sparse random graphs $G_{n,p}$, $p=c \log n$, $c>1$, and related problems
CMPW01 7th August 2002
10:00 to 11:00
A Holroyd Two-dimensional bootstrap percolation
CMPW01 7th August 2002
11:30 to 12:30
M Safra Noise - insensitive Boolean - functions are juntas
CMPW01 8th August 2002
10:00 to 11:00
P Tetali Approximating Min-sum set cover
CMPW01 8th August 2002
11:30 to 12:30
E Vigoda Mixing in time and space for lattice spin system: a combinatorial view
CMPW01 8th August 2002
14:00 to 15:00
A Sokal Chromatic polynomials, Potts models, and all that
CMPW01 8th August 2002
16:00 to 17:00
M Cryan A polynominal-time algorithm to approximately count contingency tables when the number of rows is constant
CMPW01 9th August 2002
10:00 to 11:00
D Randall Random dyadic tilings of the unit square
CMPW01 9th August 2002
11:30 to 12:30
M Mahoney Markov chan Monte Carlo in statistical physics \& an application to the statistical mechanics of simple models of liquid water
CMPW01 9th August 2002
14:00 to 15:00
G Brightwell Connectedness of Glauber dynamics for H-coloring
CMPW01 9th August 2002
16:00 to 17:00
P Winkler Mixing \& shuffling
CMPW01 12th August 2002
10:00 to 11:00
T Gowers Arithmetic progressions and Fourier analysis
CMPW01 12th August 2002
11:30 to 12:30
A Sinclair Clifford algebras and approximating the permanent
CMPW01 12th August 2002
14:00 to 15:00
L Goldberg The compexity of sampling (and approximately counting graph homomorphism
CMPW01 12th August 2002
16:00 to 17:00
M Dyer Approximate counting by dynamic programming
CMPW01 13th August 2002
10:00 to 11:00
JH Kim The Poisson cloning model for random graphs with applications to k-core problems, random 2-SAT, and random digraphs
CMPW01 13th August 2002
11:30 to 12:30
M Zito (Distance constrained) edge packing in random regular graphs
CMPW01 13th August 2002
14:00 to 15:00
A Rucinski Ramsey properties of random structures
CMPW01 13th August 2002
16:00 to 17:00
C Banderier Discrete smoothed complexity
CMPW01 14th August 2002
11:30 to 12:30
J Hansen Hueristic algorithms for optimal directed spanning trees...
CMPW01 15th August 2002
10:00 to 11:00
M Karonski Existence of a perfect matching in a random (1 + 1/e)-out bipartite graph
CMPW01 15th August 2002
11:30 to 12:30
A Frieze Perfect matchings in random graphs with prescribed minimal degree
CMPW01 15th August 2002
14:00 to 15:00
M Luczak Building uniform subtrees of a Cayley tree
CMPW01 15th August 2002
16:00 to 17:00
G Sorkin Phase transitions in random MAX 2-SAT and MAX CUT
CMPW01 16th August 2002
10:00 to 11:00
J Fill On the possibility, and impossiblity, of interruptible perfect sampling
CMPW01 16th August 2002
11:30 to 12:30
A Czumaj Simple strategies for high-precision load balancing
CMPW01 16th August 2002
14:00 to 15:00
V Vazirani A stochastic process on the hypercube with applications to peer-to-peer networks
CMPW01 16th August 2002
16:00 to 17:00
M Karpinski Approximating dense instances of MIN-SAT
CMPW02 27th August 2002
08:30 to 10:00
Registration
CMPW02 27th August 2002
10:00 to 11:00
G Grimmett Nearly solved models in statistical mechanics
CMPW02 27th August 2002
11:30 to 12:30
A Stacey Percolation on finite graphs
CMPW02 27th August 2002
14:00 to 15:00
A Thomason The extremal structure of graph minors
CMPW02 27th August 2002
16:00 to 17:00
P Tetali Subgaussian constant and concentration inequalities
CMPW02 28th August 2002
10:00 to 11:00
D Galvin Homomorphisms from the Hamming cube to Z
CMPW02 28th August 2002
11:30 to 12:30
B Pittel Phase diagram for the constrained integer partitioning problem
CMPW02 29th August 2002
10:00 to 11:00
E Vigoda Phase transitions on trees and rapid mixing of Glauber dynamics on high-girth graphs
CMPW02 29th August 2002
11:30 to 12:30
K Eloranta Archimedean ice
CMPW02 29th August 2002
14:00 to 15:00
J-B Son Spectral gap and log-Sobolev constant for balanced matroids
CMPW02 29th August 2002
16:00 to 17:00
Y Stamatiou How to prove conditional randomness
CMPW02 30th August 2002
10:00 to 11:00
P Chassaing Random quadrangulations and Brownian Snake
CMPW02 30th August 2002
11:30 to 12:30
Y Suhov SOS and hard core models on a Cayley tree
CMPW02 30th August 2002
14:00 to 15:00
O Hryniv Trees, walks and critical prewetting
CMPW02 30th August 2002
16:00 to 17:00
A Soshnikov On the largest eigenvalue of a random subgroup of the hypercube
CMPW02 2nd September 2002
11:30 to 12:30
M Krivelevich Colouring problems in random graphs
CMPW02 2nd September 2002
14:00 to 15:00
M Luczak Martingale inequalities and the asymptotic behaviour of large communication networks
CMPW02 2nd September 2002
16:00 to 17:00
S Janson Upper tails for subgraph counts in random graphs
CMPW02 3rd September 2002
10:00 to 11:00
M Penrose Random geometric graphs: cliques \& giant components
CMPW02 3rd September 2002
11:30 to 12:30
A Scott Independent sets, lattice gases and the Lovasz Local Lemma
CMPW02 3rd September 2002
14:00 to 15:00
C Greenhill Generalised acyclic edge colourings of random regular graphs
CMPW02 3rd September 2002
16:00 to 17:00
C Cooper The size of the cores of random hypergraphs with a given degree sequence
CMPW02 4th September 2002
10:00 to 11:00
E Mossel Mixing times of the biased card shuffling and the asymmetric exclusion process
CMPW02 4th September 2002
11:30 to 12:30
D Stark Information loss in top to random shuffling
CMPW02 5th September 2002
10:00 to 11:00
A Taraz Colouring random graphs in expected polynomial time
CMPW02 5th September 2002
11:30 to 12:30
C McDiarmid Random channel assignment problems
CMPW02 5th September 2002
14:00 to 15:00
J Kempe Quantum random walks
CMPW02 5th September 2002
16:00 to 17:00
N Fountoulakis On the structure of the giant component of spares random graphs
CMPW02 6th September 2002
09:00 to 10:00
A Stacey Percolation on finite graphs
CMPW02 6th September 2002
10:00 to 11:00
B Bollobás Scale-free random graphs
CMPW02 6th September 2002
11:30 to 12:30
J Kahn On phase transition in the hard-core model on $Z^d$
CMPW02 6th September 2002
14:00 to 15:00
R Darling Phase transitions in hypergraph processes
CMPW02 6th September 2002
16:00 to 17:00
M Karonski On graph irregularity strength
CMP 25th September 2002
14:00 to 15:00
T Luczak The phase transiton in random graphs: a microscopic view of the random-cluster model
CMP 26th September 2002
11:00 to 12:00
P Winkler On playing golf with two balls
CMP 2nd October 2002
16:00 to 17:00
A Jarai Incipient infinite percolation clusters in two and high dimensions
CMP 8th October 2002
14:00 to 15:00
M Simonovits On a hypergraph extremal problem
CMP 15th October 2002
16:00 to 17:00
J van den Berg Self-destructive percolation
CMP 23rd October 2002
16:00 to 17:00
A Lukacs Generating random group elements
CMP 29th October 2002
16:00 to 17:00
L Stougie On-line optimisation
CMP 12th November 2002
16:00 to 17:00
D Randall Simulated tempering: fast or slow?
CMP 19th November 2002
16:00 to 17:00
E Vigoda Non-Markovian coupling
CMP 26th November 2002
16:00 to 17:00
M Dyer Markov chains for contingency tables with few rows
CMP 3rd December 2002
16:00 to 17:00
C Goldschmidt Stochastic process methods in the analysis of random hypergraphs
CMP 10th December 2002
16:00 to 17:00
J van den Heuvel Cyclic colourings and distant 2-colourings of planar graphs
CMPW03 16th December 2002
10:00 to 11:00
F Kelly Congestion pricing and capacity expansion games
CMPW03 16th December 2002
11:30 to 12:30
B von Stengel Games and computation
CMPW03 16th December 2002
14:00 to 15:00
B Voecking Pricing equilibria for a congestion game with incomplete information
CMPW03 16th December 2002
15:30 to 16:00
M Luczak On the power of two choices: balls and bins in continous time
CMPW03 16th December 2002
16:00 to 17:00
J Chayes A model of directed scale-free graphs$^2$
CMPW03 17th December 2002
10:00 to 11:00
C Papadimitriou Understanding the internet graph
CMPW03 17th December 2002
11:30 to 12:30
E Koutsoupias Co-ordination mechanisms
CMPW03 17th December 2002
14:00 to 15:00
V Vazirani How intractable is the "invisible hand"
CMPW03 17th December 2002
15:30 to 16:00
A Vetta On the quality of competitive equilibria in games with submodular social objective functions
CMPW03 17th December 2002
16:00 to 16:30
J Nino-Mora Admission control and routing to parallel queues via Whittle's restless bandit index policy
CMPW03 17th December 2002
16:30 to 17:00
R Johari Internet resource allocation and a network congestion game
CMPW03 18th December 2002
10:00 to 11:00
P Raghavan Measurements on the web graph
CMPW03 18th December 2002
11:30 to 12:30
C Cooper Web graphs: models and algorithms
CMPW03 18th December 2002
14:00 to 15:00
A Karlin Competitive worst-case analysis of truthful auctions: a survey
CMPW03 18th December 2002
15:30 to 16:00
N Carlsson Asymptotic properties of a simple TCP model
CMPW03 18th December 2002
16:00 to 16:30
I Kaj A limit process for long-range dependent arrival models under critical scaling
CMPW03 19th December 2002
10:00 to 11:00
E Tardos Network design with selfish agents
CMPW03 19th December 2002
11:30 to 12:30
T Roughgardern Selfish routing and the price of anarchy
CMPW03 19th December 2002
14:00 to 15:00
E Upfal Building low-diameter peer-to-peer networks
CMPW03 19th December 2002
15:30 to 16:00
A Brooms Assessing routing behaviour into a shared resource: simulation vs. the Nash equilibrium
CMPW03 19th December 2002
16:00 to 17:00
J-Y Cai On REM and SAM-estimation of congestion price using probabilistic packet marking
CMPW03 20th December 2002
10:00 to 11:00
A Rosen Dynamic routing on networks with fixed-size buffers
CMPW03 20th December 2002
11:30 to 12:30
R Gibbens Fixed point models for performance engineering in enterprise IP networks
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons