Related papers: Reaction Spreading on Graphs
Reaction-diffusion equations describe various spatially extended processes that unfold as traveling fronts moving at constant velocity. We introduce and solve analytically a model that, besides such fronts, supports solutions advancing as…
We are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability…
We show that large deviation properties of Erd\"os-R\'enyi random graphs can be derived from the free energy of the $q$-state Potts model of statistical mechanics. More precisely the Legendre transform of the Potts free energy with respect…
Multispecies reaction-diffusion systems, for which the time evolution equation of correlation functions become a closed set, are considered. A formal solution for the average densities is found. Some special interactions and the exact time…
We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…
Spreading of bacteria in a highly advective, disordered environment is examined. Predictions of super-diffusive spreading for a simplified reaction-diffusion equation are tested. Concentration profiles display anomalous growth and…
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 study epidemic processes using a metapopulation approach on the line featuring random transport rates between arbitrarily distant sites. An average transport network is found using a recently developed variant of the effective medium…
We study the single-species diffusion-annihilation process with a time-dependent reaction rate, lambda(t)=lambda_0 t^-omega. Scaling arguments show that there is a critical value of the decay exponent omega_c(d) separating a…
We present a modified diffusive epidemic process that has a finite threshold on scale-free graphs. The diffusive epidemic process describes the epidemic spreading in a non-sedentary population, and it is a reaction-diffusion process. In the…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
We develop an encounter-based approach for describing restricted diffusion with a gradient drift towards a partially reactive boundary. For this purpose, we introduce an extension of the Dirichlet-to-Neumann operator and use its eigenbasis…
We investigate spreading properties of solutions of a large class of two-component reaction-diffusion systems, including prey-predator systems as a special case. By spreading properties we mean the long time behaviour of solution fronts…
We propose a new model to account for the main structural characteristics of rock fracture networks (RFNs). The model is based on a generalization of the random neighborhood graphs to consider fractures embedded into rectangular spaces. We…
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…
We address the issue of the proximity of interacting diffusion models on large graphs with a uniform degree property and a corresponding mean field model, i.e. a model on the complete graph with a suitably renormalized interaction…
In this paper, we analyze the dynamics of spreading processes taking place over time-varying networks. A common approach to model time-varying networks is via Markovian random graph processes. This modeling approach presents the following…
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 establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Conventional studies of network growth models mainly look at the steady state degree distribution of the graph. Often long time behavior is considered, hence the initial condition is ignored. In this contribution, the time evolution of the…