Related papers: Minimal configurations and sandpile measures
Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…
In this work we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, got from the analytical solution,…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…
A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…
We present a construction method for mappings between generalized connections, comprising, e.g., the action of gauge transformations, diffeomorphisms and Weyl transformations. Moreover, criteria for continuity and measure preservation are…
In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix…
In the study of random structures we often face a trade-off between realism and tractability, the latter typically enabled by assuming some form of independence. In this work we initiate an effort to bridge this gap by developing tools that…
Using the setting of $G$-metric spaces, common fixed point theorems for four maps satisfying the weakly commuting conditions are obtained for various generalized contractive conditions. Several examples are also presented to show the…
The metric dimension of a graph G is the minimum size of a subset S of vertices of G such that all other vertices are uniquely determined by their distances to the vertices in S. In this paper we investigate the metric dimension for two…
We extend a result of Lyons (2016) from fractional tiling of finite graphs to a version for infinite random graphs. The most general result is as follows. Let $\bf P$ be a unimodular probability measure on rooted networks $(G, o)$ with…
The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…
Let $G$ be a countably infinite group, and let $\mu$ be a generating probability measure on $G$. We study the space of $\mu$-stationary Borel probability measures on a topological $G$ space, and in particular on $Z^G$, where $Z$ is any…
Ivanov and Tuzhilin started an investigation of a particular case of Gromov Minimal Fillings problem (generalized to the case of stratified manifolds). Weighted graphs with non-negative weight function were used as minimal fillings of…
Consider the matrix $A_{\mathcal{G}}$ chosen uniformly at random from the finite set of all $N$-dimensional matrices of zero main-diagonal and binary entries, having each row and column of $A_{\mathcal{G}}$ sum to $d$. That is, the…
It is well known that any projective measurement can be decomposed into a sequence of weak measurements, which cause only small changes to the state. Similar constructions for generalized measurements, however, have relied on the use of an…
The existence of the weak limit as n --> infinity of the uniform measure on rooted triangulations of the sphere with n vertices is proved. Some properties of the limit are studied. In particular, the limit is a probability measure on random…
Consider the supremal functional \[ \tag{1} \label{1} E_\infty(u,A) \,:=\, \|L(\cdot,u,D u)\|_{L^\infty(A)},\quad A\subseteq \Omega, \] applied to $W^{1,\infty}$ maps $u:\Omega\subseteq \mathbb{R}\longrightarrow \mathbb{R}^N$, $N\geq 1$.…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…
Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given finite minor, or a finite subgraph of given minimum degree.…