Network Links Research Articles

Lesions Causing Alice in Wonderland Syndrome Map to a Common Brain Network Linking Body and Size Perception.

Alice in Wonderland syndrome (AIWS) profoundly affects human perception of size and scale, particularly regarding one's own body and the environment. Its neuroanatomical basis has remained elusive, partly because brain lesions causing AIWS can occur in different brain regions. Here, we aimed to determine if brain lesions causing AIWS map to a distributed brain network. A retrospective case-control study analyzing 37 cases of lesion-induced AIWS identified through systematic literature review was conducted. Using resting-state functional connectome data from 1,000 healthy individuals, the whole-brain connections of each lesion were estimated and contrasted with those from a control dataset comprising 1,073 lesions associated with 25 other neuropsychiatric syndromes. Additionally, connectivity findings from lesion-induced AIWS cases were compared with functional neuroimaging results from 5 non-lesional AIWS cases. AIWS-associated lesions were located in various brain regions with minimal overlap (≤33%). However, the majority of lesions (≥85%) demonstrated shared connectivity to the right extrastriate body area, known to be selectively activated by viewing body part images, and the inferior parietal cortex, involved in size and scale judgements. This pattern was uniquely characteristic of AIWS when compared with other neuropsychiatric disorders (family-wise error-corrected p < 0.05) and consistent with functional neuroimaging observations in AIWS due to nonlesional causes (median correlation r = 0.56, interquartile range 0.24). AIWS-related perceptual distortions map to one common brain network, encompassing regions critical for body representation and size-scale processing. These findings lend insight into the neuroanatomical localization of higher-order perceptual functions, and may inform future therapeutic strategies for perceptual disorders. ANN NEUROL 2024;96:662-674.

Ensemble Deep Random Vector Functional Link Network Using Privileged Information for Alzheimer's Disease Diagnosis.

Alzheimer's disease (AD) is a progressive brain disorder. Machine learning models have been proposed for the diagnosis of AD at early stage. Recently, deep learning architectures have received quite a lot attention. Most of the deep learning architectures suffer from the issues of local minima, slow convergence and sensitivity to learning rate. To overcome these issues, non-iterative learning based deep randomized models especially random vector functional link network (RVFL) with direct links have proven to be successful. However, deep RVFL and its ensemble models are trained only on normal samples. In this paper, deep RVFL and its ensembles are enabled to incorporate privileged information, as the standard RVFL model and its deep models are unable to use privileged information. To fill this gap, we have incorporated learning using privileged information (LUPI) in deep RVFL model, and propose deep RVFL with LUPI framework (dRVFL+). Privileged information is available while training the models. As RVFL is an unstable classifier, we propose ensemble deep RVFL+ with LUPI framework (edRVFL+) which exploits the LUPI as well as the diversity among the base leaners for better classification. Unlike traditional ensemble approach wherein multiple base learners are trained, the proposed edRVFL+ model optimises a single network and generates an ensemble via optimization at different levels of random projections of the data. Both dRVFL+ and edRVFL+ efficiently utilise the privileged information which results in better generalization performance. In LUPI framework, half of the available features are used as normal features and rest as the privileged features. However, we propose a novel approach for generating the privileged information. We utilise different activation functions while processing the normal and privileged information in the proposed deep architectures. To the best of our knowledge, this is first time that a separate privileged information is generated. The proposed dRVFL+ and edRVFL+ models are employed for the diagnosis of Alzheimer's disease. Experimental results demonstrate the superiority of the proposed dRVFL+ and edRVFL+ models over baseline models. Thus, the proposed edRVFL+ model can be utilised in clinical setting for the diagnosis of AD.

Regional traffic congestion coordination control based on critical links

