arXiv subjects

C. E. La Rocca

Publications and source records attributed to C. E. La Rocca.

9 recordsLinked to original sources

arXiv2026

Nonmonotonic percolation threshold in correlated networks and hypergraphs

We study the effect of assortative and disassortative mixing on the robustness of networks under random node failures. For ordinary (dyadic) networks, by using the generating function technique and stochastic simulations, we show that the relationship between the Pearson assortativity coefficient $r$ and the percolation threshold $p_c$ is not always monotonic. More specifically, in certain regions of the parameter space of our model, moderately disassortative networks can be more fragile than either strongly disassortative or uncorrelated networks. We observe this nonmonotonic behavior for trimodal networks as well as for networks with Poisson and power-law degree distributions. We then extend our analysis to hypergraphs with correlations between node hyperdegree and hyperedge cardinality. For this case, we find that positively correlated hypergraphs tend to be more fragile than negatively correlated ones. Additionally, as in the dyadic case, the relationship between $r$ and $p_c$ is nonmonotonic, and the most fragile configuration does not correspond to the most assortative hypergraph.

physics.soc-ph↗

arXiv2022

Cascading failures in isotropic and anisotropic spatial networks induced by localized attacks and overloads

In this paper we study the Motter-Lai model of cascading failures induced by overloads in both isotropic and anisotropic spatial networks, generated by placing nodes in a square lattice and using various distributions of link lengths and angles. Anisotropy has not been earlier considered in the Motter-Lai model and is a real feature that may affect the cascading failures. This could reflect the existence of a preferred direction in which a given attribute of the system manifests, such as power lines that follow a city built parallel to the coast. We show that the anisotropy causes a greater spread of damage along the preferential direction of links. We also identify the critical linear size, $l_c$, for a square shaped localized attack, which satisfies with high probability that above $l_c$ the cascading disrupts the giant component of functional nodes, while below $l_c$ the damage does not spread. We find that, for networks with any characteristic link length, their robustness decreases with the strength of the anisotropy. We show that the value of $l_c$ is finite and independent of the system size (for large systems), both for isotropic and anisotropic networks. Thus, in contrast to random attacks, where the critical fraction of nodes that survive the initial attack, $p_c$, is usually below 1, here $p_c = 1$. Note that the analogy to $p_c = 1$ is also found for localized attacks in interdependent spatial networks. Finally, we measure the final distribution of functional cluster sizes and find a power-law behavior, with exponents similar to regular percolation. This indicates that, after the cascade which destroys the giant component, the system is at a percolation critical point. Additionally, we observe a crossover in the value of the distribution exponent, from critical percolation in a two-dimensional lattice for strong spatial embedding, to mean-field percolation for weak embedding.

physics.soc-ph↗

arXiv2020

Disease spreading with social distancing: A prevention strategy in disordered multiplex networks

The frequent emergence of diseases with the potential to become threats at local and global scales, such as influenza A(H1N1), SARS, MERS, and recently COVID-19 disease, makes it crucial to keep designing models of disease propagation and strategies to prevent or mitigate their effects in populations. Since isolated systems are exceptionally rare to find in any context, especially in human contact networks, here we examine the susceptible-infected-recovered model of disease spreading in a multiplex network formed by two distinct networks or layers, interconnected through a fraction $q$ of shared individuals (overlap). We model the interactions through weighted networks, because person-to-person interactions are diverse (or disordered); weights represent the contact times of the interactions. Using branching theory supported by simulations, we analyze a social distancing strategy that reduces the average contact time in both layers, where the intensity of the distancing is related to the topology of the layers. We find that the critical values of the distancing intensities, above which an epidemic can be prevented, increase with the overlap $q$. Also we study the effect of the social distancing on the mutual giant component of susceptible individuals, which is crucial to keep the functionality of the system. In addition, we find that for relatively small values of the overlap $q$, social distancing policies might not be needed at all to maintain the functionality of the system.

physics.soc-ph↗

arXiv2016

Interacting social processes on interconnected networks

We propose and study a model for the interplay between two different dynamical processes --one for opinion formation and the other for decision making-- on two interconnected networks $A$ and $B$. The opinion dynamics on network $A$ corresponds to that of the M-model, where the state of each agent can take one of four possible values ($S=-2,-1,1,2$), describing its level of agreement on a given issue. The likelihood to become an extremist ($S=\pm 2$) or a moderate ($S=\pm 1$) is controlled by a reinforcement parameter $r \ge 0$. The decision making dynamics on network $B$ is akin to that of the Abrams-Strogatz model, where agents can be either in favor ($S=+1$) or against ($S=-1$) the issue. The probability that an agent changes its state is proportional to the fraction of neighbors that hold the opposite state raised to a power $β$. Starting from a polarized case scenario in which all agents of network $A$ hold positive orientations while all agents of network $B$ have a negative orientation, we explore the conditions under which one of the dynamics prevails over the other, imposing its initial orientation. We find that, for a given value of $β$, the two-network system reaches a consensus in the positive state (initial state of network $A$) when the reinforcement overcomes a crossover value $r^*(β)$, while a negative consensus happens for $r β_c$. We develop an analytical mean-field approach that gives an insight into these regimes and shows that both dynamics are equivalent along the crossover line $(r^*,β^*)$.

