Linked Links—A Research Project: The Multiple Superimposed Soft Networks as Network Profiles
Abstract
:1. Introduction
- Induce or deactivate the emergence of collective behaviors in populations of elements collectively interacting;
- Act on collective emergent phenomena with the purpose of changing, maintaining, and regulating acquired properties;
- Merge different collective emergent phenomena.
2. Nodes and Links for a New Perspective
2.1. Nodes
- (a)
- Nodes as input–output devices, whose activity ranges from performing connection activities; to summative of the input received through N input links, according to various possible ways, for example, non-linear, time-dependent, dependent on previous conditions, and weighs; until performing processing activities, for example, composing by using fixed or time-context-dependent rules, and selected input received. In the simplest case, it is a matter of passive, i.e., switching, conductive, connective nodes. In the latter case, such nodes may be intended just as extensions of the links, i.e., a networked configuration of the same material, for instance, networks made of the same electric conductive material. The nodes can be in an active or inactive state, in ways that vary over time in regular or random ways, where the role of the node is reduced, for instance, to an electric resistor or diode. Examples include electricity, road, telecommunications, and water networks.
- (b)
- Nodes as generic units, for instance, containers in a port warehouse, people in a community, vehicles in the traffic, and words of a text relationally connected. For instance, containers may relate to each other by weight and arrival time; people by their nationality or level of friendship in social networks; vehicles by their speed or by their registration period; and words by the fact that their meaning is semantically close or by the fact that they often both appear in single sentences (see Figure 1). Examples include air, bus, citation, naval, rail, and social networks. The difference with the situation considered in the previous point is not actually so precise, as the roles could even be partially or temporally interchangeable or even simultaneous.
- (c)
- Nodes consist of pairs of linked nodes of the network under study, as highlighted in Figure 2. Due to the undefined nature of the generic nodes, the case of nodes consisting of links, i.e., linked links (see Figure 3, Figure 4 and Figure 5 and Section 3), seems to be just a particular case of usual networks. However, the non-triviality of the case consists of the properties (in the case of self-definitory, see Section 5.1, and emergent, see Section 5.2) of such possibly multilayered linkages, i.e., the multiple superimposed soft networks (MSSN), considerable to profile and manage (see Section 6.1) networks. This term differentiates from others already in use for specific cases, such as dual networks, meta-networks, multiple networks, multiplex networks, networks of networks, and overlay networks (see Section 3.1).
2.2. Links
- (a)
- Active links (for instance, pipes and cables conveying matter or energy) include road, naval, and air routes for passengers and cargo. The technological understanding of the active linkages presupposes additional characteristics, such as link coatings (where the coatings are to avoid electrical short circuits between links); sensitivity to environmental perturbations; formation and degeneration of the lining, such as the myelin-like coatings of neurological networks whose damage in certain neurological diseases, e.g., multiple sclerosis, generates the production of pathological scars. Moreover, we should consider the possible occurrence of properties and phenomena such as link acquisitions, capacity, combination, fluidity (level of internal friction), interconnectivity, loss, temporality, and virtuality when a phenomenon operates, moreover, also as a link as in social and citations networks; the occurrence of stable and variable links properties such as unidirectionality, bidirectionality, e.g., two-way, contextual sensitiveness, and weighing. Examples of active relational links include the linkage of social and citation networks. In this contribution, we consider the effective, parametrical, statistical, weighted usage of the network of active links, which is not only considered for its geometrical properties, i.e., networks as graphs. The geometrical network linkage is coupled, for instance, with effective uses characterizing the nodes and links of the networks, e.g., airlines, roads, social, and telecommunication. Users are represented by weights and statistical values related to the occurrence of properties. In the second case, networks as graphs, the focus is on geometrical properties, and effective usage is placed in the background (see Section 5.1).
- (b)
- Active interactional links represent the interactions, e.g., through the exchange of energy or information, between nodes, for instance, with the occurrence of multiple interactions and roles for component parts, as in ecosystems and collective behaviors.
- (c)
- Passive links express existing or emerging relationships between pairs of links of the active linkage under study and representing modes, practices of occurring, and interdependences between active links, for instance, being correspondingly in an active–inactive state, simultaneously in the same state, synchronized or not, and weights characterizing the intensities of the relationship. Passivity is considered given by their relational, representative rather than computational, connective, elaborative, and phenomenological nature. For instance, let us consider links of a road network that are characterized by their actual practicability or not, that are passable in two ways, in one-way only or in alternating directions. Passive links between pairs of such active links state their same or opposite levels of practicability; their being passable in two ways, in one-way only, and in alternating directions in combinations, e.g., when one is two-ways, the other is one-way, or when one is two-ways, the other is in alternating directions and have mutually direct or inverse proportional traffic values. The passive linkage is also applicable to links of the passive linkage themselves, i.e., links of links subject of this article as highlighted in Figure 5 (see Section 3.2 and Section 4, for examples).
3. Linked Links: The Multiple Superimposed Soft Networks
- The study of “multiplex networks”, when “… a multiplex complex system can indeed exhibit structural and dynamical properties that cannot be represented by its individual layer’s properties alone, establishing the network multiplexity as an essential ingredient in the new physics of network of networks” such as in previous work ([13], p. 9; [14]).
- The usage of “dual networks” in electrical engineering is when, in two electrical networks, the mesh equations of one network are equal to the node equation of the other. In the smallest loop, which is a closed one and formed by using circuit components, the mesh must not have any other loop inside it. In short, the term “node equation” is used in electrical engineering to refer to a method (nodal analysis) of analyzing electrical circuits. Two electrical networks are dual networks if the mesh equations of one network are equal to the node equation of the other [15].
- Examples of other variants include (a) meta-networks consisting of two learning components, a base learner, and a meta learner, also equipped with external memory [16,17,18]; and (b) overlay networks, computer networks layered on top of each other. The overlay networking is distinct from the open systems interconnection (OSI) layered networks model, assuming that the underlay network is an internet protocol (IP) network [19].
3.1. Multiple Superimposed Soft Networks
- The elements of N are the nodes;
- The elements of L are pairs of nodes, called links.
- The set N has an integer cardinality;
- The set can contain only ordered pairs of nodes (directed links);
- Each link is associated with a numerical weight.
- L are links of the basic effective network G;
- L1 are links between pairs of links L, e.g., stating the simultaneous validity or non-validity of pair of links L, and by possible layered n-sequences of
3.2. Conceptual Examples
4. Actual Examples of MSSN
5. Constitutive Mechanisms of the MSSN Linkage
5.1. Self-Definition of the Passive Linkage
- In geomorphology, when there is interest in using different approaches to consider and represent time, for instance, substitute space for time;
- In population studies, when reconstructing the past evolution of a population starting from actual data (the so-called inverse projection);
- In economics when, in the long run, or over a large scale, the distribution of income classes is independent of the transition probabilities ruling the evolution of the system from one state (classes of income) to another.
5.2. Emergence of the Passive Linkage
5.3. Relation between the Linkage Levels
6. Usages of the MSSN Properties and Profiles
6.1. MSSN Properties and Profiles
- Use of formalized, e.g., geometrical, evaluations establishing correspondences and measurements between active linkage and MSSN properties;
- Use of experiential, i.e., related big data and machine-learned correspondences between active linkage and MSSN properties.
- Seven passive links have “similar throughput”;
- Three passive links are “temporal synchronization between two linked active links”.
- Four passive links “temporal duration properties between two linked passive links”;
- One passive link “temporal synchronization between two linked active links”;
- Five passive links “compatibility-incompatibility of the state on for the linked two passive links”.
- Seven passive links “same-opposite practicability and directions of the connected active links” between active links occur at time th;
- Three passive links “same-opposite practicability and directions of the connected active links” out of seven active links are non-adjacent at time th;
- Six passive links with “similar throughput” occur at time th;
- Six passive links with “similar throughput” are separated by four intermediate links at time th;
- Three passive links “temporal synchronization between two linked active links” occur at time th;
- Two passive links with “temporal synchronization between two linked active links” are not adjacent at the time th;
- Three existing passive links “temporal synchronization between two linked active links” have one intermediate link at time th;
- Two passive links between active links “temporal duration properties between the two linked active links” occur at time th.
6.2. Self-Regulatory Mechanisms
7. Passive Linkage of Multiple Superimposed Soft Networks as Weak Forces
- Low value, for instance, less than the minimum of all forces involved at the moment;
- Local ranges of influence involve very few (in reference to the totality of elements considered) spatially adjacent composing elements.
7.1. Weakness and Theoretical Incompleteness
- The emergence—in short, the acquisition of multiple, dynamic coherences as new properties irreducible to the previous ones—of complex systems requires theoretical incompleteness, i.e., theoretically incompletable distinguished from completable incompleteness. Classic cases of theoretical incompleteness are Heisenberg’s Uncertainty Principle, by which accuracy in measuring one variable is at the expense of another; the complementarity in theoretical physics, e.g., between wave and particle natures; and the incompleteness in Gödel’s theorems. Here, the theoretical incompleteness relates to the partial acquisitions, losses, and recovery of properties in processes of emergence in a dynamic of equivalences, for instance, of collective behaviors in which the different, but essentially microscopically equivalent, states that an agent can subsequently acquire have minimal differences. However, states that have minimal differences trigger crucial incomplete, irregular sequences of subsequent effects that then materialize in specific behaviors. Completeness can be thought of as the ‘worst enemy’ of emergence because it produces ruled contexts excluding equivalences, interchangeabilities, the role of weak forces -such as fluctuations- that decide equilibrium breakdowns and initiate linked sequences, and multiple roles on which the processes of self-organization, emergence, and their unicity are based. These are weakly regulated contexts and are, therefore, full of possibilities. Emergence is based on exploratory properties.
- Quasi-systems are not always systems, not only systems, and not always the same systems: their systemic nature, i.e., the ability to acquire properties, is present in a weaker mode, reoccurring but only variably predominant.
- Systems science, complex systems science extended with the concepts of incompleteness and quasi-systems
- Network science is extended by combining networks and their clouded MSSN.
7.2. Perspective Applications
- Compatibilities;
- Incompatibilities;
- Simultaneities;
- Synchronizations;
- Temporal constraints.
8. Research Issues on MSSN and Trans-Disciplinarity
- (1)
- Implementation of methodologies and approaches to carry out software-based self-designed possible, equivalent, or non-equivalent MSSN on an active linkage under consideration, such as network design software and tools available on the market [91].
- (2)
- Identify generic and possible formal properties of the MSSN layers.
- (3)
- Equivalence conditions between different levels or groups of levels of the MSSN.
- (4)
- Tools and approaches to detect properties of MSSN to be used as profiles.
- (5)
- Tools to identify emergence mechanisms from the network of active linkages (see Section 5.2).
- (6)
- Possible combinations, applications of the passive linkages to other networks of active linkages, introducing possible standardizations. Ability to store, generate, and transmit different MSSN.
- (7)
- Elaborate on profiling techniques, MSSN properties, their usages, and interdependence.
- (8)
- Research on cases of possible self-regulation through machine learning-based approaches on adaptive networks.
- (9)
- Given the soft nature of interdependences represented by the MSSN, they can be related to the weak forces considered in the literature (see Section 7). The properties of the MSSN and its profile may be considered to have a role as weak forces. Furthermore, the approach is conceptually considerable for processes without certain or certainly identifiable beginning events, such as for some economic transformations and illnesses. Moreover, the latter is the case for the generic inflammatory processes in biology at the beginning of (and not definitively causing) several pathologies and neurodegenerative diseases such as multiple sclerosis. In these cases, their profile can reveal pathological processes in the constitution (through compatibility considerations) or in progress.
- (10)
- In physics, fields are intended to prescribe a well-defined value to any entities at a point, such as electric and electromagnetic fields.Domains are intended as spatial regions of possible options available to entering entities, such as the permissible and compatible behaviors and states of an entity expected to respect the relevant constraints and degrees of freedom of the domain. This is the case of systemic domains, e.g., spaces within which collective behaviors occur, inducing (if not forcing) entering entities to behave systemically ([40], pp. 170–175). The entering entities may face occasional scenarios of equivalent options in multiple superimposed domains that are then decided, for instance, by fluctuations. Domains may be considered non-continuous since zones with multiple options are possible.A network domain, identified by a domain name, is usually intended as the administrative grouping of multiple private computer networks or local hosts inside the same infrastructure. Here, in consideration of the virtuality of the MSSN, we generalize by considering networked domains where, taking it to the extreme, each point is the vertex of at least one network. More realistically, it will be a matter of considering the area of space at an appropriate level of granularity of vertexes constituting networked domains. In the case of multiple domains, these are multiple networks. We believe that networked domains constitute an interesting generic interdisciplinary field of study focused, for example, on the study of implicit and potential space of network properties possibly activated and collapsed by appropriate events.
Trans-Disciplinarity of the MSSN
- Interdisciplinary “development” link between social systems and biological systems, for which development processes are described by similar models;
- Interdisciplinary link “resilience” between ecosystems, for which there is the ability to re-establish balance or coherence in the face of disturbances and materials, for which there is the ability to resist impacts and breakages by absorbing energy through their own deformation to then reorganize and return to the original shape as, for example, for rubber bands. The resilience processes are described by similar models.
9. Conclusions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Conflicts of Interest
References
- Barabasi, A.L. Linked: The New Science of Networks; Perseus Publishing: Cambridge, MA, USA, 2002. [Google Scholar]
- Barabasi, A.-L. Network Science; Cambridge University Press: Cambridge, UK, 2016. [Google Scholar]
- Barabasi, A.-L.; Albert, R. Emergence of scaling in random networks. Science 1999, 286, 509–512. [Google Scholar] [CrossRef] [PubMed]
- Newman, M.; Barabasi, A.-L.; Watts, D.J. (Eds.) The Structure and Dynamics of Networks; Princeton University Press: Princeton, NJ, USA, 2006. [Google Scholar]
- Valente, T.W. Network interventions. Science 2012, 337, 49–53. [Google Scholar] [CrossRef] [PubMed]
- Lewis, T.G. Network Science: Theory and Applications; Wiley: Hoboken, NJ, USA, 2009. [Google Scholar]
- Boguñá, M.; Bonamassa, I.; De Domenico, M.; Havlin, S.; Krioukov, D.; Serrano, M.A. Network geometry. Nat. Rev. Phys. 2021, 3, 114–135. [Google Scholar] [CrossRef]
- Jing, F.; Liu, C.; Wu, J.L.; Zhang, Z.K. Toward Structural Controllability and Predictability in Directed Networks. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 7692–7701. [Google Scholar] [CrossRef]
- D’Agostino, G.; Scala, A. (Eds.) Networks of Networks: The Last Frontier of Complexity; Springer: New York, NY, USA, 2014. [Google Scholar]
- Kenett, D.Y.; Perc, M.; Boccaletti, S. Networks of networks—An introduction. Chaos Solitons Fractals 2015, 80, 1–6. [Google Scholar] [CrossRef]
- Minati, G.; Penna, M.P. (Eds.) Multiple Systems: Complexity and Coherence in Ecosystems, Collective Behavior, and Social Systems; Springer: New York, NY, USA, 2024. [Google Scholar]
- Magnani, M.; Rossi, L. Formation of Multiple Networks. In Social Computing, Behavioral-Cultural Modeling and Prediction, Proceedings of the 6th International Conference, SBP 2013, Washington, DC, USA, 2–5 April 2013; Lecture Notes in Computer Science; Greenberg, A.M., Kennedy, W.G., Bos, N.D., Eds.; Springer: Berlin/Heidelberg, Germany, 2013; pp. 257–264. [Google Scholar] [CrossRef]
- Lee, K.M.; Kim, J.Y.; Lee, S.; Goh, K.I. Multiplex Networks. In Networks of Networks: The Last Frontier of Complexity. Understanding Complex Systems; D’Agostino, G., Scala, A., Eds.; Springer: Cham, Switzerland, 2014; pp. 53–72. [Google Scholar] [CrossRef]
- Nicosia, V.; Bianconi, G.; Latora, V.; Barthelemy, M. Growing multiplex networks. Phys. Rev. Lett. 2013, 111, 058701. [Google Scholar] [CrossRef] [PubMed]
- Urbano, M. Nodal Analysis: Circuit Analysis. In Introductory Electrical Engineering with Math Explained in Accessible Language; Urbano, M., Ed.; Wiley: New York, NY, USA, 2020; pp. 215–233. [Google Scholar] [CrossRef]
- Munkhdalai, T.; Yu, H. Meta Networks. In Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, 6–11 August 2017; pp. 2554–2563. [Google Scholar]
- Santoro, A.; Bartunov, S.; Botvinick, M.; Wierstra, D.; Lillicrap, T. Meta-learning with memory-augmented neural networks. In Proceedings of the 33rd International Conference on Machine Learning, New York, NY, USA, 20–22 June 2016; Balcan, M.F., Weinberger, K.Q., Eds.; PMLR: Breckenridge, CO, USA, 2016; Volume 48, pp. 1842–1850. Available online: https://proceedings.mlr.press/v48/ (accessed on 17 May 2024).
- Schmidhuber, J. A neural network that embeds its own meta-levels. In Proceedings of the IEEE International Conference on Neural Networks, San Francisco, CA, USA, 28 March–1 April 1993; Beygelzimer, A., Dauphin, Y., Liang, P., Wortman Vaughan, J., Eds.; IEEE: San Francisco, CA, USA, 1993; pp. 407–412. [Google Scholar] [CrossRef]
- Tarkoma, S. Overlay Networks: Toward Information Networking; CRC Press: Boca Raton, FL, USA, 2010. [Google Scholar]
- Uversky, V.N.; Giuliani, A. Networks of Networks: An Essay on Multi-Level Biological Organization. Front. Genet. 2021, 12, 706260. [Google Scholar] [CrossRef]
- Dornelas, V.; Ramos, M.; Anteneodo, C. Impact of network randomness on multiple opinion dynamics. Phys. A Stat. Mech. Its Appl. 2018, 506, 197–207. [Google Scholar] [CrossRef]
- Pung, J.; D’souza, R.M.; Ghosal, D.; Zhang, M. A road network simplification algorithm that preserves topological properties. Appl. Netw. Sci. 2022, 7, 79. [Google Scholar] [CrossRef]
- Reza, S.; Ferreira, M.C.; Machado, J.; Tavares, J.M.R. Road networks structure analysis: A preliminary network science-based approach. Ann. Math. Artif. Intell. 2022, 92, 215–234. [Google Scholar] [CrossRef]
- Huang, X.; Song, L. An emergency logistics distribution routing model for unexpected events. Ann. Oper. Res. 2018, 269, 223–239. [Google Scholar] [CrossRef]
- Wei, M.; Huang, Y.; Wan, D.; Deng, L. Emergency road network structure and planning optimization in mountainous regions in Southwest China under earthquake scenarios. J. Mt. Sci. 2022, 19, 771–780. [Google Scholar] [CrossRef]
- Rohr, A.; Priesmeier, P.; Tzavella, K.; Fekete, A. System Criticality of Road Network Areas for Emergency Management Services—Spatial Assessment Using a Tessellation Approach. Infrastructures 2020, 5, 99. [Google Scholar] [CrossRef]
- Marin, A.; Wellman, B. Social network analysis: An introduction. In The SAGE Handbook of Social Network Analysis; Scott, J., Carrington, P., Eds.; Sage Publications: London, UK, 2014; pp. 11–25. [Google Scholar] [CrossRef]
- Borgatti, S.P.; Everett, M.G.; Johnson, J.C.; Agneessens, F. Analyzing Social Networks; Sage Publications: London, UK, 2024. [Google Scholar]
- Granovetter, M. The Strength of Weak Ties. Am. J. Sociol. 1973, 78, 1360–1380. [Google Scholar] [CrossRef]
- Watts, D.; Strogatz, S. Collective dynamics of ‘small-world’ networks. Nature 1998, 393, 440–442. [Google Scholar] [CrossRef] [PubMed]
- Kinoshita, S. (Ed.) Pattern Formations and Oscillatory Phenomena & Belousov-Zhabotinsky Reaction; Elsevier: Amsterdam, The Netherlands, 2013. [Google Scholar]
- Tyson, J.J. The Belousov-Zhabotinskii Reaction; Springer: Berlin/Heidelberg, Germany, 1976. [Google Scholar]
- Getling, A.V. Rayleigh-Bénard Convection: Structures and Dynamics; World Scientific: Singapore, 1998. [Google Scholar]
- Bostrom, N. Superintelligence: Paths, Dangers, Strategies; Oxford University Press: Oxford, UK, 2014. [Google Scholar]
- Huang, K. Introduction to Statistical Physics; Routledge: London, UK, 2010. [Google Scholar]
- Baglietto, G.; Albano, E.V. Finite-size scaling analysis and dynamic study of the critical behavior of a model for the collective displacement of selfdriven individuals. Phys. Rev. E 2008, 78, 021125. [Google Scholar] [CrossRef] [PubMed]
- Baglietto, G.; Albano, E.V. Nature of the order–disorder transition in the Vicsek model for the collective motion of self-propelled particles. Phys. Rev. E 2009, 80, 050103. [Google Scholar] [CrossRef]
- Bar-Yam, Y. Dynamics of Complex Systems; CRC Press: Boca Raton, FL, USA, 2019. [Google Scholar]
- Merelli, E.; Rucco, M. Topological characterization of complex systems: Using persistent entropy. Entropy 2015, 17, 6872–6892. [Google Scholar] [CrossRef]
- Minati, G.; Pessa, E. From Collective Beings to Quasi-Systems; Springer: New York, NY, USA, 2018. [Google Scholar]
- Lambiotte, R.; Rosvall, M.; Scholtes, I. From networks to optimal higher -order models of complex systems. Nat. Phys. 2019, 15, 313–320. [Google Scholar] [CrossRef]
- Lü, J.; Yu, X.; Chen, G.; Yu, W. Complex Systems and Networks—Dynamics, Controls and Applications; Springer: New York, NY, USA, 2016. [Google Scholar]
- Cohen, R.; Havlin, S. Complex Networks: Structure, Robustness and Function; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
- Estrada, E. The Structure of Complex Networks: Theory and Applications; Oxford University Press: Oxford, UK, 2016. [Google Scholar]
- Van der Hofstadt, R. Random Graphs and Complex Networks; Cambridge University Press: Cambridge, UK, 2017. [Google Scholar]
- Li, M.; Liu, R.-R.; Lü, L.; Hu, M.-B.; Xu, S.; Zhang, Y.-C. Percolation on complex networks: Theory and application. Phys. Rep. 2021, 907, 1–68. [Google Scholar] [CrossRef]
- Halmos, P. Lectures on Ergodic Theory; Dover Books on Mathematics: Mineola, NY, USA, 2017. [Google Scholar]
- Janot, C. Quasicrystals: A Primer; Oxford University Press: Oxford, UK, 2012. [Google Scholar]
- Gilles, R.; Ruys, P.H.M.; Jilin, S. Quasi-Networks in Social Relational Systems. Syst. Sci. Syst. Eng. 1992, 1, 25–33. [Google Scholar]
- Daniel, J. Sampling Essentials: Practical Guidelines for Making Sampling Choices; Sage Publications: London, UK, 2011. [Google Scholar]
- Banerji, C.R.S.; Miranda-Saavedra, D.; Severini, S.; Widschwendter, M.; Enver, T.; Zhou, J.X.; Teschendorff, A.E. Cellular network entropy as the energy potential in Waddington’s differentiation landscape. Sci. Rep. 2013, 3, 3039. [Google Scholar] [CrossRef] [PubMed]
- Diaz, R.M.; Ye, H.; Ernest, S.K.M. Empirical abundance distributions are more uneven than expected given their statistical baseline. Ecol. Lett. 2021, 24, 2025–2039. [Google Scholar] [CrossRef] [PubMed]
- Abedjan, Z. Data Profiling. In Encyclopedia of Big Data Technologies; Zomaya, A., Taheri, J., Sakr, S., Eds.; Springer: Cham, Switzerland, 2022; pp. 1–6. [Google Scholar] [CrossRef]
- Abedjan, Z.; Golab, L.; Naumann, F. Data Profiling: A Tutorial. In Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD’17), Chicago, IL, USA, 14–19 May 2017; Meliou, A., Senellart, P., Eds.; Association for Computing Machinery: New York, NY, USA, 2017; pp. 1747–1751. [Google Scholar] [CrossRef]
- Davenport, T.H. Big Data at Work; Harvard Business Review Press: Boston, MA, USA, 2014. [Google Scholar]
- Franks, B. Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced Analytics; Wiley: Hoboken, NJ, USA, 2012. [Google Scholar]
- Tantardini, M.; Ieva, F.; Tajoli, L.; Piccardi, C. Comparing methods for comparing networks. Sci. Rep. 2019, 9, 17557. [Google Scholar] [CrossRef] [PubMed]
- LeCun, Y.; Bengio, Y.; Hinton, G. Deep Learning. Nature 2015, 521, 436–444. [Google Scholar] [CrossRef]
- Goodfellow, I.; Bengio, Y.; Courville, A. Deep Learning; MIT Press: Cambridge, MA, USA, 2016. [Google Scholar]
- Batouche, M.; Meshoul, S.; Al Hussaini, A. Image processing using quantum computing and reverse emergence. Int. J. Nano Biomater. 2009, 2, 136–142. [Google Scholar] [CrossRef]
- Djemame, S.; Batouche, M.; Oulhadj, H.; Siarry, P. Solving reverse emergence with quantum PSO application to image processing. Soft Comput. 2019, 23, 6921–6935. [Google Scholar] [CrossRef]
- di Bernardo, M. Controlling Collective Behavior in Complex Systems. In Encyclopedia of Systems and Control; Baillieul, J., Samad., T., Eds.; Springer: Cham, Switzerland, 2021; pp. 441–450. [Google Scholar] [CrossRef]
- Ciampaglia, G.L.; Ferrara, E.; Flammini, A. Collective behaviors and networks. EPJ Data Sci. 2014, 3, 37. [Google Scholar] [CrossRef]
- Boccaletti, S.; Latora, V.; Moreno, Y.; Chavez, M.; Hwang, D.-U. Complex networks: Structure and dynamics. Phys. Rep. 2006, 424, 175–308. [Google Scholar] [CrossRef]
- D’Souza, R.M.; di Bernardo, M.; Liu, Y.Y. Controlling complex networks with complex nodes. Nat. Rev. Phys. 2023, 5, 250–262. [Google Scholar] [CrossRef]
- Lunardi, A. Interpolation Theory; Springer: New York, NY, USA, 2018. [Google Scholar]
- Kohonen, T. Self-Organizing Maps, 3rd ed.; Springer: New York, NY, USA, 2001. [Google Scholar] [CrossRef]
- Kohonen, T. Essentials of the self-organizing map. Neural Netw. 2013, 37, 52–65. [Google Scholar] [CrossRef] [PubMed]
- Schmidt, J.T. Self-Organizing Neural Maps: The Retinotectal Map and Mechanisms of Neural Development: From Retina to Tectum; Academic Press: London, UK, 2019. [Google Scholar]
- Chen, W.; Tian, Z. Interpolation-based k-means Clustering Improvement for Sparse, High Dimensional Data. In Proceedings of the 2019 3rd International Conference on Cloud and Big Data Computing, Oxford, UK, 28–30 August 2019; pp. 11–15. [Google Scholar] [CrossRef]
- Aggarwal, C.C.; Reddy, C.K. Data Clustering: Algorithms and Applications; CRC Press: Boca Raton, FL, USA, 2013; Available online: https://people.cs.vt.edu/~reddy/papers/DCBOOK.pdf (accessed on 17 May 2024).
- Mirkin, B. Clustering: A Data Recovery Approach; CRC Press: Boca Raton, FL, USA, 2012. [Google Scholar]
- Hair, J.F., Jr.; Black, W.C. Multivariate Data Analysis; Pearson: Harlow, UK, 2013. [Google Scholar]
- Everitt, B.S.; Landau, S.; Leese, M.; Stahl, D. Cluster Analysis; Wiley: Chichester, UK, 2011. [Google Scholar]
- Christen, P. Data Matching: Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection; Springer: New York, NY, USA, 2014. [Google Scholar]
- Banagl, M.; Vogel, D. (Eds.) The Mathematics of Knots, Theory and Application; Springer: New York, NY, USA, 2010. [Google Scholar]
- Fang, S.C. Routeing in a Network with Multi-Class Links. J. Oper. Res. Soc. 1984, 35, 637–640. [Google Scholar] [CrossRef]
- Mukherjee, S.; Mukhopadhyay, S.; Sarkar, S. Personal Social Network Profile Authentication through Image Steganography. Eng. Proc. 2023, 56, 129. [Google Scholar] [CrossRef]
- da Silva, S.A.; de Medeiros, V.W.C.; Gonçalves, G.E. Monitoring and classification of cattle behavior: A survey. Smart Agric. Technol. 2023, 3, 100091. [Google Scholar] [CrossRef]
- Gao, G.; Wang, C.; Wang, J.; Lv, Y.; Li, Q.; Ma, Y.; Zhang, X.; Li, Z.; Chen, G. CNN-Bi-LSTM: A Complex Environment-Oriented Cattle Behavior Classification Network Based on the Fusion of CNN and Bi-LSTM. Sensors 2023, 23, 7714. [Google Scholar] [CrossRef] [PubMed]
- Gilbert, M. (Ed.) Artificial Intelligence for Autonomous Networks; CRC Press: Boca Raton, FL, USA, 2020. [Google Scholar]
- Zschaler, G. Adaptive-network models of collective dynamics. Eur. Phys. J. Spec. Top. 2012, 211, 1–101. [Google Scholar] [CrossRef]
- Berner, R.; Gross, T.; Kuehn, C.; Kurths, J.; Yanchuk, S. Adaptive dynamical networks. Phys. Rep. 2023, 1031, 1–59. [Google Scholar] [CrossRef]
- Gross, T.; Sayama, H. Adaptive Networks. In Understanding Complex Systems; Gross, T., Sayama, H., Eds.; Springer: Berlin/Heidelberg, Germany, 2009; pp. 1–8. [Google Scholar] [CrossRef]
- Sayama, H.; Pestov, I.; Schmidt, J.; Bush, B.J.; Wong, C.; Yamanoi, J.; Gross, T. Modeling complex systems with adaptive networks. Comput. Math. Appl. 2013, 65, 1645–1664. [Google Scholar] [CrossRef]
- Minati, G. Multiplicity, Logical Openness, Incompleteness, and Quasi-ness as Peculiar Non-reductionist Properties of Complexity. In From Electrons to Elephants and Elections: Saga of Content and Context; Wuppuluri, S., Stewart, I., Eds.; Springer: New York, NY, USA, 2022; pp. 151–173. Available online: https://link.springer.com/chapter/10.1007/978-3-030-92192-7_10 (accessed on 17 May 2024).
- Licata, I.; Minati, G. Emergence, Computation and the Freedom Degree Loss Information Principle in Complex Systems. Found. Sci. 2017, 22, 863–881. [Google Scholar] [CrossRef]
- Kellerman, H. The Unconscious Domain; Springer: New York, NY, USA, 2020. [Google Scholar]
- Minati, G.; Vitiello, G. Mistake Making Machines. In Systemics of Emergence: Applications and Development; Minati, G., Pessa, E., Abram, M., Eds.; Springer: New York, NY, USA, 2006; pp. 67–78. [Google Scholar]
- Bonometti, P. Improving safety, quality and efficiency through the management of emerging processes: The Tenaris Dalmine experience. Learn. Organ. 2012, 19, 299–310. [Google Scholar] [CrossRef]
- Wehrle, K.; Güneş, M.; Gross, J. (Eds.) Modeling and Tools for Network Simulation; Springer: Berlin, Heidelberg, Germany, 2010. [Google Scholar]
- Rosen, R. Anticipatory systems. In Anticipatory Systems: Philosophical, Mathematical, and Methodological Foundations; Rosen, R., Ed.; Springer: New York, NY, USA, 2011; pp. 313–370. [Google Scholar]
- Rosen, J. Robert Rosen’s Anticipatory Systems Theory: The Science of Life and Mind. Mathematics 2022, 10, 4172. [Google Scholar] [CrossRef]
- Ruelle, D. Chaotic Evolution and Attractors; Cambridge University Press: Cambridge, UK, 2008. [Google Scholar]
- Boccaletti, S.; Kurths, J.; Osipov, G.; Valladares, D.L.; Zhouc, C.S. The synchronization of chaotic systems. Phys. Rep. 2002, 366, 1–98. [Google Scholar] [CrossRef]
- Nicosia, V.; Valencia, M.; Chavez, M.; Diaz-Guilera, A.; Latora, V. Remote synchronization reveals network symmetries and functional modules. Phys. Rev. Lett. 2013, 110, 174102–174106. [Google Scholar] [CrossRef] [PubMed]
- Le Hunte, B. Transdisciplinarity. In The Palgrave Encyclopedia of the Possible; Glăveanu, V.P., Ed.; Palgrave Macmillan: Cham, Switzerland, 2022; pp. 1669–1676. [Google Scholar] [CrossRef]
- Nicolescu, B. (Ed.) Transdisciplinarity—Theory and Practice; Hampton Press: Cresskill, NJ, USA, 2008. [Google Scholar]
- Yu, Y.X.; Gong, H.P.; Liu, H.C.; Mou, X. Knowledge representation and reasoning using fuzzy Petri nets: A literature review and bibliometric analysis. Artif. Intell. Rev. 2023, 56, 6241–6265. [Google Scholar] [CrossRef]
- Evans, J.A.; Foster, J.G. Metaknowledge. Science 2011, 331, 721–725. [Google Scholar] [CrossRef] [PubMed]
- Anderson, C. The End of Theory: The Data Deluge Makes the Scientific Method Obsolete. Wired Mag. 2008, 16. Available online: https://www.cs.hmc.edu/twiki/pub/CS5/Reading1Gold/end_of_theory.pdf (accessed on 17 May 2024).
- Pigliucci, M. The end of theory in science? EMBO Rep. 2009, 10, 534. [Google Scholar] [CrossRef]
- Calude, C.S.; Longo, G. The deluge of spurious correlations in big data. Found. Sci. 2016, 22, 595–612. [Google Scholar] [CrossRef]
- Coveney, P.V.; Dougherty, E.R.; Highfield, R.R. Big data need big theory too. Philos. Trans. R. Soc. A Math. Phys. Eng. Sci. 2016, 280, 20160153. [Google Scholar] [CrossRef]
Examples of Active Links Conveying Information, Matter, or Energy | Examples of Properties of Active Links |
---|---|
|
|
Examples of Properties of Active Links Constituting the Nodes | Examples of Passive Links as Mutual Intra-Active Links Properties | ||
---|---|---|---|
|
|
Examples of Passive Links as Mutual Intra-Active Links Properties Constituting the Node | Examples of Passive Links between Passive Green Dotted Links |
---|---|
|
|
Ideal Modeling | Non-Ideal Modeling |
---|---|
Field equations, such as those of Maxwell’s electromagnetic field | Cellular automata |
Deterministic chaos equations | Dissipative structures |
Network science (ideal scale-free networks) | Agent-based models |
Ergodic systems | Artificial life |
Equations of mechanics | Neural networks |
Equations of thermodynamics | Properties of big data |
Cases of Passive Links as Mutual Intra-Active Links Properties (See Table 2) | Number of Occurrences in the Instant under Consideration |
---|---|
| x1(t) |
| x2(t) |
| x3(t) |
| x4(t) |
| x5(t) |
| x6(t) |
| x7(t) |
| x8(t) |
Cases of Passive Links between Passive Links (See Table 3) | Number of Occurrences in the Instant under Consideration |
---|---|
| y1(t) |
| y2(t) |
| y3(t) |
| y4(t) |
| y5(t) |
Passive Links Occurring at Time t, See Table 5 | Network Links Parameters | ||
---|---|---|---|
Number of Passive Links in the State Active at Time t | Number of Non-Adjacent Passive Links at Time t | Number of Intermediate Links at Time t | |
| z1,1(t) | z1,2(t) | z1,3(t) |
| z2,1(t) | z2,2(t) | z2,3(t) |
| z3,1(t) | z3,2(t) | z3,3(t) |
| z4,1(t) | z4,2(t) | z4,3(t) |
| z5,1(t) | z5,2(t) | z5,3(t) |
| z6,1(t) | z6,2(t) | z6,3(t) |
| z7,1(t) | z7,2(t) | z7,3(t) |
| z8,1(t) | z8,2(t) | z8,3(t) |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Minati, G. Linked Links—A Research Project: The Multiple Superimposed Soft Networks as Network Profiles. Systems 2024, 12, 303. https://doi.org/10.3390/systems12080303
Minati G. Linked Links—A Research Project: The Multiple Superimposed Soft Networks as Network Profiles. Systems. 2024; 12(8):303. https://doi.org/10.3390/systems12080303
Chicago/Turabian StyleMinati, Gianfranco. 2024. "Linked Links—A Research Project: The Multiple Superimposed Soft Networks as Network Profiles" Systems 12, no. 8: 303. https://doi.org/10.3390/systems12080303
APA StyleMinati, G. (2024). Linked Links—A Research Project: The Multiple Superimposed Soft Networks as Network Profiles. Systems, 12(8), 303. https://doi.org/10.3390/systems12080303