Critical links have the characteristics of carrying large traffic flow and quickly affecting the operational performance of the road network. Existing regional traffic congestion coordination control methods do not consider the impact of critical links. To solve this issue, this paper proposes a regional traffic congestion coordination control method based on critical links. First, the median, gravitational index, and traffic sharing ratio are selected as the identification indexes of critical links in urban networks. Second, the road network vulnerability is assessed, and road link criticality is calculated based on joint entropy theory and multi-scale factor synthesis of multi-metric identification results. Then, the regional signal control range is determined, and a multi-stage signal control optimization model is developed. Finally, the optimal traffic signals for intersections are obtained by minimizing the pressure at the maximum phase of the road link and maximizing the capacity of critical links. To demonstrate the effectiveness of the proposed methods, two benchmarks (i.e., the MAXBAND method and existing traffic signals) are compared. The results show that (1) in terms of boundary control, the average vehicle delay at the boundary intersection of the road network is 34.62 s, an increase of 7.49 s and 5.03 s compared to the benchmark methods, respectively. (2) In terms of internal control, the average delay of the road network based on the proposed method is 87.54 s, which is reduced by 16.38 % and 28.73 % compared with the benchmark methods, and the queue lengths of the critical links are reduced by 21.47 % and 34.15 %, respectively. (3) The control process of the proposed method enables the number of vehicles within the road network to be maintained near the optimal carrying capacity, which gives the road network an efficient operating efficiency.

Revisiting the evolution of bow-tie architecture in signaling networks

Bow-tie architecture is a layered network structure that has a narrow middle layer with multiple inputs and outputs. Such structures are widely seen in the molecular networks in cells, suggesting that a universal evolutionary mechanism underlies the emergence of bow-tie architecture. The previous theoretical studies have implemented evolutionary simulations of the feedforward network to satisfy a given input-output goal and proposed that the bow-tie architecture emerges when the ideal input-output relation is given as a rank-deficient matrix with mutations in network link intensities in a multiplicative manner. Here, we report that the bow-tie network inevitably appears when the link intensities representing molecular interactions are small at the initial condition of the evolutionary simulation, regardless of the rank of the goal matrix. Our dynamical system analysis clarifies the mechanisms underlying the emergence of the bow-tie structure. Further, we demonstrate that the increase in the input-output matrix reduces the width of the middle layer, resulting in the emergence of bow-tie architecture, even when evolution starts from large link intensities. Our data suggest that bow-tie architecture emerges as a side effect of evolution rather than as a result of evolutionary adaptation.

A new relaying approach for protecting TCSC compensated transmission line connected to DFIG based wind farm

In modern power systems, Thyristor Controlled Series Capacitor (TCSC)-compensated transmission lines are crucial in transporting bulk power from large wind farms. However, the performance of conventional distance relays is adversely impacted by the typical fault characteristics of the Doubly Fed Induction Generator (DFIG) and TCSC. To address this challenge, this paper presents a new relaying algorithm such as Complete Ensemble Empirical Mode Decomposition with Adaptive Noise-based Dominant Mode Algorithm-Hilbert Transform (CEEMDAN-DMA-HT) for fault detection and CEEMDAN assisted Enhanced Jaya Optimization-based Random Vector Functional Link Network (EJAYA-RVFL) for fault classification. In proposed fault detection algorithm, the differential current from both ends of the line is subjected to Complete Ensemble Empirical Mode Decomposition with Adaptive Noise, leading to the extraction of distinct intrinsic mode functions (IMFs). Employing the Dominant Mode Algorithm, the IMF with the highest Pearson correlation coefficient, referred to as the dominant IMF, is identified. Subsequently, a comparison between this dominant mode IMF and the original input signal is conducted after passing the obtained signal through the Hilbert Transform (HT), enabling effective fault detection. The proposed classifier leverages a straightforward feature set that quantifies the energy of each phase and the ground. These features serve as inputs for the proposed classifier, facilitating the categorization of different fault types. To evaluate the effectiveness of the proposed relaying algorithm, several fault and non-fault scenarios are simulated on a test power system using MATLAB/Simulink. The results demonstrate that; the proposed fault detection and classification algorithm are able to detect and classify faults in less than a half-cycle. The proposed method gives 100% fault accuracy for fault detection and 99.97 % accuracy for fault classification. Furthermore, the proposed classifier achieves the performance metrics like Precision (0.998), Recall (0.997) and F1-Score (0.996), providing quantitative insights into its accuracy and dependability. Finally, a comparative analysis is carried out with existing approaches.

A model-less approach for the optimal coordination of renewable energy sources and DC links in low-voltage distribution networks