physics.soc-ph↗

arXiv2016

Synchronization in interacting Scale Free Networks

We study the fluctuations of the interface, in the steady state, of the Surface Relaxation Model (SRM) in two scale free interacting networks where a fraction $q$ of nodes in both networks interact one to one through external connections. We find that as $q$ increases the fluctuations on both networks decrease and thus the synchronization reaches an improvement of nearly $40\%$ when $q=1$. The decrease of the fluctuations on both networks is due mainly to the diffusion through external connections which allows to reducing the load in nodes by sending their excess mostly to low-degree nodes, which we report have the lowest heights. This effect enhances the matching of the heights of low-and high-degree nodes as $q$ increases reducing the fluctuations. This effect is almost independent of the degree distribution of the networks which means that the interconnection governs the behavior of the process over its topology.

physics.soc-ph↗

arXiv2016

Recovery of Interdependent Networks

Recent network research has focused on the cascading failures in a system of interdependent networks and the necessary preconditions for system collapse. An important question that has not been addressed is how to repair a failing system before it suffers total breakdown. Here we introduce a recovery strategy of nodes and develop an analytic and numerical framework for studying the concurrent failure and recovery of a system of interdependent networks based on an efficient and practically reasonable strategy. Our strategy consists of repairing a fraction of failed nodes, with probability of recovery $γ$, that are neighbors of the largest connected component of each constituent network. We find that, for a given initial failure of a fraction $1-p$ of nodes, there is a critical probability of recovery above which the cascade is halted and the system fully restores to its initial state and below which the system abruptly collapses. As a consequence we find in the plane $γ-p$ of the phase diagram three distinct phases. A phase in which the system never collapses without being restored, another phase in which the recovery strategy avoids the breakdown, and a phase in which even the repairing process cannot avoid the system collapse.

physics.soc-ph↗

arXiv2014

The influence of persuasion in opinion formation and polarization

We present a model that explores the influence of persuasion in a population of agents with positive and negative opinion orientations. The opinion of each agent is represented by an integer number $k$ that expresses its level of agreement on a given issue, from totally against $k=-M$ to totally in favor $k=M$. Same-orientation agents persuade each other with probability $p$, becoming more extreme, while opposite-orientation agents become more moderate as they reach a compromise with probability $q$. The population initially evolves to (a) a polarized state for $r=p/q>1$, where opinions' distribution is peaked at the extreme values $k=\pm M$, or (b) a centralized state for $r<1$, with most opinions around $k=\pm 1$. When $r \gg 1$, polarization lasts for a time that diverges as $r^M \ln N$, where $N$ is the population's size. Finally, an extremist consensus ($k=M$ or $-M$) is reached in a time that scales as $r^{-1}$ for $r \ll 1$.

physics.soc-ph↗

arXiv2008

Evolution equation for a model of surface relaxation in complex networks

In this paper we derive analytically the evolution equation of the interface for a model of surface growth with relaxation to the minimum (SRM) in complex networks. We were inspired by the disagreement between the scaling results of the steady state of the fluctuations between the discrete SRM model and the Edward-Wilkinson process found in scale-free networks with degree distribution $ P(k) \sim k^{-λ}$ for $λ<3$ [Pastore y Piontti {\it et al.}, Phys. Rev. E {\bf 76}, 046117 (2007)]. Even though for Euclidean lattices the evolution equation is linear, we find that in complex heterogeneous networks non-linear terms appear due to the heterogeneity and the lack of symmetry of the network; they produce a logarithmic divergency of the saturation roughness with the system size as found by Pastore y Piontti {\it et al.} for $λ<3$.

cond-mat.stat-mech↗

arXiv2008

Using relaxational dynamics to reduce network congestion

We study the effects of relaxational dynamics on congestion pressure in scale free networks by analyzing the properties of the corresponding gradient networks (Z. Toroczkai, K. E. Bassler, Nature {\bf 428}, 716 (2004)). Using the Family model (F. Family, J. Phys. A, {\bf 19}, L441 (1986)) from surface-growth physics as single-step load-balancing dynamics, we show that the congestion pressure considerably drops on scale-free networks when compared with the same dynamics on random graphs. This is due to a structural transition of the corresponding gradient network clusters, which self-organize such as to reduce the congestion pressure. This reduction is enhanced when lowering the value of the connectivity exponent $λ$ towards 2.

cond-mat.stat-mech↗