English
Related papers

Related papers: Scaling limit and aging for directed trap models

200 papers

Can one hear the 'sound' of a growing network? We address the problem of recognizing the topology of evolving biological or social networks. Starting from percolation theory, we analytically prove a linear inverse relationship between two…

Quantitative Methods · Quantitative Biology 2014-04-10 Ashish Bhan , Animesh Ray

We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We show that the system of particles, rescaled in an appropriate way, converges in distribution to a scaling limit…

Probability · Mathematics 2016-05-02 Marcel Ortgiese , Matthew I. Roberts

Computing moments of various parameter estimators related to an autoregressive model of Statistics, one needs to evaluate several non-trivial limits. This was done by arXiv:1506.03131 for the case of two, three and four dimensions; in this…

Statistics Theory · Mathematics 2019-08-02 Jan Vrbik

We argue that symmetries and conservation laws greatly restrict the form of the terms entering the long wavelength description of growth models exhibiting anomalous roughening. This is exploited to show by dynamic renormalization group…

Statistical Mechanics · Physics 2009-11-11 Juan M. López , Mario Castro , Rafael Gallego

We study directed last-passage percolation on the planar square lattice whose weights have general distributions, or equivalently, queues in series with general service distributions. Each row of the last passage model has its own randomly…

Probability · Mathematics 2011-08-30 Hao Lin

A generalised form of time-translation-invariance permits to re-derive the known generic phenomenology of ageing, which arises in classical many-body systems after a quench from an initially disordered system to a temperature $T\leq T_c$,…

Statistical Mechanics · Physics 2025-05-30 Malte Henkel

Bifurcations are one of the most remarkable features of dynamical systems. Corral et al. [Sci. Rep. 8(11783), 2018] showed the existence of scaling laws describing the transient (finite-time) dynamics in discrete dynamical systems close to…

Statistical Mechanics · Physics 2024-05-31 Alvaro Corral

We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree…

Probability · Mathematics 2014-11-17 Konstantinos Panagiotou , Benedikt Stufler , Kerstin Weller

Consider the upper tail probability that the homomorphism count of a fixed graph $H$ within a large sparse random graph $G_n$ exceeds its expected value by a fixed factor $1+\delta$. Going beyond the Erd\H{o}s-R\'enyi model, we establish…

Probability · Mathematics 2021-02-01 Sohom Bhattacharya , Amir Dembo

We extend the standard droplet scaling theory for isothermal aging in spin glasses assuming that the effective stiffness constant of droplets as large as extended defects is vanishingly small. A novel dynamical order parameter and the…

Disordered Systems and Neural Networks · Physics 2007-05-23 Hajime Yoshino , Koji Hukushima , Hajime Takayama

We consider a general class of preferential attachment schemes evolving by a reinforcement rule with respect to certain sublinear weights. In these schemes, which grow a random network, the sequence of degree distributions is an object of…

Probability · Mathematics 2014-02-19 Jihyeok Choi , Sunder Sethuraman , Shankar C. Venkataramani

We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…

Disordered Systems and Neural Networks · Physics 2015-05-13 A. C. C. Coolen , A. De Martino , A. Annibale

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Combinatorics · Mathematics 2016-01-22 Lucas Hosseini , Patrice Ossona de Mendez

Average-case analysis computes the complexity of an algorithm averaged over all possible inputs. Compared to worst-case analysis, it is more representative of the typical behavior of an algorithm, but remains largely unexplored in…

Optimization and Control · Mathematics 2021-10-05 Courtney Paquette , Bart van Merriënboer , Elliot Paquette , Fabian Pedregosa

In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…

Probability · Mathematics 2026-01-14 Adam Bowditch

Localized growth in driven materials is often governed by intermittent failure, yet how a material's history biases failure sites remains poorly understood. Using pause-restart experiments on chemical precipitate membranes, we quantify the…

Pattern Formation and Solitons · Physics 2026-02-10 Amari Morris , Oliver Steinbock

We consider passive scalar convected by multi-scale random velocity field with short yet finite temporal correlations. Taking Kraichnan's limit of a white Gaussian velocity as a zero approximation we develop perturbation theory with respect…

chao-dyn · Physics 2009-10-28 M. Chertkov , G. Falkovich , V. Lebedev

Kraichnan's model of passive scalar advection in which the driving velocity field has fast temporal decorrelation is studied as a case model for understanding the appearance of anomalous scaling in turbulent systems. We demonstrate how the…

chao-dyn · Physics 2016-08-31 A. Fairhall , O. Gat , V. S. L'vov , I. Procaccia

The problem of designing adaptive stepsize sequences for the gradient descent method applied to convex and locally smooth functions is studied. We take an adaptive control perspective and design update rules for the stepsize that make use…

Optimization and Control · Mathematics 2025-08-27 Andrea Iannelli

We consider uniform spanning tree (UST) in topological polygons with $2N$ marked points on the boundary with alternating boundary conditions. In [LPW21], the authors derive the scaling limit of the Peano curve in the UST. They are variants…

Probability · Mathematics 2021-08-25 Mingchang Liu , Hao Wu