• Aucun résultat trouvé

[PDF] Top 20 Two critical localization lengths in the Anderson transition on random graphs

Has 10000 "Two critical localization lengths in the Anderson transition on random graphs" found on our website. Below are the top 20 most common "Two critical localization lengths in the Anderson transition on random graphs".

Two critical localization lengths in the Anderson transition on random graphs

Two critical localization lengths in the Anderson transition on random graphs

... of the nonergodic properties of wave functions on random graphs without boundary in the localized and critical regimes of the Anderson ...by two ... Voir le document complet

7

Complexity of two-dimensional quasimodes at the transition from weak scattering to Anderson localization

Complexity of two-dimensional quasimodes at the transition from weak scattering to Anderson localization

... of the quasimodes of open 2D random sys- tems ranging from weakly scattering to strongly localized in terms of their spatial extension but also for the first time in this context ... Voir le document complet

6

Localization Transition for Polymers in Poissonian Medium

Localization Transition for Polymers in Poissonian Medium

... of the present paper is to study the joint effect of the density and the strength of inhomogeneities, ...i.e., the influence of the intensity parameter ν and of the ... Voir le document complet

32

Critical properties of the Anderson localization transition and the high dimensional limit

Critical properties of the Anderson localization transition and the high dimensional limit

... around the Bethe lattice. In usual phase transitions two different expansions have been developed in order to describe the critical properties: one around the upper and ... Voir le document complet

18

Anderson Localization in high dimensional lattices

Anderson Localization in high dimensional lattices

... activation. The question remained un- solved until the work of Basko, Aleiner and Altshuler [ 48 ] in 2006: the authors showed that, if the temperature is finite but small enough, ... Voir le document complet

197

Vertex pursuit in random directed acyclic graphs

Vertex pursuit in random directed acyclic graphs

... is the greens’ turn, and they choose some non-protected, non-contaminated nodes to ...rounds the sludge moves a non-protected node that is adjacent (that is, downhill) to the node the sludge ... Voir le document complet

28

Cliques in high-dimensional random geometric graphs

Cliques in high-dimensional random geometric graphs

... B.: Random Graphs, Cambridge University press ...H.: The probabilistic method, John Wiley & Sons ...spreading in random geo- metric networks. In Proceedings of the 48h ... Voir le document complet

11

Cliques in high-dimensional random geometric graphs

Cliques in high-dimensional random geometric graphs

... ). In this model, the edges between vertices appear independently with equal ...as the community ...problems: the Barabási–Albert model (see Albert and Barabási 2002 , 1999 ; Fronczak et ...), ... Voir le document complet

25

On the small-time local controllability of a KdV system for critical lengths

On the small-time local controllability of a KdV system for critical lengths

... of the solution y 1 and applying Paley-Wiener’s theorem. Surprisingly, in the case 2k + l 6= 3N ∗ , if the time T is sufficiently small, there are directions in M which cannot be ... Voir le document complet

52

THE SET CHROMATIC NUMBER OF RANDOM GRAPHS

THE SET CHROMATIC NUMBER OF RANDOM GRAPHS

... s. In this case, µ is larger than before but, unfortunately, ∆ grows faster than µ (as t grows) and eventually becomes larger than ...µ. In order to avoid this undesired situation, we make the ... Voir le document complet

15

Random walks in random environment on Z:<br />localization studies in the recurrent and transient cases

Random walks in random environment on Z:<br />localization studies in the recurrent and transient cases

... One-dimensional random walks in random environment to the nearest neighbors have been introduced in the sixties in order to give a model of DNA ...revival in view ... Voir le document complet

147

Direct observation of Anderson localization of matter-waves in a controlled disorder

Direct observation of Anderson localization of matter-waves in a controlled disorder

... that localization results from many quantum reflections of small amplitude; ii) atomic density small enough that interactions are ...directly the atomic density profiles vs time, and find that weak disorder ... Voir le document complet

6

On Minimum Connecting Transition Sets in Graphs

On Minimum Connecting Transition Sets in Graphs

... on the number n of vertices of G that at least n − 2 transitions are necessary to connect ...connecting transition set of ...be two vertices from different connected components of G − {u, ...b ... Voir le document complet

15

Composite pairing in a mixed-valent two-channel Anderson model

Composite pairing in a mixed-valent two-channel Anderson model

... a two-channel Anderson model, we develop a theory of composite pairing in the 115 family of heavy fermion superconductors that incorporates the effects of f -electron valence ...of ... Voir le document complet

12

Disorder-induced trapping versus Anderson localization in Bose-Einstein condensates expanding in disordered potentials

Disorder-induced trapping versus Anderson localization in Bose-Einstein condensates expanding in disordered potentials

... of the recent progress in cooling and trapping of neutral atoms [35, 36, ...37]. In addition, controlled potentials with no defects, for instance periodic potentials (optical lattices), can be ... Voir le document complet

32

Metric dimension for random graphs

Metric dimension for random graphs

... the event that v ∈ S(x, i + ...thus the first and more important error term of Lemma ...since the Ax’s (x ∈ R) are positively correlated (the fact that there is at least one edge from v to S(x ... Voir le document complet

20

Revolutionaries and spies on random graphs

Revolutionaries and spies on random graphs

... sparser graphs, some bounds are provided. 1. Introduction In the past few years, several problems from applications related to the structure of modern networks in the real-world ... Voir le document complet

17

The continuous Anderson hamiltonian in d≤3

The continuous Anderson hamiltonian in d≤3

... ] in dimension 2 and under periodic boundary ...to the limiting operator, they adopted the theory of paracontrolled distri- butions of Gubinelli, Imkeller and Perkowski [ GIP15 ...that the ... Voir le document complet

38

The self-dual point of the two-dimensional random-cluster model is critical for $q\geq 1$

The self-dual point of the two-dimensional random-cluster model is critical for $q\geq 1$

... of the critical point was previously known in three ...1, the model is simply bond percolation, proved by Kesten in 1980 [23] to be critical at p c (1) = ...2, the ... Voir le document complet

28

On the largest component of subcritical random hyperbolic graphs

On the largest component of subcritical random hyperbolic graphs

... with the seminal work of [KPK + 10], further aspects of random hyperbolic graphs have been discussed since then: the power law degree distribution, mean degree and clustering coefficient were ... Voir le document complet

16

Show all 10000 documents...