Related papers: Front propagation on a general metric graph
We consider a bistable reaction-diffusion equation $u_t=\Delta u +f(u)$ on $\mathbb{R}^N$ in the presence of an obstacle $K$, which is a wall of infinite span with many holes. More precisely, $K$ is a closed subset of $\mathbb{R}^N$ with…
We propose and unify classes of different models for information propagation over graphs. In a first class, propagation is modelled as a wave which emanates from a set of \emph{known} nodes at an initial time, to all other \emph{unknown}…
We investigate numerically the blocking of two-dimensional bistable reaction diffusion fronts by geometric obstacles. Our goal is to derive quantitative criteria for front propagation in the presence of spatial heterogeneities. Using a…
The burning and forcing processes are both instances of propagation processes on graphs that are commonly used to model real-world spreading phenomena. The contribution of this paper is two-fold. We first establish a connection between…
Order the vertices of a directed random graph \math{v_1,...,v_n}; edge \math{(v_i,v_j)} for \math{i<j} exists independently with probability \math{p}. This random graph model is related to certain spreading processes on networks. We…
Fronts are regions of transition from one state to another in a medium. They are present in many areas of science and applied mathematics, and modelling them and their evolution is often an effective way of treating the underlying phenomena…
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…
We consider the worst-case query complexity of some variants of certain \cl{PPAD}-complete search problems. Suppose we are given a graph $G$ and a vertex $s \in V(G)$. We denote the directed graph obtained from $G$ by directing all edges in…
We study feature propagation on graph, an inference process involved in graph representation learning tasks. It's to spread the features over the whole graph to the $t$-th orders, thus to expand the end's features. The process has been…
Built upon the shoulders of graph theory, the field of complex networks has become a central tool for studying real systems across various fields of research. Represented as graphs, different systems can be studied using the same analysis…
We study front propagation in the reaction diffusion process $\{A\stackrel{\epsilon}\to2A, A\stackrel {\epsilon_t}\to3A\}$ on a one dimensional (1d) lattice with hard core interaction between the particles. Using the leading particle…
Graph machine learning has been extensively studied in both academia and industry. Although booming with a vast number of emerging methods and techniques, most of the literature is built on the in-distribution hypothesis, i.e., testing and…
The spread of a graph is the difference between the largest and most negative eigenvalue of its adjacency matrix. We show that for sufficiently large $n$, the $n$-vertex outerplanar graph with maximum spread is a vertex joined to a linear…
In this paper we consider a bistable reaction-diffusion equation in unbounded domains and we investigate the existence of propagation phenomena, possibly partial, in some direction or, on the contrary, of blocking phenomena. We start by…
The spread of a real symmetric matrix is defined as the difference between its largest and smallest eigenvalue. The study of graph-related matrices has attracted considerable attention, leading to a substantial body of findings. In this…
We expand on a previous study of fronts in finite particle number reaction-diffusion systems in the presence of a reaction rate gradient in the direction of the front motion. We study the system via reaction-diffusion equations, using the…
We consider a reaction-diffusion equation in narrow random channels. We approximate the generalized solution to this equation by the corresponding one on a random graph. By making use of large deviation analysis we study the asymptotic wave…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
The principal ratio of a graph is the ratio of the greatest and least entry of its principal eigenvector. Since the principal ratio compares the extreme values of the principal eigenvector it is sensitive to outliers. This can be…
This paper is concerned with the existence and uniqueness of transition fronts of a general reaction-diffusion-advection equation in domains with multiple branches. In this paper, every branch in the domain is not necessary to be straight…