DiscoverCombinatorics and Statistical MechanicsRandom randomly coloured graphs
Random randomly coloured graphs

Random randomly coloured graphs

Update: 2008-05-13
Share

Description

Penman, D (Essex)
Friday 09 May 2008, 14:00-15:00
Comments 
Top Podcasts
The Best New Comedy Podcast Right Now – June 2024The Best News Podcast Right Now – June 2024The Best New Business Podcast Right Now – June 2024The Best New Sports Podcast Right Now – June 2024The Best New True Crime Podcast Right Now – June 2024The Best New Joe Rogan Experience Podcast Right Now – June 20The Best New Dan Bongino Show Podcast Right Now – June 20The Best New Mark Levin Podcast – June 2024
In Channel
Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

2008-07-0101:04:36

Zero-free regions for multivariate Tutte polynomials

Zero-free regions for multivariate Tutte polynomials

2008-06-1001:11:30

Trees versus connected graphs II

Trees versus connected graphs II

2008-05-2752:59

Random randomly coloured graphs

Random randomly coloured graphs

2008-05-1357:28

Trees versus connected graphs I

Trees versus connected graphs I

2008-05-1359:17

Can we solve it? Some numerical tests revealing analytic structure.

Can we solve it? Some numerical tests revealing analytic structure.

2008-05-1301:15:17

Large deviations and quantum gravity

Large deviations and quantum gravity

2008-05-1301:32:04

The clustering coefficient of a scale-free random graph

The clustering coefficient of a scale-free random graph

2008-05-1257:24

A Grassmann algebra related to spanning forests

A Grassmann algebra related to spanning forests

2008-05-1201:28:02

Theory of electric networks: the two-point resistance and impedance

Theory of electric networks: the two-point resistance and impedance

2008-05-0953:16

Counting lattice paths with the kernel method

Counting lattice paths with the kernel method

2008-05-0901:09:00

Prudent and quasi-prudent self-avoiding walks and polygons

Prudent and quasi-prudent self-avoiding walks and polygons

2008-05-0859:16

Boundary partitions in trees and dimers

Boundary partitions in trees and dimers

2008-05-0801:05:21

Dimer partition functions on surface graphs of higher genus

Dimer partition functions on surface graphs of higher genus

2008-05-0858:57

Exact enumeration of plane partitions and rhombus tilings

Exact enumeration of plane partitions and rhombus tilings

2008-05-0701:06:18

Dimer packings with gaps and electrostatics: boundary interactions

Dimer packings with gaps and electrostatics: boundary interactions

2008-05-0701:09:00

The bead model

The bead model

2008-05-0753:27

Alternative tableaux, permutations and partially asymmetric exclusion process

Alternative tableaux, permutations and partially asymmetric exclusion process

2008-05-0701:10:18

Conformal invariance and universality in the 2D lsing model

Conformal invariance and universality in the 2D lsing model

2008-05-0601:09:28

Entanglement in the XXZ chain

Entanglement in the XXZ chain

2008-05-0601:02:23

loading
Google Play
Download from Google Play
Castbox
Download from App Store
usUnited States
00:00
00:00
x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

Random randomly coloured graphs

Random randomly coloured graphs

Steve Greenham