1984
DOI: 10.1007/bf01224830
|View full text |Cite
|
Sign up to set email alerts
|

Study of the iterations of a mapping associated to a spin glass model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

5
64
0

Year Published

1985
1985
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(69 citation statements)
references
References 0 publications
5
64
0
Order By: Relevance
“…Let us mention that we also establish almost sure convergence of R n toward 1 when we are able to find γ ∈ (0, 1) and What one should expect at criticality is rather unclear to us (see however [23] for a number of predictions and numerical results on hierarchical pinning and also [6,7] for some theoretical considerations on a different class of hierarchical models).…”
Section: 5mentioning
confidence: 99%
See 1 more Smart Citation
“…Let us mention that we also establish almost sure convergence of R n toward 1 when we are able to find γ ∈ (0, 1) and What one should expect at criticality is rather unclear to us (see however [23] for a number of predictions and numerical results on hierarchical pinning and also [6,7] for some theoretical considerations on a different class of hierarchical models).…”
Section: 5mentioning
confidence: 99%
“…Pinning models: the role of disorder. Hierarchical models on diamond lattices, homogeneous or disordered [5,4,6,7,9], are a powerful tool in the study of the critical behavior of statistical mechanics models, especially because real-space renormalization group transformationsà la Migdal-Kadanoff are exact in this case. In most of the cases, hierarchical models are introduced in association with a more realistic non-hierarchical one.…”
Section: 5mentioning
confidence: 99%
“…When the support of µ 0 is included in N, this question was previously answered by Collet et al [6]. By a careful study of the recursion equation for the generating functions of µ n , they proved that…”
Section: The Discrete-time Derrida-retaux Modelmentioning
confidence: 94%
“…where, for any x ∈ R, x + := max(x, 0), X n denotes an independent copy of X n , and (d) = stands for the identity in distribution. Note that this model was previously studied by Collet, Eckmann, Glaser and Martin [6] for random variables taking integer values. Through studying the sequence of probability-generating functions, they identified the critical manifold of (X n ), provided that X 0 ∈ N a.s. With renormalization group arguments, Derrida and Retaux studied this max-type recursive equation for real-valued random variables.…”
Section: Introductionmentioning
confidence: 99%
“…(note that we do not require f to be normalized). This time evolution was introduced [11] to analyze a simple renormalization problem [7,8,11] which can be formulated as follows. Given a distribution P (X 0 ) of a positive random variable X 0 , what can be said on the distribution of the random variable X n constructed through the following recursion X n = max X (1) n−1 + X (2) n−1 − 1, 0…”
Section: Introductionmentioning
confidence: 99%