# Dilution of Ferromagnets via a Random Graph-Based Strategy

Authors: Marco Alberto Javarone; Daniele Marinazzo
Journal: Complexity
 (2018)

---

## Abstract

The dynamics and behavior of ferromagnets have a great relevance even beyond the domain of statistical physics. In this work, we propose a Monte Carlo method, based on random graphs, for modeling their dilution. In particular, we focus on ferromagnets with dimensionD≥4, which can be approximated by the Curie-Weiss model. Since the latter has as graphic counterpart, a complete graph, a dilution can be in this case viewed as a pruning process. Hence, in order to exploit this mapping, the proposed strategy uses a modified version of the Erdős-Renyi graph model. In doing so, we are able both to simulate a continuous dilution and to realize diluted ferromagnets in one step. The proposed strategy is studied by means of numerical simulations, aiming to analyze main properties and equilibria of the resulting diluted ferromagnets. To conclude, we also provide a brief description of further applications of our strategy in the field of complex networks.


---

## Body

## 1. Introduction

The study of diluted ferromagnets [1–6] dates back to several years ago, following two main paths sometimes overlapping, that is, the statistical mechanics approach to lattices and the graph theory approach to networks [7, 8]. A notable result, coming from their combination, is the modern network theory [9–11]. In particular, the latter extends the classical graph theory to the analysis of networks characterized by nontrivial topologies and containing a big amount of nodes. So, the role of statistical mechanics is to offer methods and strategies for investigating the properties and the dynamics of these “complex networks” [12, 13]. Usually, investigations on ferromagnets are performed using the Ising model [14], mainly because the latter constitutes a simple and powerful tool for studying phase transitions and further applications, also beyond the domain of statistical mechanics (e.g., Data Science [15] and Machine Learning [16, 17]). Despite its simplicity, the Ising model becomes, itself, a very hard problem (not yet solved) when studied in dimensions greater than 3. In those cases, the Curie-Weiss [18, 19] model allows approximating its behavior, with the advantage of being also analytically tractable (i.e., it can be exactly solved for any size of system). As a result, in some conditions, solving the Ising model might require performing numerical simulations using Monte Carlo methods [20]. For instance, the Metropolis algorithm [21] constitutes one of the early, and most adopted, strategies for simulating thermalization processes over a lattice. This latter algorithm is based on the optimization of the Hamiltonian function representing the energy of the system. Notably, the Hamiltonian of the Ising model reads(1)HIs=-∑ijJi,jσiσj,where the summation is extended to all the nearest neighbors (i,j) in the lattice (realized with periodic boundary conditions, so actually becoming, in topological terms, a toroid). As a result, the value of Hamiltonian 1 depends on the set s, that is, the configuration of spins σ in the lattice. Accordingly, the two ground states of the system correspond to the spin configurations s^+=[+1,+1,…,+1] and s^-=[-1,-1,…,-1]. Therefore, considering a lattice with N sites and starting with a random configuration sx∈S, defined as sx=[σ1x,…,σNx], the Metropolis algorithm leads the system towards a state of equilibrium which, for a temperature T=0, corresponds to one of the two ground states. This algorithm is based on two simple steps: (1)
Randomly select a sitei, and compute the local ΔE associated with its spin flip.(2)
IfΔE≤0, accept the flip;else, accept the flip with probabilitye-ΔE/kT.They are repeated until the equilibrium state is reached. We recall thatk and T, appearing in the probability shown in step (2) of the Metropolis algorithm, refer to the Boltzmann constant and to the system temperature, respectively. In addition, the term “local” ΔE, used in step (1), indicates that the difference in energy is computed considering only the site i and its nearest neighbors. Thus, in principle, some flips may increase the global energy of the whole system. In general, the process simulated by the Metropolis algorithm takes into account the fact that the ferromagnetic interactions J arequenched, that is, the thermalization is fast enough to allow considering the interactions as constant. In the opposite case, that is, with nonconstant interactions, we have different scenarios. For instance, a spin system can become glassy by introducing antiferromagnetic interactions (i.e., J=-1) or can undergo a dilution process by removing interactions (i.e., setting J=0). In this work, we focus on dilution of ferromagnets introducing a strategy, based on the Erdős-Renyi model [22], for modeling this process. It is worth recalling that previous investigations (e.g., [23–26]) highlighted the critical behavior of diluted ferromagnets, including, for example, the ergodicity breaking and the vanishing of a giant component. So, beyond providing a novel method for dilution, we give also a description of some statistical properties of the resulting system, of the dynamical processes living on it, and on potential applications. To this end, the analyses are performed in two different conditions: for introducing the dilution strategy and studying some properties of the ferromagnets, the spin variables (i.e., σ) are consideredquenched, while for studying thermalization processes after a dilution, thequenched variables are the interactions J. Finally, the proposed strategy and the related analyses are performed by means of numerical simulations. Beyond describing the behavior of our model, we emphasize that the achieved results allow also envisioning potential applications in the area of complex networks. The reminder of the paper is organized as follows: Section 2 introduces the proposed strategy. Section 3 shows results of numerical simulations. Eventually, Section 4 provides a description of the main findings.


## 2. Modeling Dilution on Ferromagnets

Let us consider ferromagnets of dimensionD≥4, modeled via the Curie-Weiss (CW hereinafter) model. The latter is composed of N sites, with a position i and a spin σ±1. Here, the interactions are not limited to the nearest neighbors (like in the Ising model) but are extended to all the system; that is, every site interacts with all the others. Accordingly, the Hamiltonian of the CW model reads(2)HCWs=-J2N∑i≠jN,Nσiσj,with s∈S, that is, combination of spins σ. Then, like in the Ising model, the two ground states correspond to the spin configurations s^+ and s^-, that is, those that minimize the value of HCW (see (2)). It is worth highlighting that the CW model can be represented as a complete (i.e., fully connected) graph, where each site corresponds to a node and each interaction corresponds to an edge. In addition, the number of interactions is equal to L=N·(N-1)/2. The mapping from the physical object (i.e., the ferromagnet) to the mathematical entity (i.e., the graph) allows mapping a dilution to a pruning process. However, before presenting the dilution strategy developed with the framework of graph theory, we discuss the application of a more classical method, that is, the previously mentioned Metropolis algorithm.


### 2.1. Dilution by the Metropolis Algorithm