This paper presents a model-less centralized control approach for coordinating Renewable Energy Sources and multiterminal DC links in low-voltage distribution networks. The controller is based on the Online Feedback Optimization technique which is adequate for this part of the power system, characterized by a lack of precise model and real-time information. The paper includes the complete mathematical formulation of the optimization problem and its solution applying the presented strategy. The performance of the proposed centralized controller is evaluated through simulations in the European LV distribution network proposed by the CIGRE Task Force C06.04.02. The results show the benefits that DC links may bring to LV networks due to the release of their radial operation. In particular, the proposed strategy achieves a 7.4 % daily energy loss reduction with respect to the base case. The centralized controller, which operates without a detailed network model and reduced real-time information, enables the use of this technology in LV networks which maximizes the penetration of renewable energy sources.

Supervised learning to covering cost risk through post-construction evaluation of transportation projects by project delivery methods

PurposeThe main objectives of this study are to (1) develop and test a cost contingency learning model that can generalize initially estimated contingency amounts by analyzing back the multiple project changes experienced and (2) uncover the hidden link of the learning networks using a curve-fitting technique for the post-construction evaluation of cost contingency amounts to cover cost risk for future projects.Design/methodology/approachBased on a total of 1,434 datapoints collected from DBB and DB transportation projects, a post-construction cost contingency learning model was developed using feedforward neural networks (FNNs). The developed model generalizes cost contingencies under two different project delivery methods (i.e. DBB and DB). The learning outputs of generalized contingency amounts were curve-fitted with the post-construction schedule and cost information, specifically aiming at uncovering the hidden link of the FNNs. Two different bridge projects completed under DBB and DB were employed as illustrative examples to demonstrate how the proposed modeling framework could be implemented.FindingsWith zero or negative values of change growth experienced, it was concluded that cost contingencies were overallocated at the contract stage. On the other hand, with positive values of change growth experienced, it was evaluated that set cost contingencies were insufficient from the post-construction standpoint. Taken together, this study proposed a tangible post-construction evaluation technique that can produce not only the plausible ranges of cost contingencies but also the exact amounts of contingency under DBB and DB contracts.Originality/valueAs the first of its kind, the proposed modeling framework provides agency engineers and decision-makers with tangible assessments of cost contingency coupled with experienced risks at the post-construction stage. Use of the proposed model will help them evaluate the allocation of appropriate contingency amounts. If an agency allocates a cost contingency benchmarked from similar projects on aspects of the base estimate and experienced risks, a set contingency can be defended more reliably. The main findings of this study contribute to post-construction cost contingency verification, enabling agency engineers and decision-makers to systematically evaluate set cost contingencies during the post-construction assessment stage and achieving further any enhanced level of confidence for future cost contingency plans.

Identification of missing higher-order interactions in complex networks

Abstract Link prediction has always played a crucial role in unveiling the structural patterns and evolutionary rules of networks. However, as research on complex networks has progressed, the limitations of solely exploring low-order structures have become increasingly apparent. The introduction of high-order organizational theories has not only enriched the conceptual framework of network dynamics but also opened new avenues for investigating the mechanisms of network evolution and adaptation. The complexity and richness of high-order networks pose challenges for link prediction. This study introduces two novel approaches to forecast links in higher-order networks. The first one is to predict links directly in higher-order networks (LPHN), which directly predicts missing links within the higher-order network based on its structure; the other one is to predict higher-order links via link prediction in low-order networks(PHLN), which starts by predicting absent links in a low-order network. Subsequently, the inferred low-order structure is employed as a foundation to extrapolate and reconstruct the predicted higher-order network. Upon comparing the higher-order networks generated by both LPHN and PHLN with the original higher-order networks constructed directly from low-order networks, we discovered that the higher-order networks produced by PHLN exhibit greater accuracy and exhibit a more similar scale of giant components to the original higher-order network. Consequently, the PHLN demonstrates enhanced precision in forecasting the structure of higher-order networks while preserving networks’ structural integrity. Moreover, PHLN exhibits superior performance in the context of large-scale and sparsely connected networks.

TLFSL: link prediction in multilayer social networks using trustworthy Lévy-flight semi-local random walk

