Related papers: Asymptotic behaviour of fast diffusions on graphs
A sheet of glassy polymers placed in a solvent shows swelling behaviors quite different from that of soft polymers (rubbers and gels). (1) Non-Fickian diffusion (called case II diffusion): As solvent permeates into the sample, a sharp front…
On a smooth bounded Euclidean domain, Sobolev-subcritical fast diffusion with vanishing boundary trace is known to lead to finite-time extinction, with a vanishing profile selected by the initial datum. In rescaled variables, we quantify…
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
We study various combinations of active diffusion with branching, as an extension of standard reaction-diffusion processes. We concentrate on the selection of the asymptotic wavefront speed for thermal run-and-tumble and for thermal active…
In this paper, we study large-time asymptotics for heat and fractional heat equations in two discrete settings: the full lattice \(\mathbb Z^d\) and finite connected subgraphs with Dirichlet boundary condition. These results provide a…
Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…
We establish the short-time asymptotic behaviour of the Markovian semigroups associated with strongly local Dirichlet forms under very general hypotheses. Our results apply to a wide class of strongly elliptic, subelliptic and degenerate…
Graph-based semi-supervised learning usually involves two separate stages, constructing an affinity graph and then propagating labels for transductive inference on the graph. It is suboptimal to solve them independently, as the correlation…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
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$. At the beginning of each time…
We study small perturbations of diffusion processes in $\mathbb{R}^d$ that leave invariant a finite collection of hypersurfaces. Each surface is assumed to be repelling for the unperturbed process, and the unperturbed motion on each of the…
We study the persistent random walk of photons on a one-dimensional lattice of random transmittances. Transmittances at different sites are assumed independent, distributed according to a given probability density $f(t)$. Depending on the…
We establish a new property of Fisher-KPP type propagation in a plane, in the presence of a line with fast diffusion. We prove that the line enhances the asymptotic speed of propagation in a cone of directions. Past the critical angle given…
An effective surface equation, that encapsulates the detail of a microstructure, is developed to model microstructured surfaces. The equations deduced accurately reproduce a key feature of surface wave phenomena, created by periodic…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or inactive. We assume that to each node is assigned a…
A new approach to the modeling of nonfree particle diffusion is presented. The approach uses a general setup based on geometric graphs (networks of curves), which means that particle diffusion in anything from arrays of barriers and pore…
Diffusion kernels over graphs have been widely utilized as effective tools in various applications due to their ability to accurately model the flow of information through nodes and edges. However, there is a notable gap in the literature…
Using techniques of the theory of semigroups of linear operators we study the question of approximating solutions to equations governing diffusion in thin layers separated by a semi-permeable membrane. We show that as thickness of the…
We consider time-dependent convection-diffusion problems with high P\'eclet number of order $\mathcal{O}(\varepsilon^{-1})$ in thin three-dimensional graph-like networks consisting of cylinders that are interconnected by small domains…