In principle, the Metropolis algorithm, and similar methods, may be used for modeling the dilution of ferromagnets. Notably, since this algorithm modifies spins from+1 to -1, and vice versa, according to the energy difference resulting from the spin flipping, an opportune variant—say Metropolis-like—might be used for flipping the interaction variables J. In the case of spin flipping the possible values that σ can take are ±1 whereas, in the case of interactions J, the latter may take three different values: +1 (i.e., ferromagnetic), -1 (i.e., antiferromagnetic), 0 (i.e., removal). Thus, a Metropolis-like algorithm devised for flipping interactions may, in principle, generate a spin glass [27–29] (flipping J from +1 to -1) and perform a dilution (flipping J from +1 to 0). In addition, both processes (i.e., from +1 to -1 and to 0) can be combined, modeling the emergence of a diluted spin glass. Hence, focusing on dilution, from now on, we consider only the case J=+1→J=0. In doing so, starting with a random distribution of spins, a Metropolis-like algorithm (M-L hereinafter) can be defined as follows:(1)
Randomly select an interactionJ between two sites, and compute the local ΔE associated with its flip to 0.(2)
IfΔE≤0, accept the flip;else, accept the flip with probabilitye-ΔE/kT.As in the thermalization processes, the M-L strategy depends on the Hamiltonian of the system. Furthermore, one might consider also flipping ofJ from 0 to +1, that is, modeling a kind of (edge) repopulation. However, since the addition of interactions between inverse spins would increase the Hamiltonian, the actual realization of flipping 0→+1 would be quite rare.


### 2.2. Dilution via a Random Graphs-Based Strategy

As mentioned above, modern network theory and its methods are spreading in many other scientific fields. Then, it is interesting to see whether and how network theory can be useful for facing the problem of diluting ferromagnets. Notably, our work, beyond to introduce a further method for this task, allows also proving the effectiveness of network theory in a further application. As a result, the proposed model has a double valence; that is, the process of ferromagnet dilution can be analyzed by the tools developed in network theory and allows envisioning new applications. For instance, as shown later, the subfield of community analysis can benefit from the proposed strategy. Given this premise, we can now proceed with a brief description of ferromagnets with the formal language of graph theory. In general, a graphG is an entity composed of two sets: N (i.e., nodes) and L (i.e., edges). As above reported, the maximum number of edges (i.e., LM) depends on N. In addition, the edges can be provided with some properties, as a direction, a weight, and so on, in order to represent specific characteristics of the object they refer to (a ferromagnet or a real network as a social network [30], a biological network [31], an immune network [32, 33], a financial network [34], and many others). In the proposed model, edges have no particular properties (i.e., they are indirect and unweighted), and the graph is implemented via the E-R model. The latter is realized by defining a number of nodes N and a parameter β, which represents the probability of each edge to exist. Thus, the expected number of edges in an E-R graph is equal to E(L)=LM·β. Notably, decreasing (increasing) β entails removing (add) edges in the graph. The algorithm for generating an E-R graph is very simple:(1)
Define the number ofN of nodes and the probability β.(2)
Draw each edge with probabilityβ.In particular, in step (2), all possibleLM edges are considered. Therefore, an E-R graph generated with β=1.0 contains exactly LM edges (i.e., it is complete) and constitutes the graphical counterpart of the CW model previously described. The tuning of the parameter β allows representing ferromagnets with different amounts of interactions. Thus graphs generated with β<1 (i.e., having L<LM) represent diluted ferromagnets. This last observation constitutes the base of our model, that is, an E-R-like (ER-L hereinafter) model devised for dilution processes. For the sake of clarity, now we provide a pictorial representation for highlighting their main differences between two mentioned strategies, that is, M-L and ER-L—see Figure 1. So, a quick glance to the pictorial representation allows observing what follows: (i) the ER-L strategy starts with nonconnected nodes and then populates the graphs with new edges, while the M-L strategy starts with a complete graph and then removes the edges; (ii) the ER-L strategy allows obtaining more configurations than the M-L strategy, the latter being “Hamiltonian-dependent.” In particular, once the Hamiltonian has been optimized, further actions (i.e., edge removal) have very low probability. On the other hand, the ER-L strategy, being (partially) “Hamiltonian-independent,” allows the realization of ferromagnets with higher degree of dilution. For this reason, M-L is closer to a physical realization of a dilution than ER-L.Figure 1
Pictorial representation of a dilution process implemented via the ER-L strategy (continuous line) and via the M-L strategy (dashed line). Labels (i.e., (a), (b), and (c)) indicate three different phases of the graph. Arrows indicate the direction of the process. The M-L strategy cannot lead to phase (a), as indicated by the red cross on the related arrow. Here, spin values are not represented (i.e., all nodes have the same color).


#### 2.2.1. ER-L Strategy

