Related papers: Front propagation on a general metric graph

We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.

Distribution shifts on graphs -- the data distribution discrepancies between training and testing a graph machine learning model, are often ubiquitous and unavoidable in real-world scenarios. Such shifts may severely deteriorate the…

We analyze ``pulled'' or ``linearly marginally stable'' fronts propagating into unstable states. While ``pushed'' fronts into meta- and unstable states relax exponentially, pulled fronts relax algebraically, and simultaneously the standard…

Fronts that start from a local perturbation and propagate into a linearly unstable state come in two classes: pulled and pushed. ``Pulled'' fronts are ``pulled along'' by the spreading of linear perturbations about the unstable state, so…

This work focuses on dynamics arising from reaction-diffusion equations , where the profile of propagation is no longer characterized by a single front, but by a layer of several fronts which we call a propagating terrace. This means,…

An orientation of a graph $G$ is {\it in-out-proper} if any two adjacent vertices have different in-out-degrees, where the in-out-degree of each vertex is equal to the in-degree minus the out-degree of that vertex. The {\it in-out-proper…

We study front propagation in the irreversible epidemic model $A+B\to 2A$ in one dimension. Here, we allow the particles $A$ and $B$ to diffuse with rates $D_A$ and $D_B$, which, in general, may be different. We find analytic estimates for…

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…

The spread of a graph $G$ is the difference $\lambda_1 - \lambda_n$ between the largest and smallest eigenvalues of its adjacency matrix. Breen, Riasanovsky, Tait and Urschel recently determined the graph on $n$ vertices with maximum spread…

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

The concept of metric dimension has applications in a variety of fields, such as chemistry, robotic navigation, and combinatorial optimization. We show bounds for graphs with $n$ vertices and metric dimension $\beta$. For Hamiltonian…

An \emph{obstacle representation} of a graph consists of a set of polygonal obstacles and a distinct point for each vertex such that two points see each other if and only if the corresponding vertices are adjacent. Obstacle representations…

We study reaction-diffusion particle systems with several interaction mechanisms. As the number of particles tends to infinity, the system admits a mean-field limit describing the bulk behaviour. We focus on determining the propagation…

We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

Near a parity breaking front bifurcation, small perturbations may reverse the propagation direction of fronts. Often this results in nonsteady asymptotic motion such as breathing and domain breakup. Exploiting the time scale differences of…

We consider a propagation of exotermic transition front in a discrete conservative oscillatory chain. Adequate description of such fronts is a key point in prediction of important transient phenomena, including phase transitions and…

This paper is concerned with the propagation phenomenon of the combustion reaction-diffusion equations in domains with multiple cylindrical branches. We first show that there is an entire solution emanating from planar traveling fronts in…

We propose and study a new model to describe biological invasions constrained on infinite homogeneous one dimensional metric graphs. Our model consists of an infinite PDE-ODE system where, at each vertex of the one-dimensional lattice…

Assignment of one of the two possible directions to every edge of an undirected graph $G=(V,E)$ is called an orientation of $G$. The resulting directed graph is denoted by $\overrightarrow{G}$. A strong orientation is one in which every…