Related papers: Asymptotic behaviour of fast diffusions on graphs
We consider time-changed diffusions driven by generators with discontinuous coefficients. The PDE's connections are investigated and in particular some results on the asymptotic analysis according to the behaviour of the coefficients are…
The spread of a connected graph G was introduced by Alon, Boppana and Spencer (1998) and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V(G) of the variance of f(X) when X is…
In a recent paper, Michael J. Saxton proposes to interpret as anomalous diffusion the occurrence of apparent transient sub-diffusive regimes in mean-squared displacements (MSD) plots, calculated from experimental trajectories of molecules…
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 formulate and analyze difference equations on graphs analogous to time-independent diffusion equations arising in the study of diffuse scattering in continuous media. Moreover, we show how to construct solutions in the presence of weak…
This paper is concerned with a diffusion-controlled moving-boundary problem in drug dissolution, in which the moving front passes from one medium to another for which the diffusion coefficient is many orders of magnitude smaller. It has…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
This paper develops an adaptive version of Mallat's scattering transform for signals on graphs. The main results are norm bounds for the layers of the transform, obtained from a version of a Beurling-Deny inequality that permits to remove…
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…
An investigation of the effect of surface diffusion in random deposition model is made by analytical methods and reasoning. For any given site, the extent to which a particle can diffuse is decided by the morphology in the immediate…
In this paper we study existence and uniqueness of solutions for a very general class of doubly nonlinear diffusion equations on metric graphs, which provide the appropriate mathematical framework to describe complex tubular networks in…
Diffusion rates through a membrane can be asymmetric, if the diffusing particles are spatially extended and the pores in the membrane have asymmetric structure. This phenomenon is demonstrated here via a deterministic simulation of a…
This is a review of Glauber's asymptotic diffraction theory, in which diffractive scattering is described in terms of interference between semiclassical amplitudes, resulting from a stationary-phase approximation. Typically two such…
This paper presents statistical analyses of random motions in a single layer of fluidized lightweight spherical particles. Foam polystyrene spheres were driven by an upward airflow through the sieve mesh, and their two-dimensional motion…
We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…
Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently extended to hypergraphs. We introduce a variant of…
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
We study the asymptotic behavior of Bohmian trajectories in a scattering situation with short range potential and for wave functions with a scattering and a bound part. It is shown that the set of possible trajectories splits into…
I extend the methods in "Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs, with Paul Christiano, Jonathan Kelner, Daniel Spielman, and Shang-Hua Teng" to directed graphs with a variation of…
We consider in this paper a solvable model for the motion of molecular motors. Based on the averaging principle, we reduce the problem to a diffusion process on a graph. We then calculate the effective speed of transportation of these…