DISLOCATION RELAXATION IN A RANDOM ARRAY OF SOLUTES

1981 ◽  
Vol 42 (C5) ◽  
pp. C5-319-C5-324 ◽  
Author(s):  
I. G. Ritchie ◽  
A. Atrens ◽  
C. B. So ◽  
K. W. Sprungmann
Keyword(s):  
Psychology ◽  
2015 ◽  
Vol 06 (14) ◽  
pp. 1873-1878 ◽  
Author(s):  
Ryotaro Saito ◽  
Yoshifumi Ikeda ◽  
Hideyuki Okuzumi ◽  
Iwao Kobayashi ◽  
Mitsuru Kokubun

1992 ◽  
Vol 41 (12) ◽  
pp. 1955
Author(s):  
ZHONG XI-HUA ◽  
ZHU YA-FEN

1988 ◽  
Vol 191 (-1) ◽  
pp. 373 ◽  
Author(s):  
Kalvis M. Jansons ◽  
E. R. Johnson

2013 ◽  
Vol 50 (03) ◽  
pp. 861-870 ◽  
Author(s):  
Justin Salez

We study the array of point-to-point distances in random regular graphs equipped with exponential edge lengths. We consider the regime where the degree is kept fixed while the number of vertices tends to ∞. The marginal distribution of an individual entry is now well understood, thanks to the work of Bhamidi, van der Hofstad and Hooghiemstra (2010). The purpose of this note is to show that the whole array, suitably recentered, converges in the weak sense to an explicit infinite random array. Our proof consists in analyzing the invasion of the network by several mutually exclusive flows emanating from different sources and propagating simultaneously along the edges.


2010 ◽  
Vol 375 (2-3) ◽  
pp. 540-547 ◽  
Author(s):  
Thomas Franosch ◽  
Felix Höfling ◽  
Teresa Bauer ◽  
Erwin Frey

Author(s):  
Keiko Munechika ◽  
Stefano Cabrini ◽  
Weilun Chao ◽  
Ian Lacey ◽  
Carlos Pina-Hernandez ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document