Related papers: Scaling limit and aging for directed trap models
We study in details the dynamics of the one dimensional symmetric trap model, via a real-space renormalization procedure which becomes exact in the limit of zero temperature. In this limit, the diffusion front in each sample consists in two…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
This article is a presentation of specific recent results describing scaling limits of individual-based models. Thanks to them, we wish to relate the time-scales typical of demographic dynamics and natural selection to the parameters of the…
We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…
Numerical transfer-matrix methods are applied to two-dimensional Ising spin systems, in presence of a confining magnetic field which varies with distance $|{\vec x}|$ to a "trap center", proportionally to $(|{\vec x}|/\ell)^p$, $p>0$. On a…
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…
We prove linear convergence of gradient descent to a global optimum for the training of deep residual networks with constant layer width and smooth activation function. We show that if the trained weights, as a function of the layer index,…
By measuring or calculating coalescence times for several models of coalescence or evolution, with and without selection, we show that the ratios of these coalescence times become universal in the large size limit and we identify a few…
We consider weighted graphs satisfying sub-Gaussian estimate for the natural random walk. On such graphs, we study symmetric Markov chains with heavy tailed jumps. We establish a threshold behavior of such Markov chains when the index…
We study the scaling properties of critical particle systems confined by a potential. Using renormalization-group arguments, we show that their critical behavior can be cast in the form of a trap-size scaling, resembling finite-size scaling…
We establish uniform sub-exponential tail bounds for the width, height and maximal outdegree of critical Bienaym\'e-Galton-Watson trees conditioned on having a large fixed size, whose offspring distribution belongs to the domain of…
We characterize the tail behavior of the distribution of the PageRank of a uniformly chosen vertex in a directed preferential attachment graph and show that it decays as a power law with an explicit exponent that is described in terms of…
We investigate scaling limits of trees built by uniform attachment with freezing, which is a variant of the classical model of random recursive trees introduced in a companion paper. Here vertices are allowed to freeze, and arriving…
In a variety of systems which exhibit aging, the two-time response function scales as $R(t,s)\approx s^{-1-a} f(t/s)$. We argue that dynamical scaling can be extended towards conformal invariance, obtaining thus the explicit form of the…
We consider exponential large deviations estimates for unbounded observables on uniformly expanding dynamical systems. We show that uniform expansion does not imply the existence of a rate function for unbounded observables no matter the…
We provide a framework for proving convergence to the directed landscape, the central object in the Kardar-Parisi-Zhang universality class. For last passage models, we show that compact convergence to the Airy line ensemble implies…
Dynamical scaling and ageing in disordered systems far from equilibrium is reviewed. Particular attention is devoted to the question to what extent a recently introduced generalization of dynamical scaling to local scale-invariance can…
The $\lambda$-biased random walk on a binary tree of depth $n$ is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to…
Scale independence is a ubiquitous feature of complex systems which implies a highly skewed distribution of resources with no characteristic scale. Research has long focused on why systems as varied as protein networks, evolution and stock…
Given a bounded Riemann surface $M$ of finite topological type, we show the existence of a universal and conformally invariant scaling limit for the Temperleyan cycle-rooted spanning forest on any sequence of graphs which approximate $M$ in…