TBan-I: Difference between revisions

From Disordered Systems Wiki
Jump to navigation Jump to search
Line 1: Line 1:
=Detour: Extreme Value Statistics=
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=




Line 7: Line 14:
<center><math> \overline{n(x)} = \sum_k k \, \text{Prob}[n(x) = k] </math></center>
<center><math> \overline{n(x)} = \sum_k k \, \text{Prob}[n(x) = k] </math></center>


''' The Final goal'''
is to show that:
<center><math> \overline{n(x)}  = \left(e^{x/b_M}-1\right) </math></center>


The key relation for this quantity is:
The key relation for this quantity is:

Revision as of 11:47, 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, n(x) is defined as the number of random variables above the minimum Emin such that their value is smaller than Emin+x. This quantity is a random variable, and we are interested in its average value:

n(x)=kkProb[n(x)=k]

The Final goal is to show that:

n(x)=(ex/bM1)

The key relation for this quantity is:

Prob[n(x)=k]=M(M1k)dEp(E)[P(E+x)P(E)]k(1P(E+x))Mk1

We use the following identity to sum over k:

k=0M1k(M1k)(AB)kBM1k=(AB)ddAk=0M1(M1k)(AB)kBM1k=(M1)(AB)AM2