相关论文: The devil's staircase for chip-firing on random gr…
The parallel chip-firing game is a periodic automaton on graphs in which vertices "fire" chips to their neighbors. In 1989, Bitar conjectured that the period of a parallel chip-firing game with n vertices is at most n. Though this…
Chip-firing on a directed graph is a game in which chips, a discrete commodity, are placed on the vertices of the graph and are transferred between vertices. In this paper, we study a chip-firing game on the Hasse diagram of the lattice of…
Parallel Diffusion is a variant of Chip-Firing introduced in 2018 by Duffy et al. In Parallel Diffusion, chips move from places of high concentration to places of low concentration through a discrete-time process. At each time step, every…
We investigate the phase diagram of a spin-$1/2$ Ising model on a cubic lattice, with competing interactions between nearest and next-nearest neighbors along an axial direction, and fully connected spins on the sites of each perpendicular…
Chip-firing is a combinatorial game played on a graph in which we place and disperse chips on vertices until a stable state is reached. We study a chip-firing variant played on an infinite rooted directed $k$-ary tree, where we place…
This paper deals with the so-called staircasing phenomenon, which frequently arises in total variation based denoising models in image analysis. We prove in particular that staircasing always occurs at global extrema of the datum and at all…
The phase dynamics of Josephson junctions under external electromagnetic radiation is studied through numerical simulations. Current-voltage characteristics, Lyapunov exponents and Poincare sections are analyzed in detail. It is found that…
We study a variant of the chip-firing game called \emph{diffusion}. In diffusion on a graph, each vertex of the graph is initially labelled with an integer interpreted as the number of chips at that vertex, and at each subsequent step, each…
The computing performance today is developing mainly using parallelized sequential computing, in many forms. The paper scrutinizes whether the performance of that type of computing has an upper limit. The simple considerations point out…
We have determined the ground state for both a ladder array of Josephson junctions and a ladder of thin superconducting wires. We find that the repulsive interaction between vortices falls off exponentially with separation. The fact that…
We investigate a variant of the chip-firing process on the infinite path graph: rather than treating the chips as indistinguishable, we label them with positive integers. To fire an unstable vertex, i.e. a vertex with more than one chip, we…
Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard. The…
In this paper we focus on the problem of the degree sequence for the following random graph process. At any time-step $t$, one of the following three substeps is executed: with probability $\alpha_1$, a new vertex $x_t$ and $m$ edges…
We study chip-firing games on multigraphs whose underlying simple graphs are trees, paths, and stars, denoted as banana trees, paths, and stars respectively. We present a polynomial time algorithm to compute the divisorial gonality of…
In this paper we consider a simple model of random graph process with {\it hard} copying as follows: At each time step $t$, with probability $0<\alpha\leq 1$ a new vertex $v_t$ is added and $m$ edges incident with $v_t$ are added in the…
We use an infinite $k$-ary tree with a self-loop at the root as our underlying graph. We consider a chip-firing process starting with $N$ chips at the root. We describe the stable configurations. We calculate the number of fires for each…
In this paper, we explore the limits of graphics processors (GPUs) for general purpose parallel computing by studying problems that require highly irregular data access patterns: parallel graph algorithms for list ranking and connected…
The realization of strong coherent interactions between individual photons is a long-standing goal in science and engineering. In this report, based on recent experimental setups, we derive a strong photon long-range repulsive interaction,…
Graph clustering has many important applications in computing, but due to growing sizes of graphs, even traditionally fast clustering methods such as spectral partitioning can be computationally expensive for real-world graphs of interest.…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…