We are now ready to present the ER-L strategy in detail. Firstly, the ER-L uses a parameterγ∈[0.0,1.0], representing a kind of control in the dilution process. Notably, γ=0.0 entails the process is not controlled, while γ=1.0 entails a fully controlled process. It is worth noting that while the dilution of a ferromagnet does not require any control, being driven towards the optimization of a Hamiltonian, using a probabilistic model (i.e., the ER-L), whose dynamics depends only in part on the local energy, the so-called control parameter γ becomes fundamental for approaching the behavior of a physical dilution. Therefore, γ compensates for the partial energy independence of the proposed strategy. Accordingly, the edge probability β is “corrected” as follows:(3)β⋆=ω·Fsω,with Fs step function and ω equal to(4)ω=β+σxσy1.0-βγ.In doing so, β⋆=0 when ω has a null or a negative value and, at the same time, the normalization condition (i.e., ω≤1) is respected for any value of β and of σ. Thus, varying the parameter β⋆, we can study the Hamiltonian of the resulting diluted ferromagnet and its behavior. In few words, the parameter γ makes the proposed method closer to a physical dilution, since it combines β with the contribution of the two spins involved in the interaction. For instance, from a physical point of view, an interaction between two opposite spins must be removed with a probability higher than an interaction between two equal spins. At the same time, the resulting parameter ω can take values smaller than zero; hence it cannot be directly adopted as the probability to remove an edge. As a result, we introduced a “corrected” probability β⋆ that takes as input any possible value of ω and has a range limited between zero and one. The degree of freedom offered by the parameter γ allows both representing dilution processes in physical systems, as one can do also with a more classical approach (e.g., that described before), and considering other systems, as social networks, where further properties and mechanisms can be involved in the process. In particular, in the case of social networks, dynamical processes like dilution might consider both the node similarity (e.g., the spin) and a probabilistic process mapped to the β parameter. Before illustrating the results of numerical simulations, it is important to elucidate a further aspect of our investigation. As previously reported, when studying the equilibrium configuration of a spin system, the interaction variables J are consideredquenched. So, with the aim of analyzing the behavior of diluted ferromagnets, the variation of J must be faster than that of σ; that is, the latter isquenched. Now, having defined the ER-L model, we discuss how it can be used. First, one can realize a diluted ferromagnet via ER-L, studying then its properties. Second, one can analyze the behavior of the ferromagnet during the dilution process. While a single realization, of a diluted ferromagnet, is very similar to the realization of a graph via the E-R model, that is, drawing edges according to the β⋆ probability, it is worth explaining how to implement a continuous dilution process by the ER-L model. To this end, let us consider a dilution as the motion of a graph G over a phase space, along an axis β. The phase space is larger for low values of β and becomes narrower as β increases, until it contains only one state when β=1 (i.e., fully connected). The lower β, the larger the number of possible realizations of G with the same amount of edges (i.e., the higher its entropy; see also [35] for further details). So in a continuous dilution, beyond considering the effect of γ, one can be able to move from a state, say G(βt1), to a state G(βt2) without losing information about the edges existing at t1. For instance, if βt1=0.9 and βt2=0.8, the ER-L must account for the removal of a density of edges equal to 0.1, preserving the remaining structure of the graph. Therefore, the simple generation of a first graph with β=0.9 and then with β=0.8, is not allowed because the two resulting graphs are not correlated. Thus, in the considered example, the continuous dilution process entails moving in the phase space of the graph by removing each edge with a probability much smaller than βt2, in order to consider also the effect of βt1. To generalize, given βt1 and βt2, with βt1>βt2, if an edge eij (i.e., connecting sites i and j) belonging to the graph in the state Gt1 has to be confirmed in the state Gt2, one cannot simply use βt2 because, after the process, the edge eij would be present with probability P(eij)=βt1·βt2, that is, obviously smaller than βt2. For this reason, we need to compute the factor ϵ such that P(eij)=βt1·ϵ=βt2. In this way, at t2, each edge remains in the graph with probability ϵ=βt2/βt1. In a similar fashion, we implement the inverse process, that is, repopulating the graph with missing edges, from the state Gtn to state Gtn+1, now having βtn<βtn+1. In particular, a new edge (always defined ei,j) must be added to G with a probability P(ei,j)=ϵ, coming from the following relation: (1-βtn)·(1-ϵ)=(1-βtn+1), so that ϵ=1-βtn/βtn+1. In summary, while a diluted ferromagnet can be realized with a single instance of the ER-L model, a continuous dilution can be implemented as follows:(1)
Generate a graphG(N,β0) and define the sampling rate for the dilution, that is, Δβ.(2)
Whileβt>θ.(3)
_ _ Remove each edge inG with probability ϵ=βt/βt-Δβ.(4)
_ _βt=βt-Δβ.The parameterθ represents the final edge probability β, that is, the probability one should use for generating via the E-R model a graph similar to that resulting from the dilution process. β0 corresponds to the starting value of β for generating the initial graph, and βt corresponds to the value of β at step t. The inverse process, that is, the graph repopulation, can be summarized as follows:(1)
Generate a graphG(N,β0) and define the sampling rate for the repopulation, that is, Δβ.(2)
Whileβt<ζ.(3)
_ _ Add each new potential edge inG with probability ϵ=1-βt/βt+Δβ.(4)
_ _βt=βt+Δβ.Asθ, ζ represents the final value of β one should use for generating a similar graph (i.e., with same statistical properties), achieved after repopulation, using the E-R model. Moreover, we clarify that “new potential edge” refers to the edges that can be added to the graph for making it again fully connected; that is, it refers only to missing edges. Eventually, we analyze also thermalization processes (considering, after each dilution, the variables J asquenched). To this end, the system magnetization defined as(5)M=∑iσiNoffers a macroscopic view on the process. Notably, we recall that the magnetization is an order-parameter and allows both to observe the emergence of a phase transition and to evaluate its nature (e.g., first order). In addition, it is worth emphasizing thatquenched spins, randomly initialized with a uniform distribution, entail that the magnetization is on average always null (i.e., the system remains in a disordered phase). Further analyses devised for studying the behavior of our model are introduced in the following section.


## 2.1. Dilution by the Metropolis Algorithm

In principle, the Metropolis algorithm, and similar methods, may be used for modeling the dilution of ferromagnets. Notably, since this algorithm modifies spins from+1 to -1, and vice versa, according to the energy difference resulting from the spin flipping, an opportune variant—say Metropolis-like—might be used for flipping the interaction variables J. In the case of spin flipping the possible values that σ can take are ±1 whereas, in the case of interactions J, the latter may take three different values: +1 (i.e., ferromagnetic), -1 (i.e., antiferromagnetic), 0 (i.e., removal). Thus, a Metropolis-like algorithm devised for flipping interactions may, in principle, generate a spin glass [27–29] (flipping J from +1 to -1) and perform a dilution (flipping J from +1 to 0). In addition, both processes (i.e., from +1 to -1 and to 0) can be combined, modeling the emergence of a diluted spin glass. Hence, focusing on dilution, from now on, we consider only the case J=+1→J=0. In doing so, starting with a random distribution of spins, a Metropolis-like algorithm (M-L hereinafter) can be defined as follows:(1)
Randomly select an interactionJ between two sites, and compute the local ΔE associated with its flip to 0.(2)
IfΔE≤0, accept the flip;else, accept the flip with probabilitye-ΔE/kT.As in the thermalization processes, the M-L strategy depends on the Hamiltonian of the system. Furthermore, one might consider also flipping ofJ from 0 to +1, that is, modeling a kind of (edge) repopulation. However, since the addition of interactions between inverse spins would increase the Hamiltonian, the actual realization of flipping 0→+1 would be quite rare.


## 2.2. Dilution via a Random Graphs-Based Strategy

