Related papers: Combinatorial models of rigidity and renormalizati…
We introduce models of generic rigidity percolation in two dimensions on hierarchical networks, and solve them exactly by means of a renormalization transformation. We then study how the possibility for the network to self organize in order…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
For certain hierarchical structures, one can study the percolation problem using the renormalization-group method in a very precise way. We show that the idea can be also applied to two-dimensional planar lattices by regarding them as…
In this article, I give a pedagogical introduction and overview of percolation theory. Special emphasis will be put on the review of some of the most prominent of the algorithms that have been devised to study percolation numerically. At…
Renormalization group calculations are used to give exact solutions for rigidity percolation on hierarchical lattices. Algebraic scaling transformations for a simple example in two dimensions produce a transition of second order, with an…
A graph $G$ percolates in the $K_{r,s}$-bootstrap process if we can add all missing edges of $G$ in some order such that each edge creates a new copy of $K_{r,s}$, where $K_{r,s}$ is the complete bipartite graph. We study…
We present a setup that enables to define in a concrete way a renormalization flow for the FK-percolation models from statistical physics (that are closely related to Ising and Potts models). In this setting that is applicable in any…
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
The problem of recognizing (k, l)-tight graphs is a fundamental problem that has close connections to well studied problems like graph rigidity. The problem is better understood for planar graphs as compared to general graphs. For example,…
The immediate purpose of the paper was neither to review the basic definitions of percolation theory nor to rehearse the general physical notions of universality and renormalization (an important technique to be described in Part Two). It…
In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…
We illustrate how to extend the concept of structural stability through applying it to the front propagation speed selection problem. This consideration leads us to a renormalization group study of the problem. The study illustrates two…
We show that a superposition of an $\varepsilon$-Bernoulli bond percolation and any everywhere percolating subgraph of $\mathbb Z^d$, $d\ge 2$, results in a connected subgraph, which after a renormalization dominates supercritical Bernoulli…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
Cascading failures in complex systems have been studied extensively using two different models: $k$-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically and validate our…
Recently, it has been claimed that some complex networks are self-similar under a convenient renormalization procedure. We present a general method to study renormalization flows in graphs. We find that the behavior of some variables under…
A generalization of the Renormalization Group, which describes order-parameter fluctuations in finite systems, is developed in the specific context of percolation. This ``Stochastic Renormalization Group'' (SRG) expresses statistical…
We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…
An elegant bootstrap percolation result on the hyperrectangle graph was proved by Balogh, Bollob\'as, Morris, and Riordan using a linear algebric method in 2012. This paper studies the same problem by purely combinatorial means. The base…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…