Related papers: Explosive dismantling of two-dimensional random la…
Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a…
We study the response of complex networks subject to attacks on vertices and edges. Several existing complex network models as well as real-world networks of scientific collaborations and Internet traffic are numerically investigated, and…
In wall-bounded parallel flows, sustained turbulence can occur even while laminar flow is still stable. Channel flow is one of such flows and displays spatio-temporal fluctuating patterns of localized turbulence along its way from/to…
A load applied to a jammed frictional granular system will be localized into a network of force chains making inter-particle connections throughout the system. Because such systems are typically under-constrained, the observed force network…
We present a detailed study of a two-dimensional minimal lattice model for the description of mud cracking in the limit of extremely thin layers. In this model each bond of the lattice is assigned to a (quenched) breaking threshold.…
Betweenness centrality quantifies the importance of a vertex for the information flow in a network. We propose a flexible definition of betweenness for temporal multiplexes, where geodesics are determined accounting for the topological and…
Lattices are important as models for the node locations in wireless networks for two main reasons: (1) When network designers have control over the placement of the nodes, they often prefer a regular arrangement in a lattice for coverage…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…
The hypothesis of critical failure relates the presence of an ultimate stability point in the structural constitutive equation of materials to a divergence of characteristic scales in the microscopic dynamics responsible for deformation.…
Robustness is an important property of complex networks. Up to now, there are plentiful researches focusing on the network's robustness containing error and attack tolerance of network's connectivity and the shortest path. In this paper,…
Traditional measures of closeness and betweenness centrality in networks rely on the shortest paths between nodes. Many standard metrics fail to accurately reflect the physical or probabilistic characteristics of nodal centrality and…
The study of crossing probabilities - i.e. probabilities of existence of paths crossing rectangles - has been at the heart of the theory of two-dimensional percolation since its beginning. They may be used to prove a number of results on…
Natural and technological interdependent systems have been shown to be highly vulnerable due to cascading failures and an abrupt collapse of global connectivity under initial failure. Mitigating the risk by partial disconnection endangers…
The permutation model is a classical spin system where elements of the symmetric group interact with one another. The partition function of this model is directly related to the entanglement structure of random quantum circuits and random…
We study the Anderson transition in lattices with the connectivity of a random-regular graph. Our results indicate that fractal dimensions are continuous across the transition, but a discontinuity occurs in their derivatives, implying the…
Disordered materials occur naturally and also provide a broader design space than ordered or crystalline structures. We investigate a two-dimensional disordered network metamaterial constructed from a Delaunay triangulation of an underlying…
We use a new algorithm to find the stress-carrying backbone of ``generic'' site-diluted triangular lattices of up to 10^6 sites. Generic lattices can be made by randomly displacing the sites of a regular lattice. The percolation threshold…
Many real-world multilayer systems such as critical infrastructure are interdependent and embedded in space with links of a characteristic length. They are also vulnerable to localized attacks or failures, such as terrorist attacks or…
We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…
We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\sim\beta/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is…