As mentioned above, modern network theory and its methods are spreading in many other scientific fields. Then, it is interesting to see whether and how network theory can be useful for facing the problem of diluting ferromagnets. Notably, our work, beyond to introduce a further method for this task, allows also proving the effectiveness of network theory in a further application. As a result, the proposed model has a double valence; that is, the process of ferromagnet dilution can be analyzed by the tools developed in network theory and allows envisioning new applications. For instance, as shown later, the subfield of community analysis can benefit from the proposed strategy. Given this premise, we can now proceed with a brief description of ferromagnets with the formal language of graph theory. In general, a graphG is an entity composed of two sets: N (i.e., nodes) and L (i.e., edges). As above reported, the maximum number of edges (i.e., LM) depends on N. In addition, the edges can be provided with some properties, as a direction, a weight, and so on, in order to represent specific characteristics of the object they refer to (a ferromagnet or a real network as a social network [30], a biological network [31], an immune network [32, 33], a financial network [34], and many others). In the proposed model, edges have no particular properties (i.e., they are indirect and unweighted), and the graph is implemented via the E-R model. The latter is realized by defining a number of nodes N and a parameter β, which represents the probability of each edge to exist. Thus, the expected number of edges in an E-R graph is equal to E(L)=LM·β. Notably, decreasing (increasing) β entails removing (add) edges in the graph. The algorithm for generating an E-R graph is very simple:(1)
Define the number ofN of nodes and the probability β.(2)
Draw each edge with probabilityβ.In particular, in step (2), all possibleLM edges are considered. Therefore, an E-R graph generated with β=1.0 contains exactly LM edges (i.e., it is complete) and constitutes the graphical counterpart of the CW model previously described. The tuning of the parameter β allows representing ferromagnets with different amounts of interactions. Thus graphs generated with β<1 (i.e., having L<LM) represent diluted ferromagnets. This last observation constitutes the base of our model, that is, an E-R-like (ER-L hereinafter) model devised for dilution processes. For the sake of clarity, now we provide a pictorial representation for highlighting their main differences between two mentioned strategies, that is, M-L and ER-L—see Figure 1. So, a quick glance to the pictorial representation allows observing what follows: (i) the ER-L strategy starts with nonconnected nodes and then populates the graphs with new edges, while the M-L strategy starts with a complete graph and then removes the edges; (ii) the ER-L strategy allows obtaining more configurations than the M-L strategy, the latter being “Hamiltonian-dependent.” In particular, once the Hamiltonian has been optimized, further actions (i.e., edge removal) have very low probability. On the other hand, the ER-L strategy, being (partially) “Hamiltonian-independent,” allows the realization of ferromagnets with higher degree of dilution. For this reason, M-L is closer to a physical realization of a dilution than ER-L.Figure 1
Pictorial representation of a dilution process implemented via the ER-L strategy (continuous line) and via the M-L strategy (dashed line). Labels (i.e., (a), (b), and (c)) indicate three different phases of the graph. Arrows indicate the direction of the process. The M-L strategy cannot lead to phase (a), as indicated by the red cross on the related arrow. Here, spin values are not represented (i.e., all nodes have the same color).


### 2.2.1. ER-L Strategy

We are now ready to present the ER-L strategy in detail. Firstly, the ER-L uses a parameterγ∈[0.0,1.0], representing a kind of control in the dilution process. Notably, γ=0.0 entails the process is not controlled, while γ=1.0 entails a fully controlled process. It is worth noting that while the dilution of a ferromagnet does not require any control, being driven towards the optimization of a Hamiltonian, using a probabilistic model (i.e., the ER-L), whose dynamics depends only in part on the local energy, the so-called control parameter γ becomes fundamental for approaching the behavior of a physical dilution. Therefore, γ compensates for the partial energy independence of the proposed strategy. Accordingly, the edge probability β is “corrected” as follows:(3)β⋆=ω·Fsω,with Fs step function and ω equal to(4)ω=β+σxσy1.0-βγ.In doing so, β⋆=0 when ω has a null or a negative value and, at the same time, the normalization condition (i.e., ω≤1) is respected for any value of β and of σ. Thus, varying the parameter β⋆, we can study the Hamiltonian of the resulting diluted ferromagnet and its behavior. In few words, the parameter γ makes the proposed method closer to a physical dilution, since it combines β with the contribution of the two spins involved in the interaction. For instance, from a physical point of view, an interaction between two opposite spins must be removed with a probability higher than an interaction between two equal spins. At the same time, the resulting parameter ω can take values smaller than zero; hence it cannot be directly adopted as the probability to remove an edge. As a result, we introduced a “corrected” probability β⋆ that takes as input any possible value of ω and has a range limited between zero and one. The degree of freedom offered by the parameter γ allows both representing dilution processes in physical systems, as one can do also with a more classical approach (e.g., that described before), and considering other systems, as social networks, where further properties and mechanisms can be involved in the process. In particular, in the case of social networks, dynamical processes like dilution might consider both the node similarity (e.g., the spin) and a probabilistic process mapped to the β parameter. Before illustrating the results of numerical simulations, it is important to elucidate a further aspect of our investigation. As previously reported, when studying the equilibrium configuration of a spin system, the interaction variables J are consideredquenched. So, with the aim of analyzing the behavior of diluted ferromagnets, the variation of J must be faster than that of σ; that is, the latter isquenched. Now, having defined the ER-L model, we discuss how it can be used. First, one can realize a diluted ferromagnet via ER-L, studying then its properties. Second, one can analyze the behavior of the ferromagnet during the dilution process. While a single realization, of a diluted ferromagnet, is very similar to the realization of a graph via the E-R model, that is, drawing edges according to the β⋆ probability, it is worth explaining how to implement a continuous dilution process by the ER-L model. To this end, let us consider a dilution as the motion of a graph G over a phase space, along an axis β. The phase space is larger for low values of β and becomes narrower as β increases, until it contains only one state when β=1 (i.e., fully connected). The lower β, the larger the number of possible realizations of G with the same amount of edges (i.e., the higher its entropy; see also [35] for further details). So in a continuous dilution, beyond considering the effect of γ, one can be able to move from a state, say G(βt1), to a state G(βt2) without losing information about the edges existing at t1. For instance, if βt1=0.9 and βt2=0.8, the ER-L must account for the removal of a density of edges equal to 0.1, preserving the remaining structure of the graph. Therefore, the simple generation of a first graph with β=0.9 and then with β=0.8, is not allowed because the two resulting graphs are not correlated. Thus, in the considered example, the continuous dilution process entails moving in the phase space of the graph by removing each edge with a probability much smaller than βt2, in order to consider also the effect of βt1. To generalize, given βt1 and βt2, with βt1>βt2, if an edge eij (i.e., connecting sites i and j) belonging to the graph in the state Gt1 has to be confirmed in the state Gt2, one cannot simply use βt2 because, after the process, the edge eij would be present with probability P(eij)=βt1·βt2, that is, obviously smaller than βt2. For this reason, we need to compute the factor ϵ such that P(eij)=βt1·ϵ=βt2. In this way, at t2, each edge remains in the graph with probability ϵ=βt2/βt1. In a similar fashion, we implement the inverse process, that is, repopulating the graph with missing edges, from the state Gtn to state Gtn+1, now having βtn<βtn+1. In particular, a new edge (always defined ei,j) must be added to G with a probability P(ei,j)=ϵ, coming from the following relation: (1-βtn)·(1-ϵ)=(1-βtn+1), so that ϵ=1-βtn/βtn+1. In summary, while a diluted ferromagnet can be realized with a single instance of the ER-L model, a continuous dilution can be implemented as follows:(1)
Generate a graphG(N,β0) and define the sampling rate for the dilution, that is, Δβ.(2)
Whileβt>θ.(3)
_ _ Remove each edge inG with probability ϵ=βt/βt-Δβ.(4)
_ _βt=βt-Δβ.The parameterθ represents the final edge probability β, that is, the probability one should use for generating via the E-R model a graph similar to that resulting from the dilution process. β0 corresponds to the starting value of β for generating the initial graph, and βt corresponds to the value of β at step t. The inverse process, that is, the graph repopulation, can be summarized as follows:(1)
Generate a graphG(N,β0) and define the sampling rate for the repopulation, that is, Δβ.(2)
Whileβt<ζ.(3)
_ _ Add each new potential edge inG with probability ϵ=1-βt/βt+Δβ.(4)
_ _βt=βt+Δβ.Asθ, ζ represents the final value of β one should use for generating a similar graph (i.e., with same statistical properties), achieved after repopulation, using the E-R model. Moreover, we clarify that “new potential edge” refers to the edges that can be added to the graph for making it again fully connected; that is, it refers only to missing edges. Eventually, we analyze also thermalization processes (considering, after each dilution, the variables J asquenched). To this end, the system magnetization defined as(5)M=∑iσiNoffers a macroscopic view on the process. Notably, we recall that the magnetization is an order-parameter and allows both to observe the emergence of a phase transition and to evaluate its nature (e.g., first order). In addition, it is worth emphasizing thatquenched spins, randomly initialized with a uniform distribution, entail that the magnetization is on average always null (i.e., the system remains in a disordered phase). Further analyses devised for studying the behavior of our model are introduced in the following section.


