Related papers: Asymptotic behaviour of fast diffusions on graphs
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
We investigate dynamically and statistically diffusive motion in a Klein-Gordon particle chain in the presence of disorder. In particular, we examine a low energy (subdiffusive) and a higher energy (self-trapping) case and verify that…
A steady-state convection-diffusion problem with a small diffusion of order $\mathcal{O}(\varepsilon)$ is considered in a thin three-dimensional graph-like junction consisting of thin cylinders connected through a domain (node) of diameter…
We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
Self-diffusion in a two-dimensional simple fluid is investigated by both analytical and numerical means. We investigate the anomalous aspects of self-diffusion in two-dimensional fluids with regards to the mean square displacement, the…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
We study the asymptotic behaviour of a real-valued diffusion whose non-regular drift is given as a sum of a dissipative term and a bounded measurable one. We prove that two trajectories of that diffusion converge a.s. to one another at an…
We obtain new estimates for the solution of both the porous medium and the fast diffusion equations by studying the evolution of suitable Lipschitz norms. Our results include instantaneous regularization for all positive times, long-time…
We describe the asymptotic behaviour of large degrees in random hyperbolic graphs, for all values of the curvature parameter $ \alpha$. We prove that, with high probability, the node degrees satisfy the following ordering property: the…
We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the…
Two similar Minkowskian diffusions have been considered, on one hand by Barbachoux, Debbasch, Malik and Rivet ([BDR1], [BDR2], [BDR3], [DMR], [DR]), and on the other hand by Dunkel and H\"anggi ([DH1], [DH2]). We address here two questions,…
Using pointwise semigroup techniques, we establish sharp rates of decay in space and time of a perturbed reaction diffusion front to its time-asymptotic limit. This recovers results of Sattinger, Henry and others of time-exponential…
Diffusing a graph signal at multiple scales requires computing the action of the exponential of several multiples of the Laplacian matrix. We tighten a bound on the approximation error of truncated Chebyshev polynomial approximations of the…
We investigate stochastic reaction-diffusion equations on finite metric graphs. On each edge in the graph a multiplicative cylindrical Gaussian noise driven reaction-diffusion equation is given. The vertex conditions are the standard…
We consider a reaction-diffusion system for two densities lying in adjacent domains of $\mathbb{R}^N$. We treat two configurations: either a cylinder and its complement, or two half-spaces. Diffusion and reaction heterogeneities for the two…
We consider the random evolution described by the motion of a particle moving on a circle alternating the angular velocities $ \pm c $ and changing rotation at Poisson random times, resulting in a telegraph process over the circle. We study…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…
We study how far a diffusion process on a graph can deviate from a designed starting pattern when the pattern is generated via Laplacian regularisation. Under standard stability conditions for undirected, entrywise nonnegative graphs, we…