Related papers: Connectivity patterns in loop percolation I: the r…
Traditional percolation theory assumes static microscopic rules, limiting its ability to describe real-world complex systems where macroscopic order actively regulates local interactions. Here, we introduce feedback percolation, an unified…
We study a percolation model on $\mathbb R^d$ called the random connection model. For $d$ large, we use the lace expansion to prove that the critical two-point connection probability decays like $|x|^{-(d-2)}$ as $|x| \to \infty$, with…
Percolation establishes the connectivity of complex networks and is one of the most fundamental critical phenomena for the study of complex systems. On simple networks, percolation displays a second-order phase transition; on multiplex…
Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
This is the full version of a paper submitted to the Computability in Europe (CiE 2023) conference, with all proofs omitted there. In 2012 P. D. Azar and S. Micali introduced a new model of interactive proofs, called "Rational Interactive…
Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…
We consider the Random-Cluster model on $(\mathbb{Z}/n\mathbb{Z})^d$ with parameters $p \in (0,1)$ and $q\ge 1$. This is a generalization of the standard bond percolation (with open probability $p$) which is biased by a factor $q$ raised to…
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…
The classical spin $O(n)$ model is a model on a $d$-dimensional lattice in which a vector on the $(n-1)$-dimensional sphere is assigned to every lattice site and the vectors at adjacent sites interact ferromagnetically via their inner…
The couplings between the Ising model and its graphical representations, the random-cluster, random current and loop $\mathrm{O}(1)$ models, are put on common footing through a generalization of the Swendsen-Wang-Edwards-Sokal coupling. A…
We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…
We study a random graph model which is a superposition of the bond percolation model on $Z^d$ with probability $p$ of an edge, and a classical random graph $G(n, c/n)$. We show that this model, being a {\it homogeneous} random graph, has a…
A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…
We study the critical behavior of various geometrical and transport properties of percolation in 6 dimensions. By employing field theory and renormalization group methods we analyze fluctuation induced logarithmic corrections to scaling up…
The functionality of nodes in a network is often described by the structural feature of belonging to the giant component. However, when dealing with problems like transport, a more appropriate functionality criterion is for a node to belong…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…
We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…