## 2.2.1. ER-L Strategy

We are now ready to present the ER-L strategy in detail. Firstly, the ER-L uses a parameterγ∈[0.0,1.0], representing a kind of control in the dilution process. Notably, γ=0.0 entails the process is not controlled, while γ=1.0 entails a fully controlled process. It is worth noting that while the dilution of a ferromagnet does not require any control, being driven towards the optimization of a Hamiltonian, using a probabilistic model (i.e., the ER-L), whose dynamics depends only in part on the local energy, the so-called control parameter γ becomes fundamental for approaching the behavior of a physical dilution. Therefore, γ compensates for the partial energy independence of the proposed strategy. Accordingly, the edge probability β is “corrected” as follows:(3)β⋆=ω·Fsω,with Fs step function and ω equal to(4)ω=β+σxσy1.0-βγ.In doing so, β⋆=0 when ω has a null or a negative value and, at the same time, the normalization condition (i.e., ω≤1) is respected for any value of β and of σ. Thus, varying the parameter β⋆, we can study the Hamiltonian of the resulting diluted ferromagnet and its behavior. In few words, the parameter γ makes the proposed method closer to a physical dilution, since it combines β with the contribution of the two spins involved in the interaction. For instance, from a physical point of view, an interaction between two opposite spins must be removed with a probability higher than an interaction between two equal spins. At the same time, the resulting parameter ω can take values smaller than zero; hence it cannot be directly adopted as the probability to remove an edge. As a result, we introduced a “corrected” probability β⋆ that takes as input any possible value of ω and has a range limited between zero and one. The degree of freedom offered by the parameter γ allows both representing dilution processes in physical systems, as one can do also with a more classical approach (e.g., that described before), and considering other systems, as social networks, where further properties and mechanisms can be involved in the process. In particular, in the case of social networks, dynamical processes like dilution might consider both the node similarity (e.g., the spin) and a probabilistic process mapped to the β parameter. Before illustrating the results of numerical simulations, it is important to elucidate a further aspect of our investigation. As previously reported, when studying the equilibrium configuration of a spin system, the interaction variables J are consideredquenched. So, with the aim of analyzing the behavior of diluted ferromagnets, the variation of J must be faster than that of σ; that is, the latter isquenched. Now, having defined the ER-L model, we discuss how it can be used. First, one can realize a diluted ferromagnet via ER-L, studying then its properties. Second, one can analyze the behavior of the ferromagnet during the dilution process. While a single realization, of a diluted ferromagnet, is very similar to the realization of a graph via the E-R model, that is, drawing edges according to the β⋆ probability, it is worth explaining how to implement a continuous dilution process by the ER-L model. To this end, let us consider a dilution as the motion of a graph G over a phase space, along an axis β. The phase space is larger for low values of β and becomes narrower as β increases, until it contains only one state when β=1 (i.e., fully connected). The lower β, the larger the number of possible realizations of G with the same amount of edges (i.e., the higher its entropy; see also [35] for further details). So in a continuous dilution, beyond considering the effect of γ, one can be able to move from a state, say G(βt1), to a state G(βt2) without losing information about the edges existing at t1. For instance, if βt1=0.9 and βt2=0.8, the ER-L must account for the removal of a density of edges equal to 0.1, preserving the remaining structure of the graph. Therefore, the simple generation of a first graph with β=0.9 and then with β=0.8, is not allowed because the two resulting graphs are not correlated. Thus, in the considered example, the continuous dilution process entails moving in the phase space of the graph by removing each edge with a probability much smaller than βt2, in order to consider also the effect of βt1. To generalize, given βt1 and βt2, with βt1>βt2, if an edge eij (i.e., connecting sites i and j) belonging to the graph in the state Gt1 has to be confirmed in the state Gt2, one cannot simply use βt2 because, after the process, the edge eij would be present with probability P(eij)=βt1·βt2, that is, obviously smaller than βt2. For this reason, we need to compute the factor ϵ such that P(eij)=βt1·ϵ=βt2. In this way, at t2, each edge remains in the graph with probability ϵ=βt2/βt1. In a similar fashion, we implement the inverse process, that is, repopulating the graph with missing edges, from the state Gtn to state Gtn+1, now having βtn<βtn+1. In particular, a new edge (always defined ei,j) must be added to G with a probability P(ei,j)=ϵ, coming from the following relation: (1-βtn)·(1-ϵ)=(1-βtn+1), so that ϵ=1-βtn/βtn+1. In summary, while a diluted ferromagnet can be realized with a single instance of the ER-L model, a continuous dilution can be implemented as follows:(1)
Generate a graphG(N,β0) and define the sampling rate for the dilution, that is, Δβ.(2)
Whileβt>θ.(3)
_ _ Remove each edge inG with probability ϵ=βt/βt-Δβ.(4)
_ _βt=βt-Δβ.The parameterθ represents the final edge probability β, that is, the probability one should use for generating via the E-R model a graph similar to that resulting from the dilution process. β0 corresponds to the starting value of β for generating the initial graph, and βt corresponds to the value of β at step t. The inverse process, that is, the graph repopulation, can be summarized as follows:(1)
Generate a graphG(N,β0) and define the sampling rate for the repopulation, that is, Δβ.(2)
Whileβt<ζ.(3)
_ _ Add each new potential edge inG with probability ϵ=1-βt/βt+Δβ.(4)
_ _βt=βt+Δβ.Asθ, ζ represents the final value of β one should use for generating a similar graph (i.e., with same statistical properties), achieved after repopulation, using the E-R model. Moreover, we clarify that “new potential edge” refers to the edges that can be added to the graph for making it again fully connected; that is, it refers only to missing edges. Eventually, we analyze also thermalization processes (considering, after each dilution, the variables J asquenched). To this end, the system magnetization defined as(5)M=∑iσiNoffers a macroscopic view on the process. Notably, we recall that the magnetization is an order-parameter and allows both to observe the emergence of a phase transition and to evaluate its nature (e.g., first order). In addition, it is worth emphasizing thatquenched spins, randomly initialized with a uniform distribution, entail that the magnetization is on average always null (i.e., the system remains in a disordered phase). Further analyses devised for studying the behavior of our model are introduced in the following section.


