Related papers: Sticky diffusions on graphs
We study graphs whose vertex degree tends and which are, therefore, called rapidly branching. We prove spectral estimates, discreteness of spectrum, first order eigenvalue and Weyl asymptotics solely in terms of the vertex degree growth.…
We discuss the diffusion phenomenon in the parabolic and hyperbolic regimes. New effects related to the finite velocity of the diffusion process are predicted, that can partially explain the strange behavior associated to adsorption…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We analyze the asymptotic behavior of general first order Laplacian processes on digraphs. The most important ones of these are diffusion and consensus with both continuous and discrete time. We treat diffusion and consensus as dual…
We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways in which diffusion in scale-free graphs is special. Most…
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…
The Feller property concerns the preservation of the space of functions vanishing at infinity by the semigroup generated by an operator. We study this property in the case of the Laplacian on infinite graphs with arbitrary edge weights and…
Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. Although diffusion models have achieved notable success in graph generation recently, they are…
In recent papers it has been demonstrated that sampling a Gibbs distribution from an appropriate time-irreversible Langevin process is, from several points of view, advantageous when compared to sampling from a time-reversible one. Adding…
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…
Diffusion-coagulation can be simply described by a dynamic where particles perform a random walk on a lattice and coalesce with probability unity when meeting on the same site. Such processes display non-equilibrium properties with strong…
This paper is devoted to the study of travelling fronts of reaction-diffusion equations with periodic advection in the whole plane $\mathbb R^2$. We are interested in curved fronts satisfying some "conical" conditions at infinity. We prove…
In Cao, Du, Li and Li [8], a nonlocal diffusion model with free boundaries extending the local diffusion model of Du and Lin [12] was introduced and studied. For Fisher-KPP type nonlinearities, its long-time dynamical behaviour is shown to…
We study the asymptotic behaviour of the partial density function associated to sections of a positive hermitian line bundle that vanish to a particular order along a fixed divisor $Y$. Assuming the data in question is invariant under an…
We give a Dirichlet form approach for the construction of distorted Brownian motion in a bounded domain $\Omega$ of $\mathbb{R}^d$, $d \geq 1$, with boundary $\Gamma$, where the behavior at the boundary is sticky. The construction covers…
We consider graph diffusion processes constructed from finite i.i.d. samples drawn from an unknown manifold embedded in ambient Euclidean space, where the graph affinity is defined by an ambient Gaussian kernel matrix. We show that the…
For low to moderate supersaturations, crystals grow by lateral build-up of new layers. The edges of the layers are known as "steps". We consider the rate of step advance on a flat crystal face under the influence of bulk diffusion in the…
We introduce an algorithmic model of heat conduction, the thermodynamic graph. The thermodynamic graph is analogous to meshes in the finite difference method in the sense that the calculation of temperature is carried out at the vertices of…
A new diffuse interface model for a two-phase flow of two incompressible fluids with different densities is introduced using methods from rational continuum mechanics. The model fulfills local and global dissipation inequalities and is…