Related papers: 2-FREE-FLOOD-IT is polynomial
The aim of this paper is to analyse the gain of the update algorithm associated to the recently proposed D-iteration: the D-iteration is a fluid diffusion based new iterative method. It exploits a simple intuitive decomposition of the…
Flood prediction is critical for emergency planning and response to mitigate human and economic losses. Traditional physics-based hydrodynamic models generate high-resolution flood maps using numerical methods requiring fine-grid…
The aim of this paper is to present the recently proposed fluid diffusion based algorithm in the general context of the matrix inversion problem associated to the Gauss-Seidel method. We explain the simple intuitions that are behind this…
Partitioning the vertices of a (hyper)graph into k roughly balanced blocks such that few (hyper)edges run between blocks is a key problem for large-scale distributed processing. A current trend for partitioning huge (hyper)graphs using low…
Flow scheduling tends to be one of the oldest and most stubborn problems in networking. It becomes more crucial in the next generation network, due to fast changing link states and tremendous cost to explore the global structure. In such…
The diffusion strategy for distributed learning from streaming data employs local stochastic gradient updates along with exchange of iterates over neighborhoods. In Part I [2] of this work we established that agents cluster around a network…
In this paper we use game theoretic techniques to study the value of cooperation in distributed spectrum management problems. We show that the celebrated iterative water-filling algorithm is subject to the prisoner's dilemma and therefore…
We study analytically and numerically the classical diffusive process which takes place in a chaotic billiard. This allows to estimate the conditions under which the statistical properties of eigenvalues and eigenfunctions can be described…
We consider the following inference problem: Given a set of edge-flow signals observed on a graph, lift the graph to a cell complex, such that the observed edge-flow signals can be represented as a sparse combination of gradient and curl…
The fluidic pinball has been recently proposed as an attractive and effective flow configuration for exploring machine learning fluid flow control. In this contribution, we focus on the route to chaos in this system without actuation, as…
Many popular puzzle and matching games have been analyzed through the lens of computational complexity. Prominent examples include Sudoku, Candy Crush, and Flood-It. A common theme among these widely played games is that their generalized…
The Poincar\'e problem is a model of two-dimensional internal waves in stable-stratified fluid. The chess billiard flow, a variation of a typical billiard flow, drives the formation behind and describes the evolution of these internal…
In the chip-firing variant, Diffusion, chips flow from places of high concentration to places of low concentration (or equivalently, from the rich to the poor). We explore this model on complete graphs, determining the number of different…
This paper builds bridges between two families of probabilistic algorithms: (hierarchical) variational inference (VI), which is typically used to model distributions over continuous spaces, and generative flow networks (GFlowNets), which…
Hypergraphs are important objects to model ternary or higher-order relations of objects, and have a number of applications in analysing many complex datasets occurring in practice. In this work we study a new heat diffusion process in…
In the context of the stream calculus, we present an Implicit Function Theorem (IFT) for polynomial systems, and discuss its relations with the classical IFT from calculus. In particular, we demonstrate the advantages of the stream IFT from…
We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial…
Representing data by means of graph structures identifies one of the most valid approach to extract information in several data analysis applications. This is especially true when multimodal datasets are investigated, as records collected…
We introduce a natural variant of the parallel chip-firing game, called the diffusion game. Chips are initially assigned to vertices of a graph. At every step, all vertices simultaneously send one chip to each neighbour with fewer chips. As…
Flooding is one of the most destructive and costly natural disasters, and climate changes would further increase risks globally. This work presents a novel multimodal machine learning approach for multi-year global flood risk prediction,…