## 3. Results

The proposed model is studied by means of numerical simulations, considering ferromagnets composed ofN=1000 sites. In particular, we aim to obtain diluted ferromagnets with single realizations of the ER-L strategy and to use the latter for modeling continuous dilution and repopulation processes. In addition, we analyze thermalization processes on the resulting diluted ferromagnets and, eventually, we present a potential application in the field of complex networks, i.e., in the evaluation of community stability [36, 37].Dilution via the ER-L Model. We start considering different realizations of ferromagnets via the ER-L model, on varying β and γ. Figure 2 shows the (absolute value of) Hamiltonian H, normalized over the actual number of edges La, which reads(6)Hs=-1La∑i≠jN,NJi,jσiσj,with s denoting a specific spin configuration. It is important to emphasize that (6) is normalized in order to consider only those connections that survive during the dilution process. As expected, the Hamiltonian (see (6)) is equal to zero when there is no control in the dilution process, since interactions are removed without considering the spin of related nodes. On the contrary, increasing γ, we observe that the Hamiltonian increases up to 1—we recall that we are considering the absolute value of the Hamiltonian, so that its actual value is -1. For γ>0.0, the maximum of |H| can be reached spanning β within well-defined ranges. Notably, the latter enlarges by increasing γ. For instance, when γ=0.5 the optimal H is obtained with 0≤β≤0.3, while when γ=1.0 the optimal H is obtained with 0≤β≤0.5. It is worth clarifying that we cannot study the dilution in function of β⋆, since its value depends on the involved spins, consequently being potentially different from edge to edge. This preliminary investigation constitutes an early indicator of the existence of a critical edge probability βc, that is, the highest value of β to have |H|=1.0. Now, we start analyzing continuous dilution and repopulation processes. Before to show results of simulations, let us highlight that modeling a continuous dilution entails starting the process from a fully connected graph. Therefore, considering Figure 3, here the direction of a dilution corresponds to that of the M-L strategy while, obviously, a repopulation follows the inverse path. The pictorial representation of Figure 3 aims to give an overview about the continuous dilution process (via ER-L) in two conditions: noncontrolled (γ=0.0) and fully controlled (i.e., γ=1.0). Provided that the starting graph and the landing one are equal in both cases, a quick glance to the pictorial allows appreciating the influence of γ>0. In particular, the intermediate graphs, between the starting and the ending ones, are related to those achieved via the ER-L method setting β≈0.5. Notably, in the case γ=0.0, the graph is obtained setting β=0.5, while in the case γ=1.0 the plot illustrates a graph achieved with β>0.5 and one with β=0.5. Remarkably, for β≤0.5, the resulting graph appears perfectly divided between the two communities (i.e., spins of +1 separated from spins of -1). Instead, for values of β slightly higher than 0.5, as represented in Figure 3, the two communities are connected by few edges. This observation is very important, because of being strongly related to thermalization processes (i.e., when the variables J are taken asquenched after the dilution step). Numerical simulations, shown in Figure 4, demonstrate that the ER-L strategy is able to dilute and to repopulate a graph, no matter the value of γ. In addition, implementing the two processes as a cycle, we did not find any form of hysteresis; that is, dilution and repopulation cover two perfectly overlapping paths in the plot of Figure 4. Only in the case with γ=0.0, we found an observable difference between the two paths, which can still be considered negligible.Figure 2
Absolute value of the system Hamiltonian in function of theβ parameter adopted for realizing a diluted ferromagnet. The legend indicates the related value of γ for each curve. Results have been averaged over different simulation runs.Figure 3
Pictorial representation of a continuous dilution process, via ER-L, achieved in two different ways: on the left, without any control (i.e.,γ=0), and on the right with maximum control (i.e., γ=1.0). The arrow indicates the direction of the process, starting from the top with a complete graph, to the bottom with nonconnected nodes. Along the dilution path, the related graphs achieved by the different strategies previously described are shown. In the controlled case, the graph is split in two communities for β≤0.5 and are connected for β>0.5. Different colors indicate different spin values (e.g., blue σ=+1 and red σ=-1).Figure 4
Continuous dilution and repopulation of ferromagnets with differentγ: 0.0 (a), 0.1 (b), 0.5 (c), and 1.0 (d). The red curve represents the dilution, while the blue curve represents the repopulation process. Results have been averaged over different simulation runs.
(a) (b) (c) (d)Thermalization Processes on Diluted Ferromagnets. Now, we study thermalization processes on ferromagnets diluted with different γ. To this end, ferromagnets can be diluted both by implementing single realizations of the ER-L strategy (as we did here) and by performing the continuous dilution, that is, considering the resulting graph obtained at each step. Moreover, we recall that thermalization is analyzed by studying the average magnetization (i.e., (5)) of the system—see Figure 5. In all cases, it seems that the order-disorder phase transition occurring in the ferromagnet is of first order, no matter the value of γ. At the same time, the latter strongly affects the critical βc. In particular, for γ=0.0 we found βc~10-3, while for γ=1.0 the value is smaller than 0.5+10-4. When γ=0, the transition is caused by the relevant reduction of edges, so that without interactions the thermalization cannot take place. On the contrary, increasing γ, the order-disorder phase transition is caused initially by a combined effect of edge reduction and community separation, until γ=1.0, where the disordered phase is reached for the emergence of two well separated, and ordered, communities having opposite spin (i.e., one with σ=+1 and one with σ=-1)—see the inset of Figure 5. In addition, we found that with β=0.5+10-5 and γ=1.0 the average (absolute) value of the magnetization and the variance are equal, proving its role as the critical βc. Then, an aspect shown in Figure 5, that is, the first order phase transition, is worth further clarifying. Notably, when the dilution is strongly controlled (i.e., γ→1) the first edges to be removed are those linking nodes with opposite spin, so that once half of the edges are removed only those connecting nodes with same spins survive, leading to a total magnetization equal to zero (i.e., summing the magnetization observed in the two separated communities, which in turn reach opposite states of full order). Instead, for poorly controlled dilution, edges are removed without considering the value of related spins, so that the transition occurs for lower values of β. To conclude, we recall that these simulations have been performed on ferromagnets containing an equal amount of positive and negative spins.Figure 5
(Absolute) average magnetization|M| in function of 1-β, for different γ, as indicated in the legend. The small networks decorate the plot, showing the dilution over the abscissa. Notably, the two inner small networks refer to values of γ=1.0 and to β slightly higher and lower than 0.5. Results have been averaged over different simulation runs.


