Related papers: Sticky diffusions on graphs
We investigate fast diffusions on finite directed graphs. We prove results in a way dual to presented in Bobrowski, A. Ann. Henri Poincar\'e (2012) 13(6): 1501-1510 and Bobrowski, A., Morawska, K. DCDS-B (2012), 17(7): 2313-2327, and obtain…
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…
We investigate continuous diffusions on star graphs with sticky behavior at the vertex. These are Markov processes with continuous paths having a positive occupation time at the vertex. We characterize sticky diffusions as time-changed…
This work discusses the homogenization analysis for diffusion processes on scale-free metric graphs, using weak variational formulations. The oscillations of the diffusion coefficient along the edges of a metric graph induce internal…
We use analytical methods to construct the two-parameter Feller semigroup associated with a Markov process on a line with a moving membrane such that at the points on both sides of the membrane it coincides with the ordinary diffusion…
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…
The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these…
We consider consistent diffusion dynamics, leaving the celebrated Hua-Pickrell measures, depending on a complex parameter $s$, invariant. These, give rise to Feller-Markov processes on the infinite dimensional boundary $\Omega$ of the…
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…
Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random…
We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…
Diffusion models achieve state-of-the-art performance in generating realistic objects and have been successfully applied to images, text, and videos. Recent work has shown that diffusion can also be defined on graphs, including graph…
We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step,…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…
We establish the representation of general regular diffusions on star-shaped graphs as time-changed Walsh Brownian motions. These are regular continuous Markov processes described locally by a family generalized second order differential…
The asymptotic study of percolation on finite transitive graphs is considered. Several questions and very few answers regarding percolation on finite graphs are presented.
We study a variant of the chip-firing game called \emph{diffusion}. In diffusion on a graph, each vertex of the graph is initially labelled with an integer interpreted as the number of chips at that vertex, and at each subsequent step, each…
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 diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…