TBan-I: Difference between revisions

From Disordered Systems Wiki
Jump to navigation Jump to search
Line 19: Line 19:


<center><math> \text{Prob}[n(x)=k] = M \binom{M-1}{k} \int_{-\infty}^\infty dE \; p(E)\,[P(E+x)-P(E)]^{k}\,[1-P(E+x)]^{M-k-1} </math></center>
<center><math> \text{Prob}[n(x)=k] = M \binom{M-1}{k} \int_{-\infty}^\infty dE \; p(E)\,[P(E+x)-P(E)]^{k}\,[1-P(E+x)]^{M-k-1} </math></center>
 
To compute <math>\overline{n(x)}</math>, you must sum over <math>k</math>.
Use the identity


The starting point is the definition of the key quantity  
The starting point is the definition of the key quantity  

Revision as of 11:57, 31 August 2025

Nei seguente esercizio useremo le notazioni della statistica dei valori estremi usate nel corso.

exercise 1: La distribuzione di Gumbel

esercizio 2: The weakest link

Exercise 3: number of states above the minimum

Definition of n(x):Given a realization of the random energies E1,E2,…,EM, define

n(x)=#{i∣Emin<Ei<Emin+x}

that is, the number of random variables lying above the minimum

Emin

but less than

Emin+x

. This is itself a random variable. We are interested in its mean value:

n(x)‾=∑k=0M−1kProb[n(x)=k]

The Final goal is to show that for large 'M', when the extremes are described by the Gumbel distribution :

n(x)‾=ex/bM−1

Step 1: Exact manipulations

Prob[n(x)=k]=M(M−1k)∫−∞∞dEp(E)[P(E+x)−P(E)]k[1−P(E+x)]M−k−1

To compute n(x)‾, you must sum over k. Use the identity

The starting point is the definition of the key quantity

Prob[n(x)=k]=M(M−1k)∫−∞∞dEp(E)[P(E+x)−P(E)]k(1−P(E+x))M−k−1

Use the following identity to sum over k:

∑k=0M−1k(M−1k)(A−B)kBM−1−k=(A−B)ddA∑k=0M−1(M−1k)(A−B)kBM−1−k=(M−1)(A−B)AM−2

to arrive at the form:

n(x)‾=M(M−1)∫−∞∞dEp(E)[P(E+x)−P(E)](1−P(E))M−2=M∫−∞∞dE[P(E+x)−P(E)]dQM−1(E)dE


Step 2: the Gumbel limit So far, no approximations have been made. To proceed, we use QM−1(E)≈QM(E) and its asymptotics Gumbel form: