Related papers: Explosive dismantling of two-dimensional random la…
In adversarial machine learning, the popular $\ell_\infty$ threat model has been the focus of much previous work. While this mathematical definition of imperceptibility successfully captures an infinite set of additive image transformations…
In a recent paper (arXiv:0911.2514), one of us (FYW) considered the Potts model and bond and site percolation on two general classes of two-dimensional lattices, the triangular-type and kagome-type lattices, and obtained closed-form…
We study the mutual percolation of a system composed of two interdependent random regular networks. We introduce a notion of distance to explore the effects of the proximity of interdependent nodes on the cascade of failures after an…
Empirical estimation of critical points at which complex systems abruptly flip from one state to another is among the remaining challenges in network science. However, due to the stochastic nature of critical transitions it is widely…
We consider disordered ladders of the transverse-field Ising model and study their critical properties and entanglement entropy for varying width, $w \le 20$, by numerical application of the strong disorder renormalization group method. We…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
Now that Bayesian Networks (BNs) have become widely used, an appreciation is developing of just how critical an awareness of the sensitivity and robustness of certain target variables are to changes in the model. When time resources are…
We study a model for coupled networks introduced recently by Buldyrev et al., Nature 464, 1025 (2010), where each node has to be connected to others via two types of links to be viable. Removing a critical fraction of nodes leads to a…
We show analytically that the $[0,1]$, $[1,1]$ and $[2,1]$ Pad{\'e} approximants of the mean cluster number $S(p)$ for site and bond percolation on general $d$-dimensional lattices are upper bounds on this quantity in any Euclidean…
Explosive Percolation describes the abrupt onset of large-scale connectivity that results from a simple random process designed to delay the onset of the transition on an underlying random network or lattice. Explosive percolation…
Motivated by recent experiments, we extend the Joanny-deGennes calculation of the elasticity of a contact line to an arbitrary contact angle and an arbitrary plate inclination in presence of gravity. This requires a diagonalization of the…
The simultaneous effect of both disorder and crystal-lattice pinning on the equilibrium behavior of oriented elastic objects is studied using scaling arguments and a functional renormalization group technique. Our analysis applies to…
Jamming and percolation transitions in the standard random sequential adsorption of particles on regular lattices are characterized by a universal set of critical exponents. The universality class is preserved even in the presence of…
Recently, the number of non-standard percolation models has proliferated. In all these models, there exists a phase transition at which long range connectivity is established, if local connectedness increases through a threshold $p_c$. In…
In the decay region around the centreline of three qualitatively different turbulent plane wakes, the turbulence is non-homogeneous and two-point turbulent diffusion counteracts the turbulence cascade all the way down to scales smaller than…
This work deals with the issue of assessing the influence of a node in the entire network and in the subnetwork to which it belongs as well, adapting the classical idea of vertex centrality. We provide a general definition of relative…
We study rigidity percolation transitions in two-dimensional central-force isostatic lattices, including the square and the kagome lattices, as next-nearest-neighbor bonds ("braces") are randomly added to the system. In particular, we focus…
Deep neural networks (DNNs) are vulnerable to subtle adversarial perturbations applied to the input. These adversarial perturbations, though imperceptible, can easily mislead the DNN. In this work, we take a control theoretic approach to…
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…
The site percolation threshold for the random Voronoi network is determined numerically for the first time, with the result p_c = 0.71410 +/- 0.00002, using Monte-Carlo simulation on periodic systems of up to 40000 sites. The result is very…