Related papers: Graphon Limits of Graph Reaction--Diffusion Equati…
A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…
Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a…
The study of the dynamics of chemical reactions, and in particular phenomena such as oscillating reactions, has led to the recognition that many dynamical properties of a chemical reaction can be predicted from graph theoretical properties…
This paper is concerned with the large-time dynamics of bounded solutions of reaction-diffusion equations with bounded or unbounded initial support in R N. We start with a survey of some old and recent results on the spreading speeds of the…
We study the uniform boundedness of solutions to reaction-diffusion systems possessing a Lyapunov-like function and satisfying an {\it intermediate sum condition}. This significantly generalizes the mass dissipation condition in the…
In many biological situations, a species arriving from a remote source diffuses in a domain confined between two parallel surfaces until it finds a binding partner. Since such a geometric shape falls in between two- and three-dimensional…
Graph convolutional networks (GCNs) are a widely used method for graph representation learning. We investigate the power of GCNs, as a function of their number of layers, to distinguish between different random graph models on the basis of…
We study the boundedness and convergence to equilibrium of weak solutions to reaction-diffusion systems with nonlinear diffusion. The nonlinear diffusion is of porous medium type and the nonlinear reaction terms are assumed to grow…
We consider a reaction-diffusion equation on a 3D thin porous media of thickness $\varepsilon$ which is perforated by periodically distributed cylinders of size $\varepsilon$. On the boundary of the cylinders we prescribe a dynamical…
Given a finite non-decreasing sequence $d=(d_1,\ldots,d_n)$ of natural numbers, the Graph Realization problem asks whether $d$ is a graphic sequence, i.e., there exists a labeled simple graph such that $(d_1,\ldots,d_n)$ is the degree…
The global existence of bounded solutions to reaction-diffusion systems with fractional diffusion in the whole space $\mathbb R^N$ is investigated. The systems are assumed to preserve the non-negativity of initial data and to dissipate…
This paper deals with the solution of unified fractional reaction-diffusion systems. The results are obtained in compact and elegant forms in terms of Mittag-Leffler functions and generalized Mittag-Leffler functions, which are suitable for…
We consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The method involves…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
Graph burning is a deterministic, discrete-time process that models how influence or contagion spreads in a graph. Associated to each graph is its burning number, which is a parameter that quantifies how quickly the influence spreads. We…
Graph signal processing is an emerging field which aims to model processes that exist on the nodes of a network and are explained through diffusion over this structure. Graph signal processing works have heretofore assumed knowledge of the…
The relation between densities of cycles and the spectrum of a graphon, which implies that the spectra of convergent graphons converge, fundamentally relies on the self-adjointness of the linear operator associated with a graphon. In this…
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…
In this paper we present computational techniques to investigate the solutions of two-component, nonlinear reaction-diffusion (RD) systems on arbitrary surfaces. We build on standard techniques for linear and nonlinear analysis of RD…
Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,\ldots,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect…