Related papers: Minimal configurations and sandpile measures

Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a…

We define a class of probability distributions that we call simplicial mixture models, inspired by simplicial complexes from algebraic topology. The parameters of these distributions represent their topology and we show that it is possible…

We investigate structural properties of large, sparse random graphs through the lens of "sampling convergence" (Borgs et. al. (2017)). Sampling convergence generalizes left convergence to sparse graphs, and describes the limit in terms of a…

We study the minimum spanning tree distribution on the space of spanning trees of the $n$-by-$n$ grid for large $n$. We establish bounds on the decay rates of the probability of the most and the least probable spanning trees as…

In this paper, we address the problem of constructing a uniform probability measure on $\mathbb{N}$. Of course, this is not possible within the bounds of the Kolmogorov axioms and we have to violate at least one axiom. We define a…

A sufficient geometrical condition for the existence of absolutely continuous invariant probability measures for S-unimodal maps will be discussed. The Lebesgue typical existence of such measures in the quadratic family will be a…

We show that for a minimal system $(X,T)$, the set of saturated points along cubes with respect to its maximal $\infty$-step pro-nilfactor $X_\infty$ has a full measure. As an application, it is shown that if a minimal system $(X,T)$ has no…

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. Babai conjectured that if a primitive…

Given two distributions F and G on the nonnegative integers we propose an algorithm to construct in- and out-degree sequences from samples of i.i.d. observations from F and G, respectively, that with high probability will be graphical, that…

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

We prove that for every nonnegative integer $g$, there exists a bound on the number of ends of a complete, embedded minimal surface $M$ in $\mathbb{R}^3$ of genus $g$ and finite topology. This bound on the finite number of ends when $M$ has…

We study a generalization of globally coupled maps, where the elements are updated with probability $p$. When $p$ is below a threshold $p_c$, the collective motion vanishes and the system is the stationary state in the large size limit. We…

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

This paper establishes new common fixed point theorems for weakly compatible mappings in metric spaces, relaxing traditional requirements such as continuity, compatibility, and reciprocal continuity. We present a unified framework for three…

The general intractability of the constraint satisfaction problem has motivated the study of restrictions on this problem that permit polynomial-time solvability. One major line of work has focused on structural restrictions, which arise…

Let $G$ be a finite group, and let $H$ be a subgroup of $G$. We compute the probability, denoted by $P_G(H)$, that a left transversal of $H$ in $G$ is also a right transversal, thus a two-sided one. Moreover, we define, and denote by…

Given a gene-tree labeled topology $G$ and a species tree $S$, the "ancestral configurations" at an internal node $k$ of $S$ represent the combinatorially different sets of gene lineages that can be present at $k$ when all possible…

Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph. Assume that the graph is infinite and of bounded degree. Assume also strict positivity and finite…

For a domain $G$ in the one-point compactification $\overline{\mathbb{R}}^n = \mathbb{R}^n \cup \{ \infty\}$ of $\mathbb{R}^n, n \ge 2$, we characterize the completeness of the modulus metric $\mu_G$ in terms of a potential-theoretic…