Related papers: Combinatorial models of rigidity and renormalizati…
Complex networks have acquired a great popularity in recent years, since the graph representation of many natural, social and technological systems is often very helpful to characterize and model their phenomenology. Additionally, the…
We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…
We study perturbations of the Erdos-Renyi model for which the statistical weight of a graph depends on the abundance of certain geometrical patterns. Using the formal correspondance with an exactly solvable effective model, we show the…
We study the perturbative quantization of gauge theories and gravity. Our investigations start with the geometry of spacetimes and particle fields. Then we discuss the various Lagrange densities of (effective) Quantum General Relativity…
An interfacial approximation of the streamer stage in the evolution of sparks and lightning can be written as a Laplacian growth model regularized by a `kinetic undercooling' boundary condition. We study the linear stability of uniformly…
We consider the robustness of computational hardness of problems whose input is obtained by applying independent random deletions to worst-case instances. For some classical $NP$-hard problems on graphs, such as Coloring, Vertex-Cover, and…
Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial time. As such, the densest subgraph model has…
We give an introduction to renormalisation, focusing first on a pedagogical description of fundamental concepts of the procedure and its features, then we introduce the renormalisation group and its equations. We discuss then the case of…
We investigate the geometric properties of loops on two-dimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
This paper introduces new solvers for efficiently computing solutions to large-scale inverse problems with group sparsity regularization, including both non-overlapping and overlapping groups. Group sparsity regularization refers to a type…
Percolation plays an important role in fields and phenomena as diverse as the study of social networks, the dynamics of epidemics, the robustness of electricity grids, conduction in disordered media, and geometric properties in statistical…
We consider a one-parameter family of piecewise isometries of a rhombus. The rotational component is fixed, and its coefficients belong to the quadratic number field $K=\mathbb{Q}(\sqrt{2})$. The translations depend on a parameter $s$ which…
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is a graph where for every two adjacent vertices u, v, their…
Percolation is an important topic in climate, physics, materials science, epidemiology, finance, and so on. Prediction of percolation thresholds with machine learning methods remains challenging. In this paper, we build a powerful graph…
Let $G=G(d)$ be a random graph with a given degree sequence $d$, such as a random $r$-regular graph where $r\ge 3$ is fixed and $n=|G|\to\infty$. We study the percolation phase transition on such graphs $G$, i.e., the emergence as $p$…
We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…
In this paper we consider independent site percolation in a triangulation of $\mathbb{R}^2$ given by adding $\sqrt{2}$-long diagonals to the usual graph $\mathbb{Z}^2$. We conjecture that $p_c=\frac{1}{2}$ for any such graph, and prove it…
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…
In part I and II of this series of papers all elements have been introduced to extend, to two loops, the set of renormalization procedures which are needed in describing the properties of a spontaneously broken gauge theory. In this paper,…