Related papers: The devil's staircase for chip-firing on random gr…
In the past, efforts were taken to improve the performance of a processor via frequency scaling. However, industry has reached the limits of increasing the frequency and therefore concurrent execution of instructions on multiple cores seems…
We investigate the $H$-property for step-graphons. Specifically, we sample graphs $G_n$ on $n$ nodes from a step-graphon and evaluate the probability that $G_n$ has a Hamiltonian decomposition in the asymptotic regime as $n\to\infty$. It…
Random graphs (or networks) have gained a significant increase of interest due to its popularity in modeling and simulating many complex real-world systems. Degree sequence is one of the most important aspects of these systems. Random…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
We study the repetition of patches in self-affine tilings in R^d. In particular, we study the existence and non-existence of arithmetic progressions. We first show that an arithmetic condition of the expansion map for a self-affine tiling…
Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…
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…
The location and nature of the percolation transition in random networks is a subject of intense interest. Recently, a series of graph evolution processes have been introduced that lead to discontinuous percolation transitions where the…
We study propagation of pulses along one-way coupled map lattices, which originate from the transition between two superstable states of the local map. The velocity of the pulses exhibits a staircase-like behaviour as the coupling parameter…
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. Cooper and Spencer (Comb. Probab. Comput. (2006)) show a…
The so-called rich-club phenomenon in a complex network is characterized when nodes of higher degree (hubs) are better connected among themselves than are nodes with smaller degree. The presence of the rich-club phenomenon may be an…
For a deep learning model, efficient execution of its computation graph is key to achieving high performance. Previous work has focused on improving the performance for individual nodes of the computation graph, while ignoring the…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
The straight-line flow on almost every staircase and on almost every square tiled staircase is recurrent. For almost every square tiled staircase the set of periodic orbits is dense in the phase space.
Given a graph $G$ we consider sequentially placing dimers on it, namely choosing a maximal independent subset of edges, i.e. edges that do not share common vertices. We study the number of vertices that do not belong to any edge found in…
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…
We study interacting bosonic or fermionic atoms in a high synthetic magnetic field in two dimensions spanned by continuous real space and a synthetic dimension. Here, the synthetic dimension is provided by hyperfine spin states, and the…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…