相关论文: A Solution for the Open Abelian Sandpile Problem o…

The $\textit{Abelian Sandpile}$ model is a well-known model used in exploring $\textit{self-organized criticality}$. Despite a large amount of work on other aspects of sandpiles, there have been limited results in efficiently computing the…

Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of…

We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for any vertex $v\in V(G)$, $\left|N[v] \cap X\right| \le k$, where N[v] is the closed neighbourhood of v.…

Let $G=(V,E)$ be a simple undirected graph. The open neighbourhood of a vertex $v$ in $G$ is defined as $N_G(v)=\{u\in V~|~ uv\in E\}$; whereas the closed neighbourhood is defined as $N_G[v]= N_G(v)\cup \{v\}$. For an integer $k$, a subset…

We study the Abelian sandpile model (ASM), a process where grains of sand are placed on a graph's vertices. When the number of grains on a vertex is at least its degree, one grain is distributed to each neighboring vertex. This model has…

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…

We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graph G is a k-limited packing if for any vertex $v\in V(G)$, $\left|N[v] \cap X\right| \le k$, where $N[v]$ is the…

A set $B$ of vertices in a graph $G$ is called a \emph{$k$-limited packing} if for each vertex $v$ of $G$, its closed neighbourhood has at most $k$ vertices in $B$. The \emph{$k$-limited packing number} of a graph $G$, denoted by $L_k(G)$,…

We consider the ideal orientation problem in planar graphs. In this problem, we are given an undirected graph $G$ with positive edge lengths and $k$ pairs of distinct vertices $(s_1, t_1), \dots, (s_k, t_k)$ called terminals, and we want to…

We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters…

$k$-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on vertices of cardinality bounded by a parameter $k$. The problem…

Given an initial distribution of sand in an Abelian sandpile, what final state does it relax to after all possible avalanches have taken place? In d >= 3, we show that this problem is P-complete, so that explicit simulation of the system is…

Given a graph on $n$ vertices and an integer $k$, the feedback vertex set problem asks for the deletion of at most $k$ vertices to make the graph acyclic. We show that a greedy branching algorithm, which always branches on an undecided…

We consider an open spin chain model with GL(N) bulk symmetry that is broken to GL(M) x GL(N-M) by the boundary, which is a generalization of a model arising in string/gauge theory. We prove the integrability of this model by constructing…

We study the problem of covering the maximum number of vertices in a graph by a collection of vertex-disjoint stars, each with a number of satellites in a given interval $[k, \ell]$, where $1 \le k < \ell$ and $\ell$ can be infinity. This…

Closed monopolies in graphs have a quite long range of applications in several problems related to overcoming failures, since they frequently have some common approaches around the notion of majorities, for instance to consensus problems,…

In the $k$-Orthogonal Vectors ($k$-OV) problem we are given $k$ sets, each containing $n$ binary vectors of dimension $d=n^{o(1)}$, and our goal is to pick one vector from each set so that at each coordinate at least one vector has a zero.…

The $K$-nearest neighbors is a basic problem in machine learning with numerous applications. In this problem, given a (training) set of $n$ data points with labels and a query point $p$, we want to assign a label to $p$ based on the labels…

Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the…

Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…