Related papers: Combinatorial Methods in Bootstrap Percolation Pro…
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…
The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper,…
We study the percolation critical surface of the kagome lattice in which each triangle is allowed an arbitrary connectivity. Using the method of critical polynomials, we find points along this critical surface to high precision. This kagome…
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman's algorithm. Algebraic properties of periodic, strongly connected digraphs are…
Given $r\geq2$ and an $r$-uniform hypergraph $F$, the $F$-bootstrap process starts with an $r$-uniform hypergraph $H$ and, in each time step, every hyperedge which "completes" a copy of $F$ is added to $H$. The maximum running time of this…
Many high-dimensional practical data sets have hierarchical structures induced by graphs or time series. Such data sets are hard to process in Euclidean spaces and one often seeks low-dimensional embeddings in other space forms to perform…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
We test the bootstrap approach for determining the spectrum of one dimensional Hamiltonians, following the recent approach of Han, Hartnoll, and Kruthoff. We focus on comparing the bootstrap method data to known analytical predictions for…
We present applications of rectangular matrix models to various combinatorial problems, among which the enumeration of face-bicolored graphs with prescribed vertex degrees, and vertex-tricolored triangulations. We also mention possible…
We revisit the Bootstrap Percolation model, leveraging recent mathematical advances linking it with its local counterpart. This new perspective resolves, for the first time, historic discrepancies between Monte Carlo simulations and…
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…
Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer…
We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
The $r$-neighbour bootstrap percolation process on a graph $G$ starts with an initial set $A_0$ of "infected" vertices and, at each step of the process, a healthy vertex becomes infected if it has at least $r$ infected neighbours (once a…
Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph…
In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We present an efficient algorithm to solve elliptic Dirichlet problems defined on the cluster of $\mathbb{Z}^d$ supercritical Bernoulli percolation, as a generalization of the iterative method proposed by S. Armstrong, A. Hannukainen, T.…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…