zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On the scaling of the chemical distance in long-range percolation models. (English) Zbl 1072.60084
The paper deals with long-range percolation on d where two sites x and y get connected with probability p xy =|x-y| -s+o(1) as |x-y|. The interest focuses on the scaling of the graph distance (or chemical distance) between two remote sites. The introduction gives an overview of previous works concerning the five distinct regimes marked by the position of s relative to d and 2d and discusses the relationship with the so-called “small-world” phenomena. The main result of the paper is a proof of a polylogarithmic estimation on the asymptotic behavior of the graph distance when d<s<2d and the random graph contains a unique infinite component. The study of percolation in finite boxes is an essential tool for the proof.
MSC:
60K35Interacting random processes; statistical mechanics type models; percolation theory
82B43Percolation (equilibrium statistical mechanics)
82B28Renormalization group methods (equilibrium statistical mechanics)