相关论文: The scaling limits of planar LERW in finitely conn…
We study long time behavior of integrated trawl processes introduced by Barndorff-Nielsen. The trawl processes form a class of stationary infinitely divisible processes, described by an infinitely divisible random measure (L\'evy base) and…
We consider radial Loewner evolution driven by unimodular L\'evy processes. We rescale the hulls of the evolution by capacity, and prove that the weak limit of the rescaled hulls exists. We then study a random growth model obtained by…
L\'evy walks are continuous time random walks with spatio-temporal coupling of jump lengths and waiting times, often used to model superdiffusive spreading processes such as animals searching for food, tracer motion in weakly chaotic…
Let R be a hyperbolic Riemann surface with boundary $\partial R$ and suppose that $\gamma:[0,T]\to R\cup\partial R$ is a simple curve growing from the boundary of R. By lifting $R_{t}=R\setminus \gamma(0,t]$ to the universal covering space…
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…
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…
Closed-loop learning is the process of repeatedly estimating a model from data generated from the model itself. It is receiving great attention due to the possibility that large neural network models may, in the future, be primarily trained…
We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…
We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large…
Multiple Schramm-Loewner Evolutions (SLE) are conformally invariant random processes of several curves, whose construction by growth processes relies on partition functions: M\"obius covariant solutions to a system of second order partial…
Continuous limits of discrete systems with long-range interactions are considered. The map of discrete models into continuous medium models is defined. A wide class of long-range interactions that give the fractional equations in the…
Schramm-Loewner Evolutions (SLEs) have proved an efficient way to describe a single continuous random conformally invariant interface in a simply-connected planar domain; the admissible probability distributions are parameterized by a…
Many stochastic time series can be modelled by discrete random walks in which a step of random sign but constant length $\delta x$ is performed after each time interval $\delta t$. In correlated discrete time random walks (CDTRWs), the…
Schramm-Loewner evolution appears as the scaling limit of interfaces in lattice models at critical point. Critical behavior of these models can be described by minimal models of conformal field theory. Certain CFT correlation functions are…
We study a random walk (Markov chain) in an unbounded planar domain whose boundary is described by two curves of the form $x_2 = a^+ x_1^{\beta^+}$ and $x_2 = -a^- x_1^{\beta^-}$, with $x_1 \geq 0$. In the interior of the domain, the random…
We study the transmission of random walkers through a finite-size inhomogeneous material with a quenched, long-range correlated distribution of scatterers. We focus on a finite one-dimensional structure where walkers undergo random…
We simulate several models of random curves in the half plane and numerically compute their stochastic driving process (as given by the Loewner equation). Our models include models whose scaling limit is the Schramm-Loewner evolution (SLE)…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
Continual learning (CL) aims to train models sequentially over multiple domains without forgetting previously learned knowledge. However, existing CL methods optimize for in-domain performance and are therefore prone to learning spurious,…
Let $S = (S(n))$ be a simple random walk on $\mathbb{Z}^{d}$ started at the origin. We study a loop-erasing procedure of $S[0,n]$ that differs from Lawler's chronological loop-erasure. Specifically, we remove loops from $S[0,n]$ in…