Related papers: Strong approximation in random towers of graphs

We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…

We treat random rank-$D$ tensor models as $D$-dimensional quantum field theories---tensor field theories (TFT)---and review some of their non-perturbative methods. We classify the correlation functions of complex tensor field theories by…

Let $G$ be a connected graph, and let $\lambda_1$ and $\rho$ denote the spectral radius of $G$ and the universal cover of $G$, respectively. In \cite{Fri03}, Friedman has shown that almost every $n$-lift of $G$ has all of its new…

Universal approximation theorems provide a mathematical explanation for the expressive power of neural networks. They assert that, under mild conditions on the activation function, feedforward neural networks are dense in broad function…

This paper discusses various theorems on the approximation capabilities of neural networks (NNs), which are known as universal approximation theorems (UATs). The paper gives a systematic overview of UATs starting from the preliminary…

This article introduces strongly near smooth manifolds. The main results are (i) second countability of the strongly hit and far-miss topology on a family $\mathcal{B}$ of subsets on the Lodato proximity space of regular open sets to which…

This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…

In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…

A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…

In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is constructed from a bipartite graph. In our stochastic model,…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

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$…

In recent years there has been much progress in graph theory on questions of the following type. What is the threshold for a certain large substructure to appear in a random graph? When does a random graph contain all structures from a…

MaxDim, along with it relatives m and i, are group invariants analogous to the concept of dimension in vector spaces. In this paper we give the following result on the MaxDim of sporadic groups: 1. An inductive argument for the lower bounds…

Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for designing…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

We consider the scenario where all the couplings in the theory are strong at the cut-off scale, in the context of higher dimensional grand unified field theories where the unified gauge symmetry is broken by an orbifold compactification. In…

Aboulker, Adler, Kim, Sintiari, and Trotignon conjectured that every graph with bounded maximum degree and large treewidth must contain, as an induced subgraph, a large subdivided wall, or the line graph of a large subdivided wall. This…

Let $k \geq 1$. A graph $G$ is $\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex subsets $A_1, \dots, A_k$ in $G$, there exist $k$ pairwise disjoint maximum independent sets $S_1, \dots, S_k$ in $G$ such that $A_i \subseteq…

We study periodic approximations of aperiodic Schr\"odinger operators on lattices in Lie groups with dilation structure. The potentials arise through symbolic substitution systems that have been recently introduced in this setting. We…