### 3.1. Community Stability

The proposed strategy aims to perform dilution processes on ferromagnets using, as reference, a well-established random graph model (i.e., the E-R model). The latter is widely used in the modern theory of networks for studying dynamical processes and structural properties of complex networks. Now, we want to evaluate if a modification of the E-R model that we introduced, that is, the ER-L strategy, can be useful for extracting information from a complex network. In particular, we envision a potential application in the task of measuring the stability of a community, that is, a predictive analysis, based on the properties of nodes, for evaluating the risk of its disappearance. Notably, in a number of models studied in social dynamics [38–41], often properties and behaviors are mapped onto binary spins [42]. So, in principle, one could use the Hamiltonian defined in (6) for measuring the stability of a community [43], that is, the higher its |H| the higher the probability that the community survives over time. In particular, the value of |H| reflects the degree of similarity between the nodes connected in the same community. Even if only the analysis of real datasets would allow confirming the validity of this hypothesis and then also the usefulness in the area of complex networks of the proposed strategy, our assumption is based on the simple observation that groups of individuals are more likely to cluster together when sharing common interests, opinions, and so on. Moreover, beyond observations of real scenarios, this mechanism is confirmed by the positive assortativity [44] that social networks show; that is, individuals are more likely to interact with their likes. In addition, recalling that the value of (6) can be related to single communities, it can be viewed as an alternative form of assortativity at community level, since the higher its value the higher the fraction of connections between similar nodes. So, since the case with binary spins has been previously studied, even if referring to dilution processes, here we focus on two main analyses. First we study the influence of heterogeneity in a complete community, measuring how the Hamiltonian decreases while increasing the amount of nodes with different spins. Second, we study the Hamiltonian of a graph, considering the XY model [45] as reference. In doing so, we are able to represent situations where there are more than 2 opinions (e.g., [46, 47]), states, or behaviors. The first investigation considers, at the beginning, the combination named s+; then some spins flip increasing the density of nodes with spin -1 (this process leads to the same results also considering the inverse case, that is, starting with s- and then flipping spins to +1). Results are illustrated in Figure 6. As expected, the minimum of |H| is reached when the number of +1 spins is equal to that of -1 spins. Finally, we analyzed the Hamiltonian of a community using the XY model. Figure 7 reports the related results, for different γ, considering both 4 different states and 360 different states. Here, the pairs of spins are evaluated according to the cosine similarity cos⁡θa-θb, with θa and θb representing the value of the involved spins. We observe two main differences from the classical binary spins. In particular, using the XY model, the decrease of the Hamiltonian is smoother in the XY model than in the Ising model, where it appears less monotonous. Furthermore, the maximum value of |H| is always smaller than 1.0. Accordingly, we note that communities are more stable (or robust to spin flipping) when there are more than 2 states characterizing the related nodes. On the other hand, many possible states do not allow reaching a perfect stability (i.e., |H|=1), exposing a community to a higher risk of disappearing.Figure 6
Hamiltonian of a fully connected community, in function of the density of negative spins. Results have been averaged over different simulation runs.Figure 7
Hamiltonian computed using theXY model. (a) Results reached considering 360 different spin values. (b) Those reached using 4 spin values. The legend indicates the related value of γ for each curve. Results have been averaged over different simulation runs.
(a) (b)


## 3.1. Community Stability

