<--- Back to Details
First PageDocument Content
Randomness / Random matrix / Random graph / Asymptotic analysis / Point process / Bangalore / Gaussian random field / Statistics / Stochastic processes / Markov chain
Date: 2013-01-07 23:14:00
Randomness
Random matrix
Random graph
Asymptotic analysis
Point process
Bangalore
Gaussian random field
Statistics
Stochastic processes
Markov chain

NATIONAL MATHEMATICS INITIATIVE (NMI) 9th Thematic Programme (August 2012 – PROBABILITY: THEORY AND APPLICATIONS

Add to Reading List

Source URL: math.iisc.ernet.in

Download Document from Source Website

File Size: 1,11 MB

Share Document on Facebook

Similar Documents

FIRST PASSAGE PERCOLATION ON A HYPERBOLIC GRAPH ADMITS BI-INFINITE GEODESICS ITAI BENJAMINI AND ROMAIN TESSERA Abstract. Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d.

FIRST PASSAGE PERCOLATION ON A HYPERBOLIC GRAPH ADMITS BI-INFINITE GEODESICS ITAI BENJAMINI AND ROMAIN TESSERA Abstract. Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d.

DocID: 1xUgC - View Document

RANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK CDAM Research report LSE-CDAMAbstract. We study random subgraphs of the 2-dimensional Hamming graph H

RANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK CDAM Research report LSE-CDAMAbstract. We study random subgraphs of the 2-dimensional Hamming graph H

DocID: 1uXax - View Document

CDAM research report LSE-CDAMRANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK Abstract. We study random subgraphs of the 2-dimensional Hamming graph H

CDAM research report LSE-CDAMRANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK Abstract. We study random subgraphs of the 2-dimensional Hamming graph H

DocID: 1uNj5 - View Document

Random Matrices and graph counting Ken McLaughlin Random Matrices and Combinatorics

Random Matrices and graph counting Ken McLaughlin Random Matrices and Combinatorics

DocID: 1u66k - View Document

CDAM research report LSE-CDAMA NEW APPROACH TO THE GIANT COMPONENT PROBLEM SVANTE JANSON AND MALWINA J. LUCZAK Abstract. We study the largest component of a random (multi)graph on n vertices with a given degree

CDAM research report LSE-CDAMA NEW APPROACH TO THE GIANT COMPONENT PROBLEM SVANTE JANSON AND MALWINA J. LUCZAK Abstract. We study the largest component of a random (multi)graph on n vertices with a given degree

DocID: 1tZeJ - View Document