Abstract As the landscape of online social networks continues to evolve, the task of expanding connections and uncovering novel relationships presents a growing complexity. Link prediction emerges as a crucial strategy, harnessing the current network dynamics to forecast future interactions among users. While traditional single-layer network link prediction models boast a storied legacy, recent attention has shifted towards tackling analogous challenges within the realm of multilayer networks. This paradigm shift underscores the critical role of extracting topological and multimodal features to effectively evaluate link weights, thereby enriching link prediction within weighted networks. Furthermore, the establishment of trustworthy pathways between users emerges as a pivotal tactic for translating unweighted similarities into meaningful weighted metrics. Leveraging the foundational principles of local random walk techniques, this paper introduces the trustworthy Lévy-flight semi-local (TLFSL) random walk framework for link prediction in multilayer social networks. By seamlessly integrating intralayer and interlayer information, TLFSL harnesses a dependable Lévy-flight random walk mechanism to anticipate new links within target layers of multilayer networks. Traditional local random walk techniques often overlook global relationships, as they confine path exploration to immediate neighbours. However, the absence of a direct edge between nodes does not necessarily imply a lack of relationship; nodes with semantic affinity may be spatially distant within the network. To overcome this limitation, we introduce the concept of semi-local random walk, which enables walker hopping with a wider global perspective. Meanwhile, TLFSL includes a distributed local community detection strategy to improve the performance of TLFSL in dealing with large-scale networks. Rigorous experimentation across diverse real-world multilayer networks consistently demonstrates TLFSL’s superior performance compared to equivalent methods.

Social structure and clan group networks of Afar pastorals along the Lower Awash Valley

The study examined how Afar society’s clan structure and societal hierarchies were established. The links of customary law (maa’da) practices, traditional communication (dagu), and social networks (affehina) were found to be significant in the social structure for how members perform social interactions. A qualitative method was applied, which involved Key informant interviews, focused group discussions, and observation techniques as data-gathering tools. The data was interpreted using a thematic analysis technique. Accordingly, the study explored that the administrative and social structure of the society consisted of the sultanate, the clan, and youth social groups. Each social unit has its distinct functions. A clan is the highest and most territorially located social organization. In addition, it was identified that network ties would be more commonly used to depict member’s interactions within the clan’s network structure. However, the clan’s territory (dinto) is not changeable as the season changes. The customary law applications are identified as a system of governing and controlling the social structure, social interactions, anti-social behaviours, and clan networks, with no change and differences in contents and practices in all clan groups. Furthermore, the expansion of small cities gradual change to urban centres, economic inequalities, and recurrent drought resulted in the decline of traditional norms and mutual social trusts. As a result, the study concluded that to sustain the traditional knowledge and social structure in facilitating clan vital networks, implementing visible policies will benefit the society, the government, and stakeholders to plan out effective mechanisms to preserve the sociocultural worth of the Afar pastoral societies in particular and other social groups in the country in general.

Retransmission performance in a stochastic geometric cellular network model

Suppose sender–receiver transmission links in a downlink network at a given data rate are subject to fading, path loss, and inter-cell interference, and that transmissions either pass, suffer loss, or incur retransmission delay. We introduce a method to obtain the average activity level of the system required for handling the buffered work and from this derive the resulting coverage probability and key performance measures. The technique involves a family of stationary buffer distributions which is used to solve iteratively a nonlinear balance equation for the unknown busy-link probability and then identify throughput, loss probability, and delay. The results allow for a straightforward numerical investigation of performance indicators, are in special cases explicit and may be easily used to study the trade-off between reliability, latency, and data rate.

Examining the impact of link failures and network performance on a 6to4, 6rd, CHANC and D4across6 tunneling-based networks using various routing protocols

Examining the impact of link failures and network performance on a 6to4, 6rd, CHANC and D4across6 tunneling-based networks using various routing protocols

Developing a fuzzy bi-objective programming and MCDM model for bridge maintenance strategy optimization

Bridges serve as critical links in road networks, requiring continuous maintenance to ensure proper functionality throughout their lifespan. Given their pivotal role in the urban landscape, connecting various parts of a city, this research presents a multi-objective optimization model for the maintenance and repair of bridges in Babolsar, Iran. The model takes into account budget constraints and aims to minimize the total life cycle and user costs, encompassing traffic delays and vehicle expenses, while maximizing the reliability of the bridge network. Recognizing the inherent complexity of this problem, a multi-objective particle swarm optimization algorithm has been developed for an accurate solution. The study further conducts sensitivity analysis on the objective function concerning the available budget, evaluating key parameters such as hourly costs and the time value of vehicles. The results show that with an increase in the budget level, the number of repairs related to the most costly maintenance has significantly risen. In other words, as the budget expands, the model tends to favor repairs with higher costs because their impact on the bridge’s performance is more substantial.

Method to link medicines to diseases using multiplex networks

