2 results
Search Results
Now showing 1 - 2 of 2
- ItemLocalization of the principal Dirichlet eigenvector in the heavy-tailed random conductance model([Madralin] : EMIS ELibEMS, 2018) Flegel, FranziskaWe study the asymptotic behavior of the principal eigenvector and eigenvalue of the random conductance Laplacian in a large domain of Zd (d≥2) with zero Dirichlet condition. We assume that the conductances w are positive i.i.d. random variables, which fulfill certain regularity assumptions near zero. If γ=sup{q≥0:E[w−q]<∞}<1/4, then we show that for almost every environment the principal Dirichlet eigenvector asymptotically concentrates in a single site and the corresponding eigenvalue scales subdiffusively. The threshold γc=1/4 is sharp. Indeed, other recent results imply that for γ>1/4 the top of the Dirichlet spectrum homogenizes. Our proofs are based on a spatial extreme value analysis of the local speed measure, Borel-Cantelli arguments, the Rayleigh-Ritz formula, results from percolation theory, and path arguments.
- ItemPhase transitions for chase-escape models on Poisson–Gilbert graphs([Madralin] : EMIS ELibEMS, 2020) Hinsen, Alexander; Jahnel, Benedikt; Cali, Elie; Wary, Jean-PhilippeWe present results on phase transitions of local and global survival in a two-species model on Poisson–Gilbert graphs. Initially, there is an infection at the origin that propagates on the graph according to a continuous-time nearest-neighbor interacting particle system. The graph consists of susceptible nodes and nodes of a second type, which we call white knights. The infection can spread on susceptible nodes without restriction. If the infection reaches a white knight, this white knight starts to spread on the set of infected nodes according to the same mechanism, with a potentially different rate, giving rise to a competition of chase and escape. We show well-definedness of the model, isolate regimes of global survival and extinction of the infection and present estimates on local survival. The proofs rest on comparisons to the process on trees, percolation arguments and finite-degree approximations of the underlying random graphs.