Related papers: The L2 strong maximum principle on arbitrary count…
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 a mathematical model of biological neuronal networks composed by any finite number $N \geq 2$ of non necessarily identical cells. The model is a deterministic dynamical system governed by finite-dimensional impulsive differential…
We study the existence and uniqueness of the heat kernel on infinite, locally finite, connected graphs. For general graphs, a uniqueness criterion, shown to be optimal, is given in terms of the maximal valence on spheres about a fixed…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
Based on works by Hopf, Weinberger, Hamilton and Evans, we state and prove the strong elliptic maximum principle for smooth sections in vector bundles over Riemannian manifolds and give some applications in Differential Geometry. Moreover,…
Series-parallel networks are a class of graphs on which many NP-hard problems have tractable solutions. In this paper, we examine performance measures on leader-follower consensus on series-parallel networks. We show that a distributed…
In this paper, we propose nonlocal diffusion models with Dirichlet boundary. These nonlocal diffusion models preserve the maximum principle and also have corresponding variational form. With these good properties, we can prove the…
We consider the setting of two disks in a domain in $\mathbb{R}^2$ which are almost touching and have finite and positive conductivities, giving rise to a divergence form elliptic equation with discontinuous coefficients. We use the maximum…
An analysis of efficiency and its bounds at maximum work output for Carnot-like heat engines is conducted. The heat transfer processes are described by the linear law with time-dependent heat conductance. The upper bound of efficiency is…
This paper presents new results and reinterpretation of existing conditions for strong structural controllability in a structured network determined by the zero/non-zero patterns of edges. For diffusively-coupled networks with self-loops,…
We study the boundary control problems for the wave, heat, and Schr\"odinger equations on a finite graph. We suppose that the graph is a tree (i.e., it does not contain cycles), and on each edge an equation is defined. The control is acting…
The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a…
Given a graph $G$, viewed as a loop-less symmetric digraph, we study the maximum number of fixed points in a conjunctive boolean network with $G$ as interaction graph. We prove that if $G$ has no induced $C_4$, then this quantity equals…
We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…
We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to $\mathsf{ACA}_0$ over $\mathsf{RCA}_0$. The…
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…
In many real, directed networks, the strongly connected component of nodes which are mutually reachable is very small. This does not fit with current theory, based on random graphs, according to which strong connectivity depends on mean…
Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…
We introduce and prove a maximum principle for a natural quantity related to the $k$-point correlation function of the classical one-component Coulomb gas. As an application, we show that the gas is confined to the droplet by a well-known…
Finding strongly connected components (SCCs) and the diameter of a directed network play a key role in a variety of discrete optimization problems, and subsequently, machine learning and control theory problems. On the one hand, SCCs are…