Related papers: Diffusion on graphs is eventually periodic

Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the burning number conjecture, which says that every connected…

We propose a generalization of the graphical chip-firing model allowing for the redistribution dynamics to be governed by any invertible integer matrix while maintaining the long term critical, superstable, and energy minimizing behavior of…

Temporal graphs (in which edges are active at specified times) are of particular relevance for spreading processes on graphs, e.g.~the spread of disease or dissemination of information. Motivated by real-world applications, modification of…

We extend the notion of chip-firing to weighted graphs, and generalize the Greedy Algorithm and Dhar's Burning Algorithm to weighted graphs. For a vertex $q \in V(\Gamma)$, we give an upper bound for the number of linearly equivalent…

Let $\Gamma$ be a finite graph and let $\Gamma_n$ be the "$n$th cone over $\Gamma$" (i.e., the join of $\Gamma$ and the complete graph $K_n$). We study the asymptotic structure of the chip-firing group $\text{Pic}^0(\Gamma_n)$.

Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges…

We investigate continuous diffusions on star graphs with sticky behavior at the vertex. These are Markov processes with continuous paths having a positive occupation time at the vertex. We characterize sticky diffusions as time-changed…

Graph generative models can be classified into two prominent families: one-shot models, which generate a graph in one go, and sequential models, which generate a graph by successive additions of nodes and edges. Ideally, between these two…

Using graphs to model irregular information domains is an effective approach to deal with some of the intricacies of contemporary (network) data. A key aspect is how the data, represented as graph signals, depend on the topology of the…

Expectation propagation is a general approach to fast approximate inference for graphical models. The existing literature treats models separately when it comes to deriving and coding expectation propagation inference algorithms. This comes…

We prove some partial results on the periodicity of billiard systems on graphs. The results specialize to the case of $n$ billiards with equal mass on the unit interval or circle traveling at the same speed.

We propose a model of card shuffling where a pack of cards, spread as points on a square table, are repeatedly gathered locally at random spots and then spread towards a random direction. A shuffling of the cards is then obtained by…

Since the famous 1926 paper by Richardson, the relative diffusion of two particles in a turbulent liquid has attracted a lot of interest. The motion of a single particle on the other hand is usually considered not to be especially…

Game coloring is a well-studied two-player game in which each player properly colors one vertex of a graph at a time until all the vertices are colored. An `eternal' version of game coloring is introduced in this paper in which the vertices…

We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…

We present a self-contained introduction to the theory of chip-firing games on metric graphs, as well as the more recent theory of tropical Prym varieties. We briefly discuss the connection between these notions and their algebraic…

A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a specified vertex of the graph by a sequence of pebbling moves.…

Vertex coloring and multicoloring of graphs are a well known subject in graph theory, as well as their applications. In vertex multicoloring, each vertex is assigned some subset of a given set of colors. Here we propose a new kind of vertex…

This paper considers a game in which a single cop and a single robber take turns moving along the edges of a given graph $G$. If there exists a strategy for the cop which enables it to be positioned at the same vertex as the robber…

We study a discrete-time model for the spread of information in a graph, motivated by the idea that people believe a story when they learn of it from two different origins. Similar to the burning number, in this problem, information spreads…