The reuse of well-established medicines using computational modeling has gained a lot of attention due to its tremendous benefits. Based on this perspective, a new method for linking known medicines to diseases is proposed. The creation of a new treatment or medicine can be financially and temporally costly and the reuse of medicines is one possibility to accelerate this process efficiently. The main purpose of the reuse of medicines is to reduce some stages of the development of new medicines, motivating the proposition of several methods nowadays. In this work, a new method is developed aiming to connect known medicines to diseases based on available networks of protein interactions and available lists of medicines that affect protein action. The concepts of multiplex networks are used to connect subgraphs of vertices that represent medicines and proteins. The core of the procedure is determined by a weighting strategy constructed to define precisely the more relevant connections. The method was compared to other network link methods in the literature and a case study was presented and evaluated by the proposed method.

Enhancing the robustness of interdependent networks by positively correlating a portion of nodes

Cascading failures caused by interdependencies make modern coupled systems extremely fragile to failures. In existing network robustness enhancing methods, maximizing interlayer degree-degree correlations has been proven to be an effective way to improve the robustness of interdependent networks under random failures. Here, we propose a portion of nodes positively correlated strategy (PNC) to improve network robustness by positively correlating a portion of nodes, in which the nodes that are positively correlated are selected in descending order of degree, starting at a cutoff value. Based on percolation theory, we verify the effectiveness of PNC on different networks. And find that, when the nodes with the highest degree are preferentially correlated, i.e. the cutoff value takes the maximum degree, this strategy achieves a state-of-the-art optimization effect. In particular, for interdependent scale-free networks with power-law exponent γ that satisfies 2<γ<3 , we theoretically demonstrate that the highest degree preferentially correlated mode can maximize network robustness by changing the coupling state of the near 0 proportion of nodes. For γ = 3, such a mode can make the network turn into a second-order phase transition at the collapse point. Finally, we discuss the relationship between the robustness of optimized networks and common links in real-world networks.

Secure traceability mechanism of green electricity based on smart contracts and provenance model

Green and low-carbon development is an important part of global sustainable development. Green power trading provides strong support and assurance for promoting green and low-carbon development. Due to the long cycle of green power data chains and their susceptibility to malicious tampering, the integrity and traceability of data are difficult to guarantee. Therefore, this paper first proposes a security provenance model with enhanced relations based on the core structure of PROV and blockchain technology, which can securely capture provenance records, use the transfer time and number of transactions between various links in the traceability network as reasoning clues, realize the correlation tracing of the green electricity transfer process. Under the model, a traceability mechanism of green electricity is designed based on smart contracts. Trustworthy green electricity data collection is achieved through data filling and data verification techniques. Traceability query technique is adopted to achieve trustworthy traceability of green electricity. And the effectiveness of the proposed solution is demonstrated through simulation experiments.

Unveiling the complex networks of urban tree diversity research: A global perspective.

Ecosystem services offered by urban forests must be proactively managed to remain diverse and sustainable. Recent research findings deserve a systematic synthesis to elucidate inherent knowledge structures and dynamics. This study focused on the urban tree diversity theme from 2000 to 2022. Web of Science Core Collection database provided bibliometric details on academic publications. The data-driven quantitative analysis explored research quantities, emphasis, trends, patterns, linkages, and impacts by countries, institutions, authors, journals, and citations. Publications and research topics have expanded continually, with accelerated growth in recent years. Research activities, outputs and interactions demonstrated conspicuous spatial clustering. A few countries, institutions and researchers generated a notable proportion of publications. Their scholarly contributions were visualized in knowledge graphs as complex networks of nodes and inter-node links. Keyword analysis generated a network to indicate research hotspots and frontiers to steer and prioritize future studies. Recent findings affirmed that cities can harbor substantial tree diversity due to enhanced habitat heterogeneity and successful species adaptation. Aligning tree traits with environmental conditions and management objectives can improve benefits. Urbanization can filter tree traits to shape community assemblages through stressors: habitat degradation, fragmentation and loss, in conjunction with pollution, climate change, and introduced species. Diversity preservation strategies include protecting remnant natural vegetation, connecting green spaces, and restoring complex canopy geometry and biomass structure. The emerging frontiers are marked by modeling future species distributions, leveraging technologies like remote sensing, linking ecology with human values, and committing to community-based stewardship. Management can be upgraded by interdisciplinary perspectives integrating ecological science and social engagement. The findings highlight the need for biodiversity enrichment anchored by native species, trait-matched assemblages, adaptive policies, and community participation to create livable-green cities. This review synthesizes key advances in urban tree ecology and biodiversity research to inform the planning and stewardship of resilient urban forests.

