[图书][B] What is percolation?

G Grimmett, G Grimmett - 1999 - Springer
Suppose we immerse a large porous stone in a bucket of water. What is the probability that
the centre of the stone is wetted? In formulating a simple stochastic model for such a …

Percolation and disordered systems

E Giné, GR Grimmett, L Saloff-Coste… - Lectures on Probability …, 1997 - Springer
This course aims to be a (nearly) self-contained account of part of the mathematical theory of
percolation and related topics. The first nine chapters summarise rigorous results in …

[PS][PS] Lectures on Glauber dynamics for discrete spin models

F Martinelli - Lectures on probability theory and statistics …, 1999 - kleine.mat.uniroma3.it
These notes have been the subject of a course I gave in the summer 1997 for the school in
probability theory in Saint Flour. I review in a self {contained way the state of the art …

[图书][B] Statistical mechanics of disordered systems: a mathematical perspective

A Bovier - 2006 - books.google.com
This self-contained book is a graduate-level introduction for mathematicians and for
physicists interested in the mathematical foundations of the field, and can be used as a …

The random geometry of equilibrium phases

HO Georgii, O Häggström, C Maes - Phase transitions and critical …, 2001 - Elsevier
Publisher Summary This chapter discusses the random geometry of equilibrium phases.
Percolation will come into play here on various levels. Its concepts like clusters, open paths …

Introduction to the theory of Gibbs point processes

D Dereudre - Stochastic Geometry: Modern Research Frontiers, 2019 - Springer
The Gibbs point processes (GPP) constitute a large class of point processes with interaction
between the points. The interaction can be attractive, repulsive, depending on geometrical …

Randomly coloring sparse random graphs with fewer colors than the maximum degree

M Dyer, AD Flaxman, AM Frieze… - Random Structures & …, 2006 - Wiley Online Library
We analyze Markov chains for generating a random k‐coloring of a random graph Gn, d/n.
When the average degree d is constant, a random graph has maximum degree Θ (log n/log …

Perfect simulation

ML Huber - Monographs on Statistics and Applied Probability, 2016 - api.taylorfrancis.com
Suppose a new deck of cards is shuffled. Then as the number of shuffles grows, the
distribution of the deck becomes closer and closer to uniform over the set of permutations of …

[HTML][HTML] Perfect simulation for interacting point processes, loss networks and Ising models

PA Ferrari, R Fernández, NL Garcia - Stochastic Processes and their …, 2002 - Elsevier
We present a perfect simulation algorithm for measures that are absolutely continuous with
respect to some Poisson process and can be obtained as invariant measures of birth-and …

Concentration inequalities for random fields via coupling

JR Chazottes, P Collet, C Külske, F Redig - Probability Theory and Related …, 2007 - Springer
We present a new and simple approach to concentration inequalities in the context of
dependent random processes and random fields. Our method is based on coupling and …