Related papers: Sandpile models
This paper studies hyperelliptic curves $\cH_d$ corresponding to $y^2=\varphi_d(x)$ over finite fields, with $\varphi_d(x)$ a Chebyshev polynomial. Starting from the case where $d=\ell$ is an odd prime number, new cases $(d,q)$ are…
Statistical learning theory is the foundation of machine learning, providing theoretical bounds for the risk of models learned from a (single) training set, assumed to issue from an unknown probability distribution. In actual deployment,…
The avalanche polynomial on a graph captures the distribution of avalanches in the abelian sandpile model. Studied on trees, this polynomial could be defined by simply considering the size of the subtrees of the original tree. In this…
Recent approaches to the problem of inferring a continuous probability distribution from a finite set of data have used a scalar field theory for the form of the prior probability distribution. This letter presents a more general form for…
A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…
We introduce a tiling problem between bounded open convex polyforms $\hat{P}\subset\mathbb{R}^2$ with directed and uniquely colored edges. If there exists a tiling of the polyform $\hat{P}_2$ by $\hat{P}_1$, we show that one can construct a…
Let $A$ be a $g$-dimensional abelian variety over $\mathbb{Q}$ whose adelic Galois representation has open image in $\text{GSp}_{2g} \widehat{\mathbb{Z}}$. We investigate the endomorphism algebras $\text{End}(A_p) \otimes \mathbb{Q} =…
The (univariate) avalanche polynomial of a graph, introduced by Cori, Dartois and Rossin in 2006, captures the distribution of the length of (principal) avalanches in the abelian sandpile model. This polynomial has been used to show that…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
We study probability measures corresponding to families of abelian varieties over a finite field. These measures play an important role in the Tsfasman- Vladuts theory of asymptotic zeta-functions defining completely the limit zeta-function…
In their 2012 paper, Bobadilla and Koll\'ar studied topological conditions which guarantee that a proper map of complex algebraic varieties is a topological or differentiable fibration. They also asked whether a certain finiteness property…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…
We give a new simple construction of the sandpile measure on an infinite graph G, under the sole assumption that each tree in the Wired Uniform Spanning Forest on G has one end almost surely. For, the so called, generalized minimal…
Finite fields form an important chapter in abstract algebra, and mathematics in general. We aim to provide a geometric and intuitive model for finite fields, involving algebraic numbers, in order to make them accessible and interesting to a…
We study the steady state of the abelian sandpile models with stochastic toppling rules. The particle addition operators commute with each other, but in general these operators need not be diagonalizable. We use their abelian algebra to…
We discuss methods for using the Weil polynomial of an isogeny class of abelian varieties over a finite field to determine properties of the curves (if any) whose Jacobians lie in the isogeny class. Some methods are strong enough to show…
The main purpose of the present paper is to establish a link between quadrature surfaces (potential theoretic concept) and sandpile dynamics (Laplacian growth models). For this aim, we introduce a new model of Laplacian growth on the…
This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…
We perform extensive numerical simulations of different versions of the sandpile model. We find that previous claims about universality classes are unfounded, since the method previously employed to analyze the data suffered a systematic…
We consider the ASEP and the stochastic six vertex model started with step initial data. After a long time, $T$, it is known that the one-point height function fluctuations for these systems are of order $T^{1/3}$. We prove the KPZ…