Related papers: Advection, diffusion and delivery over a network
Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…
A new amortized variance-reduced gradient (AVRG) algorithm was developed in \cite{ying2017convergence}, which has constant storage requirement in comparison to SAGA and balanced gradient computations in comparison to SVRG. One key advantage…
Maximizing robustness and minimizing cost are common objectives in the design of infrastructure networks. However, most infrastructure networks evolve and operate in a highly decentralized fashion, which may significantly impact the…
We analyze information diffusion using empirical data that tracks online communication around two instances of mass political mobilization, including the year that lapsed in-between the protests. We compare the global properties of the…
We study analytically the joint dispersion of Gaussian patches of salt and colloids in linear flows, and how salt gradients accelerate or delay colloid spreading by diffusiophoretic effects. Because these flows have constant gradients in…
Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…
A widely studied process of influence diffusion in social networks posits that the dynamics of influence diffusion evolves as follows: Given a graph $G=(V,E)$, representing the network, initially \emph{only} the members of a given…
A modular fluid-flow model for network congestion analysis and control is proposed. The model is derived from an information conservation law stating that the information is either in transit, lost or received. Mathematical models of…
We investigate the problem of locating the source of diffusion in complex networks without complete knowledge of nodes' states. Some currently known methods assume the information travels via a single, shortest path, which by assumption is…
The seasonal production of fruit and seeds resembles opening a feeding station, such as a restaurant agents/ customers will arrive at a certain rate and pick fruit (get served) at a certain rate following some appropriate processes.…
With the rapid development of the low-altitude economy, air-ground integrated multi-access edge computing (MEC) systems are facing increasing demands for real-time and intelligent task scheduling. In such systems, task offloading and…
Conventional studies of network growth models mainly look at the steady state degree distribution of the graph. Often long time behavior is considered, hence the initial condition is ignored. In this contribution, the time evolution of the…
We introduce a model of traveling agents ({\it e.g.} frugivorous animals) who feed on randomly located vegetation patches and disperse their seeds, thus modifying the spatial distribution of resources in the long term. It is assumed that…
The spread of traffic jams in urban networks has long been viewed as a complex spatio-temporal phenomenon that often requires computationally intensive microscopic models for analysis purposes. In this study, we present a framework to…
A discrete-time model of reacting evolving fields, transported by a bidimensional chaotic fluid flow, is studied. Our approach is based on the use of a Lagrangian scheme where {\it fluid particles} are advected by a $2d$ symplectic map…
Causal discovery algorithms based on probabilistic graphical models have emerged in geoscience applications for the identification and visualization of dynamical processes. The key idea is to learn the structure of a graphical model from…
Without any assumptions about data generation, multiple causal models may explain our observations equally well. To avoid selecting a single arbitrary model that could result in unsafe decisions if it does not match reality, it is therefore…
We introduce a formalism of fractional diffusion on networks based on a fractional Laplacian matrix that can be constructed directly from the eigenvalues and eigenvectors of the Laplacian matrix. This fractional approach allows random walks…
In this paper, we propose a sampling mechanism for adaptive diffusion networks that adaptively changes the amount of sampled nodes based on mean-squared error in the neighborhood of each node. It presents fast convergence during transient…
The transport of an infinitely thin, hard rod in a random, dense array of point obstacles is investigated by molecular dynamics simulations. Our model mimics the sterically hindered dynamics in dense needle liquids. The center-of-mass…