Related papers: Semigroup approach to diffusion and transport prob…
Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes…
This work examines the problem of graph learning over a diffusion network when data can be collected from a limited portion of the network (partial observability). The main question is to establish technical guarantees of consistent…
Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to…
In this article we study port-Hamiltonian partial differential equations on certain one-dimensional manifolds. We classify those boundary conditions that give rise to contraction semigroups. As an application we study port-Hamiltonian…
We present a method to extract temporal hypergraphs from sequences of 2-dimensional functions obtained as solutions to Optimal Transport problems. We investigate optimality principles exhibited by these solutions from the point of view of…
Transport through generalized trees is considered. Trees contain the simple nodes and supernodes, either well-structured regular subgraphs or those with many triangles. We observe a superdiffusion for the highly connected nodes while it is…
The present paper is concerned with diffusion processes running on tubular domains with conditions on nonreaching the boundary, respectively, reflecting at the boundary, and corresponding processes in the limit where the thin tubular…
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…
This paper explores the distributed broadcast problem within the context of network communications, a critical challenge in decentralized information dissemination. We put forth a novel hypergraph-based approach to address this issue,…
In this short note we provide a proof of boundedness of solutions for a network system composed of heterogeneous nonlinear autonomous systems interconnected over a directed graph. The sole assumptions imposed are that the systems are…
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the…
Diffusion processes in networks are increasingly used to model the spread of information and social influence. In several applications in computational sustainability such as the spread of wildlife, infectious diseases and traffic mobility…
The configuration model was originally defined for undirected networks and has recently been extended to directed networks. Many empirical networks are however neither undirected nor completely directed, but instead usually partially…
We introduce the concept evolutionary semigroups on path spaces, generalizing the notion of transition semigroups to possibly non-Markovian stochastic processes. We study the basic properties of evolutionary semigroups and, in particular,…
Several systems can be modeled as sets of interconnected networks or networks with multiple types of connections, here generally called multilayer networks. Spreading processes such as information propagation among users of an online social…
In this paper, we consider a continuous fragmentation--coagulation model in which the reacting particles can be transported in physical space through either advection or diffusion. We prove new results on the generation of $C_0$-semigroups…
This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyse a generic mechanism…
Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic autonomous biologic entities. The…
From footpaths to flight routes, human mobility networks facilitate the spread of communicable diseases. Control and elimination efforts depend on characterizing these networks in terms of connections and flux rates of individuals between…
This paper addresses analytical aspects of deterministic, continuous-time dynamical systems defined on networks. The goal is to model and analyze certain phenomena which must be framed beyond the context of networked dynamical systems,…