Related papers: Multiscale genesis of a tiny giant for percolation…
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower bounds on the size of the largest cluster, removing a logarithmic correction in the lower bound in Heydenreich and van der Hofstad (2007). This…
The advent of novel opto-genetics technology allows the recording of brain activity with a resolution never seen before. The characterisation of these very large data sets offers new challenges as well as unique theory-testing…
In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c>3 are present in random Erdos and Renyi graphs only in the limit of diverging average connectivity. Starting…
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…
It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. study scale-free networks including some which approximate the measured degree distribution of the Internet.…
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…
We study random subgraphs of the 2-dimensional Hamming graph H(2,n), which is the Cartesian product of two complete graphs on $n$ vertices. Let $p$ be the edge probability, and write $p=\frac{1+\vep}{2(n-1)}$ for some $\vep\in \R$. In Borgs…
We investigate bond percolation on the Song-Havlin-Makse (SHM) network, a scale-free tree with a tunable degree exponent and dimensionality. Using a generating function approach, we analytically derive the average size and the fractal…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
In this paper we study the macroscopic conduction properties of large but finite binary networks with conducting bonds. By taking a combination of a spectral and an averaging based approach we derive asymptotic formulae for the conduction…
We study the following preferential attachment variant of the classical Erdos-Renyi random graph process. Starting with an empty graph on n vertices, new edges are added one-by-one, and each time an edge is chosen with probability roughly…
We have investigated both site and bond percolation on two dimensional lattice under the random rule and the product rule respectively. With the random rule, sites or bonds are added randomly into the lattice. From two candidates picked…
We study the percolation model on Boltzmann triangulations using a generating function approach. More precisely, we consider a Boltzmann model on the set of finite planar triangulations, together with a percolation configuration (either…
We study the XY-rotors model on small networks whose number of links scales with the system size $N_{links}\sim N^{\gamma}$, where $1\le\gamma\le2$. We first focus on regular one dimensional rings in the microcanonical ensemble. For…
We investigate the zero-temperature quantum phase transition of the random bond Ising chain in a transverse magnetic field. Its critical properties are identical to those of the McCoy-Wu model, which is a classical Ising model in two…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
Inspired by the recent viral epidemic outbreak and its consequent worldwide pandemic, we devise a model to capture the dynamics and the universality of the spread of such infectious diseases. The transition from a pre-critical to the…
The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…