相关论文: Terminating cases of flooding
Climate change-driven floods demand advanced forecasting models, yet Graph Neural Networks (GNNs) underutilize river network topology due to tree-like structures causing over-squashing from high node resistance distances. This study…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
This paper explores the fundamental properties of distributed minimization of a sum of functions with each function only known to one node, and a pre-specified level of node knowledge and computational capacity. We define the optimization…
Mapping network flows provides insight into the organization of networks, but even though many real-networks are bipartite, no method for mapping flows takes advantage of the bipartite structure. What do we miss by discarding this…
A dynamic flow network consists of a directed graph, where nodes called sources represent locations of evacuees, and nodes called sinks represent locations of evacuation facilities. Each source and each sink are given supply representing…
Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some…
Numerous networks, such as transportation, distribution and delivery networks optimize their designs in order to increase efficiency and lower costs, improving the stability of its intended functions, etc. Networks that distribute goods,…
Simple physical models based on fluid mechanics have long been used to understand the flow of vehicular traffic on freeways; analytically tractable models of flow on an urban grid, however, have not been as extensively explored. In an ideal…
Broadcasting concerns the dissemination of a message originating at one node of a network to all other nodes. This task is accomplished by placing a series of calls over the communication lines of the network between neighboring nodes,…
A multi-hop synchronous wirelss network is said to be unknown if the nodes have no knowledge of the topology. A basic task in wireless network is that of broadcasting a message (created by a fixed source node) to all nodes of the network.…
We study the edge-averaging process on a finite, connected graph $G = (V, E)$. Initially, the vertices in $V$ are endowed with i.i.d.\ real-valued opinions $(f_0(v))_{v \in V}$. Edges are activated according to i.i.d.\ Poisson clocks of…
We give a new technique to analyze the stopping time of gossip protocols that are based on random linear network coding (RLNC). Our analysis drastically simplifies, extends and strengthens previous results. We analyze RLNC gossip in a…
A model is presented for the gravity-driven flow of rainwater descending through the soil layer of a green roof, treated as a porous medium on a flat permeable surface representing an efficient drainage layer. A fully saturated zone is…
Broadcasting and gossiping are fundamental communication tasks in networks. In broadcasting,one node of a network has a message that must be learned by all other nodes. In gossiping, every node has a (possibly different) message, and all…
The \textit{node reliability} of a graph $G$ is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they induce, given that the edges are perfectly reliable but each…
We consider flow rounding: finding an integral flow from a fractional flow. Costed flow rounding asks that we find an integral flow with no worse cost. Randomized flow rounding requires we randomly find an integral flow such that the…
In this paper, we consider an $N$-queue overloaded polling network attended by a single cyclically roving server. Upon the completion of his service, a customer is either routed to another queue or leaves the system. All the switches are…
We construct a complete invariant for non-wandering surface flows with finitely many singular points but without locally dense orbits. Precisely, we show that a flow $v$ with finitely many singular points on a compact connected surface $S$…
The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a…
In this paper, we study wave transmission in a rotating fluid with multiple alternating convectively stable and unstable layers. We have discussed wave transmissions in two different circumstances: cases where the wave is propagative in…