Related papers: Front propagation on a general metric graph
We address the problem of a front propagation in chains with a bi-stable nondegenerate on-site potential and a nonlinear gradient coupling. For a generic nonlinear coupling, one encounters a special regime of transitions, characterized by…
We study two "above guarantee" versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Longest Detour, the task is to…
We describe the resulting spatiotemporal dynamics when a homogeneous equilibrium loses stability in a spatially extended system. More precisely, we consider reaction-diffusion systems, assuming only that the reaction kinetics undergo a…
Let $G$ be a connected graph with order $n$ and size $m$. Let $D(G)$ and $Tr(G)$ be the distance matrix and diagonal matrix with vertex transmissions of $G$, respectively. For any real $\alpha\in[0,1]$, the generalized distance matrix…
We consider asymptotic problems concerning the motion of interface separating the regions of large and small values of the solution of a reaction-diffusion equation in the media consisting of domains with different characteristics…
In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R^d is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic…
Suppose we have an arrangement $\mathcal{A}$ of $n$ geometric objects $x_1, \dots, x_n \subseteq \mathbb{R}^2$ in the plane, with a distinguished point $p_i$ in each object $x_i$. The generalized transmission graph of $\mathcal{A}$ has…
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for $\gamma\_{p,k}(G-e)$,…
Burning and cooling are diffusion processes on graphs in which burned (or cooled) vertices spread to their neighbors with a new source picked at discrete time steps. In burning, the one tries to burn the graph as fast as possible, while in…
We study existence and uniqueness of travelling fronts, and asymptotic speed of propagation for a non local reaction diffusion equation with spatial and genetic trait structure.
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…
We say that a graph $G=(V,E)$ on $n$ vertices is a $\beta$-expander for some constant $\beta>0$ if every $U\subseteq V$ of cardinality $|U|\leq \frac{n}{2}$ satisfies $|N_G(U)|\geq \beta|U|$ where $N_G(U)$ denotes the neighborhood of $U$.…
A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V(D) \setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by…
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described more naturally (and sometimes proved more easily) in…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
In the context of modern machine learning, models deployed in real-world scenarios often encounter diverse data shifts like covariate and semantic shifts, leading to challenges in both out-of-distribution (OOD) generalization and detection.…
A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $\iota(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$…
Recent years have witnessed a rise in real-world data captured with rich structural information that can be conveniently depicted by multi-relational graphs. While inference of continuous node features across a simple graph is rather…
The spread of an infection, a contagion, meme, emotion, message and various other spreadable objects have been discussed in several works. Burning and firefighting have been discussed in particular on static graphs. Graph burning simulates…
We study the following microscopic model of infection or epidemic reaction: red and blue particles perform independent nearest-neighbor continuous-time symmetric random walks on the integer lattice $\mathbb{Z}$ with jump rates $D_R$ for red…