<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Discrete mathematics / Stochastic processes / Planar graphs / Gaussian free field / Oded Schramm / Random graph / Random walk / Itai Benjamini / Circle packing theorem / First passage percolation
Date: 2009-10-29 03:44:36
Graph theory
Mathematics
Discrete mathematics
Stochastic processes
Planar graphs
Gaussian free field
Oded Schramm
Random graph
Random walk
Itai Benjamini
Circle packing theorem
First passage percolation

RANDOM PLANAR METRICS ITAI BENJAMINI Abstract. A discussion regarding aspects of several quite different random planar metrics and related topics is presented. 1. Introduction

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Download Document from Source Website

File Size: 163,45 KB

Share Document on Facebook

Similar Documents

Polydisperse spherical cap packings David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin Optimal and near optimal configurations on lattices and manifolds Oberwolfach - August 24, 2012

Polydisperse spherical cap packings David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin Optimal and near optimal configurations on lattices and manifolds Oberwolfach - August 24, 2012

DocID: 1r7Cy - View Document

43  Documenta Math. Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals

43 Documenta Math. Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals

DocID: 1oDwd - View Document

CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs Nadia M. Benbernou∗

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs Nadia M. Benbernou∗

DocID: 1nqkv - View Document

Theorem on Apollonian Circle Packing

Theorem on Apollonian Circle Packing

DocID: 1mu7C - View Document

On the size of the Euclidean sphere of in
uence graph Michael A. Soss School of Computer Science McGill University Montreal, Canada May 14, 1999

On the size of the Euclidean sphere of in uence graph Michael A. Soss School of Computer Science McGill University Montreal, Canada May 14, 1999

DocID: 18rdH - View Document