Recent Progress on the Random Conductance Model
by Marek Biskup
Publisher: arXiv 2012
Number of pages: 80
Description:
Recent progress on the understanding of the Random Conductance Model is reviewed and commented. A particular emphasis is on the results on the scaling limit of the random walk among random conductances for almost every realization of the environment, observations on the behavior of the effective resistance as well as the scaling limit of certain models of gradient fields with non-convex interactions.
Download or read it online for free here:
Download link
(1.3MB, PDF)
Similar books
![Book cover: Probability Theory and Stochastic Processes with Applications](images/6316.jpg)
by Oliver Knill - Overseas Press
This text covers material of a basic probability course, discrete stochastic processes including Martingale theory, continuous time stochastic processes like Brownian motion and stochastic differential equations, estimation theory, and more.
(12200 views)
![Book cover: Random Graphs and Complex Networks](images/5399.jpg)
by Remco van der Hofstad - Eindhoven University of Technology
These lecture notes are intended to be used for master courses, where the students have a limited prior knowledge of special topics in probability. We have included many of the preliminaries, such as convergence of random variables, etc.
(10778 views)
![Book cover: Probability: Theory and Examples](images/5103.jpg)
by Rick Durrett - Cambridge University Press
An introduction to probability theory covering laws of large numbers, central limit theorems, random walks, martingales, Markov chains, ergodic theorems, and Brownian motion. It concentrates on the results that are the most useful for applications.
(15112 views)
![Book cover: Probability on Trees and Networks](images/11323.jpg)
by Russell Lyons, Yuval Peres - Cambridge University Press
This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.
(6247 views)