The University of Western Australia
Centre for the Mathematics of Symmetry and Computation
 
 

Centre for the Mathematics of Symmetry and Computation

2011 seminars

Subgraphs of Random Graphs with Specified Degrees

  • 11.00am, 14 January 2011, Maths Lecture Room 2
  • Brendan McKay (Australian National University)
If a graph is chosen uniformly at random from all the graphs with a given degree sequence, what can be said about its subgraphs? The same can be asked of bipartite graphs, equivalently 0-1 matrices. These questions have been studied by many people. In this paper we provide a partial survey of the field, with emphasis on two general techniques: the method of switchings and the multidimensional saddle-point method.

Back to top

 

Centre for the Mathematics of Symmetry and Computation

University information

CRICOS Code: 00126G

This Page

Last updated:
Thursday, 13 January, 2011 2:37 PM

http://www.cmsc.uwa.edu.au/1353767