Optical turbulence profiling at the Table Mountain Facility with the Laser Communication Relay Demonstration GEO downlink

We report the first measurement of the atmospheric optical turbulence profile using the transmitted beam from a satellite laser communication terminal. A ring image next generation scintillation sensor (RINGSS) instrument for turbulence profiling, as described in Tokovinin [MNRAS 502, 747 (2021)10.1093/mnras/staa4049], was deployed at the NASA/Jet Propulsion Laboratory’s Table Mountain Facility (TMF) in California. The optical turbulence profile was measured with the downlink optical beam from the Laser Communication Relay Demonstration (LCRD) geostationary satellite. LCRD conducts links with the Optical Communication Telescope Laboratory ground station and the RINGSS instrument was co-located at TMF to conduct measurements. Turbulence profiles were measured at day and night and atmospheric coherence lengths were compared with other turbulence monitors such as a solar scintillometer and Polaris motion monitor. RINGSS sensitivity to boundary layer turbulence, a feature not provided by many profilers, is also shown to agree with a boundary layer scintillometer at TMF (R = 0.85). Diurnal evolution of optical turbulence and measured profiles are presented. The correlation of RINGSS with other turbulence monitors (R = 0.75 − 0.86) demonstrates the concept of free-space optical communications turbulence profiling, which could be adopted as a way to support optical ground stations in a future Geostationary feeder link network. These results also provide further evidence that RINGSS, a relatively new instrument concept, correlates well with other instruments in daytime and nighttime turbulence.

Hardware Compression Method for On-Chip and Interprocessor Networks with Wide Channels and Wormhole Flow Control Policy

Increasing the number of processing cores is currently a common way to boost processor performance. However, the load on the memory subsystem consequently increases as the number of its agents grows. Hardware data compression is an unconventional approach to improving memory subsystem performance by reducing, firstly, the main memory access rate by increasing the cache capacity and, secondly, data traffic by packing the data more densely. The paper describes the implementation of hardware data compression in the on-chip network and interprocessor links of a configuration with wide data transmission channels and a wormhole flow control policy. The existing solutions cannot be applied to such configurations because they are essentially based on using narrow data channels and flow control policies implying uninterrupted packet transmission, which is not maintained with the wormhole flow control. The method proposed in this paper enables the use of hardware compression in the aforementioned configuration by moving data compression and decompression from networks to the connected devices, as well as by using a number of optimizations to hide the data processing delays. Optimizations of some specific cases, such as the transmission of large data packets with several cache lines or the transmission of zero data, are considered. Special attention is given to data transmission via interprocessor links, where, due to their lower bandwidth compared to the on-chip network, data compression can be the most beneficial. The increase in memory subsystem bandwidth from using hardware data compression was confirmed in the experiments showing the relative IPC increase in SPEC CPU2017 benchmarks up to 14 percent.

Links between the actors and mining activities related to the implementation of sustainable development principles

AbstractThe uninterrupted supply of raw materials is essential to implement low‐carbon technologies. Therefore, the sustainable extraction of these materials is crucial. One of its important aspects is the analysis of the interaction between the actors as well as the actions undertaken by them. This study explores the characteristics of the network of links between social actors and the supporting and inhibitory actions related to sustainable development that the mining industry and its possible implications with collaboration and conflict between actors. Our methodological approach consisted in building two bipartite networks based on actor‐action interaction, identified thanks to the literature review of sustainability initiatives of mining companies. Applying network analysis, we examine the structural characteristics of the networks and the strength of links between social actors. The results highlighted that “Government,” “Local society,” and “Indigenous peoples” have a critical position in the network of “Supporting” and “Inhibitory” actions. They are those who could articulate with other social actors to create collaborative processes in the implementation of actions that contribute to sustainable development by the mining industry. However, from the analysis of the structure of the network of “Inhibitory” actions, these three actors are the ones who could be relevant in the dynamics of the development of conflicts with the mining industry. This study presents, from the dual perspective (“Supporting” and “Inhibitory” actions), the characteristics of the systems of relationships between social actors and their possible implications for the design, as well as implementation of sustainable strategies in the mining sector.