The proposed strategy aims to perform dilution processes on ferromagnets using, as reference, a well-established random graph model (i.e., the E-R model). The latter is widely used in the modern theory of networks for studying dynamical processes and structural properties of complex networks. Now, we want to evaluate if a modification of the E-R model that we introduced, that is, the ER-L strategy, can be useful for extracting information from a complex network. In particular, we envision a potential application in the task of measuring the stability of a community, that is, a predictive analysis, based on the properties of nodes, for evaluating the risk of its disappearance. Notably, in a number of models studied in social dynamics [38–41], often properties and behaviors are mapped onto binary spins [42]. So, in principle, one could use the Hamiltonian defined in (6) for measuring the stability of a community [43], that is, the higher its |H| the higher the probability that the community survives over time. In particular, the value of |H| reflects the degree of similarity between the nodes connected in the same community. Even if only the analysis of real datasets would allow confirming the validity of this hypothesis and then also the usefulness in the area of complex networks of the proposed strategy, our assumption is based on the simple observation that groups of individuals are more likely to cluster together when sharing common interests, opinions, and so on. Moreover, beyond observations of real scenarios, this mechanism is confirmed by the positive assortativity [44] that social networks show; that is, individuals are more likely to interact with their likes. In addition, recalling that the value of (6) can be related to single communities, it can be viewed as an alternative form of assortativity at community level, since the higher its value the higher the fraction of connections between similar nodes. So, since the case with binary spins has been previously studied, even if referring to dilution processes, here we focus on two main analyses. First we study the influence of heterogeneity in a complete community, measuring how the Hamiltonian decreases while increasing the amount of nodes with different spins. Second, we study the Hamiltonian of a graph, considering the XY model [45] as reference. In doing so, we are able to represent situations where there are more than 2 opinions (e.g., [46, 47]), states, or behaviors. The first investigation considers, at the beginning, the combination named s+; then some spins flip increasing the density of nodes with spin -1 (this process leads to the same results also considering the inverse case, that is, starting with s- and then flipping spins to +1). Results are illustrated in Figure 6. As expected, the minimum of |H| is reached when the number of +1 spins is equal to that of -1 spins. Finally, we analyzed the Hamiltonian of a community using the XY model. Figure 7 reports the related results, for different γ, considering both 4 different states and 360 different states. Here, the pairs of spins are evaluated according to the cosine similarity cos⁡θa-θb, with θa and θb representing the value of the involved spins. We observe two main differences from the classical binary spins. In particular, using the XY model, the decrease of the Hamiltonian is smoother in the XY model than in the Ising model, where it appears less monotonous. Furthermore, the maximum value of |H| is always smaller than 1.0. Accordingly, we note that communities are more stable (or robust to spin flipping) when there are more than 2 states characterizing the related nodes. On the other hand, many possible states do not allow reaching a perfect stability (i.e., |H|=1), exposing a community to a higher risk of disappearing.Figure 6
Hamiltonian of a fully connected community, in function of the density of negative spins. Results have been averaged over different simulation runs.Figure 7
Hamiltonian computed using theXY model. (a) Results reached considering 360 different spin values. (b) Those reached using 4 spin values. The legend indicates the related value of γ for each curve. Results have been averaged over different simulation runs.
(a) (b)


## 4. Discussion and Conclusion

This work introduces a strategy, named ER-L, for modeling the dilution of ferromagnets using the framework of modern network theory. In particular, we adopt as reference the E-R graph model, since the latter, under opportune conditions, constitutes the graphical representation of the Curie-Weiss model. The proposed method is partially Hamiltonian-independent, that is, while a Metropolis-like strategy can dilute a ferromagnet according to energy-based rules, the ER-L strategy depends on a probabilistic (nonphysical) parameterβ and, only in part, on the local energy via a parameter γ, which represents a kind of control in the dilution. Notably, diluting a ferromagnet can be thought as pruning a graph G, moving the latter in a phase space composed of all its possible realizations. The amount of edges (i.e., interactions) depends on the parameter β of the ER-L model, so our strategy moves G along the axis β. In doing so, G undergoes a kind of phase transition (see also [48–51]), where different structures can be obtained, from sparse nodes to a complete graph. In addition, the parameter γ ensures that the motion along the β axis, on the phase space, corresponds to that followed by a ferromagnet during a spontaneous dilution. In particular, like during thermalization, a system tends to naturally reach an equilibrium state that minimizes its energy. In a similar fashion, spontaneous dilutions should lead the system to a ground state. Results indicate that ER-L is able to perform this task for different values of γ, depending on the considered β. In addition, we also analyzed the closed path (i.e., the cycle) from a complete graph to single nodes and then to a complete graph by repopulating with new edges the diluted graph. It is worth highlighting that ER-L allows diluting a graph also after its Hamiltonian has been minimized, while a Metropolis-like strategy, being “Hamiltonian-dependent,” would not be able to do so. Therefore, not all the structures obtained via ER-L have a physical meaning. However, during a continuous dilution, we can discriminate those that appear without a physical meaning, computing the difference of the Hamiltonian between the two structures. The related analyses have been performed considering the spin variables σ asquenched. So, we studied also the opposite case; that is, after a dilution the interactions J becomequenched, and the spins can flip towards an equilibrium state (see also [52–54]). In order to study this process and to make a relation with the parameter β, we analyze the average magnetization achieved at equilibrium, which provides an indication about the phase transitions occurring in the system—see Figure 5. Once the outcomes of the ER-L strategy are analyzed, we performed a further analysis for evaluating the opportunity to apply it to further tasks, in particular considering the measure of stability of communities in complex networks. First we analyzed the variation of the Hamiltonian turning an ordered system to a disordered one. Then, we studied the Hamiltonian considering as reference the XY model, that is, admitting spins with more than 2 values. This preliminary investigation suggests that ER-L may, in principle, be useful for evaluating the risk that a community will dissolve after a while, according to the degree of heterogeneity of its individuals (e.g., in terms of opinions, interests, etc.). In addition, we found that communities whose nodes have more possible states (e.g., opinions) never reach a perfect stability (i.e., |H|<1) but can be more robust than those with binary spins to the emergence of interaction between different individuals. Obviously, we are not taking into account all the “social” processes that may occur in real systems; for example, once two different individuals interact, one might imitate the other, relaxing the system. Moreover, considering the two strategies here described, that is, ER-L and M-L, we deem that it is important to mention that, in principle, they might constitute also the base for developing learning algorithms [55]. Notably, almost all simulations have been carried on considering an equal distribution of positive and negative spins; however different combinations (i.e., patterns) might be used. Therefore, the optimization of the Hamiltonian during the dilution, in our view, even if referring to only one pattern, can be actually interpreted as a form of learning in a neural network [56]. On the other hand, further investigations are required for evaluating whether the proposed model may allow the graph to learn and store more than one pattern. Finally, we remark that, in order to assess the actual usefulness of ER-L for evaluating the community stability, further investigations based on real datasets are definitely mandatory.



---

*Source: 2845031-2018-04-15.xml*