1
|
Jia M, Gabrys B, Musial K. Directed closure coefficient and its patterns. PLoS One 2021; 16:e0253822. [PMID: 34170971 PMCID: PMC8232453 DOI: 10.1371/journal.pone.0253822] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/01/2021] [Accepted: 06/13/2021] [Indexed: 11/19/2022] Open
Abstract
The triangle structure, being a fundamental and significant element, underlies many theories and techniques in studying complex networks. The formation of triangles is typically measured by the clustering coefficient, in which the focal node is the centre-node in an open triad. In contrast, the recently proposed closure coefficient measures triangle formation from an end-node perspective and has been proven to be a useful feature in network analysis. Here, we extend it by proposing the directed closure coefficient that measures the formation of directed triangles. By distinguishing the direction of the closing edge in building triangles, we further introduce the source closure coefficient and the target closure coefficient. Then, by categorising particular types of directed triangles (e.g., head-of-path), we propose four closure patterns. Through multiple experiments on 24 directed networks from six domains, we demonstrate that at network-level, the four closure patterns are distinctive features in classifying network types, while at node-level, adding the source and target closure coefficients leads to significant improvement in link prediction task in most types of directed networks.
Collapse
Affiliation(s)
- Mingshan Jia
- School of Computer Science, University of Technology Sydney, Sydney, NSW, Australia
- * E-mail:
| | - Bogdan Gabrys
- School of Computer Science, University of Technology Sydney, Sydney, NSW, Australia
| | - Katarzyna Musial
- School of Computer Science, University of Technology Sydney, Sydney, NSW, Australia
| |
Collapse
|
2
|
Saleetid N, Green DM. Network structure and risk-based surveillance algorithms for live shrimp movements in Thailand. Transbound Emerg Dis 2019; 66:2450-2461. [PMID: 31389195 DOI: 10.1111/tbed.13303] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/13/2018] [Revised: 06/19/2019] [Accepted: 06/27/2019] [Indexed: 11/29/2022]
Abstract
Live shrimp movements pose a potential route for site-to-site transmission of acute hepatopancreatic necrosis disease (AHPND) and other shrimp diseases. We present the first application of network theory to study shrimp epizootiology, providing quantitative information about the live shrimp movement network of Thailand (LSMN), and supporting practical and policy implementations of disease surveillance and control measures. We examined the LSMN over a 13-month period from March 2013 to March 2014, with data obtained from the Thailand Department of Fisheries. The LSMN had a mixture of characteristics both limiting and facilitating disease spread. Importantly, the LSMN exhibited power-law distributions of in and out degrees with exponents of 2.87 and 2.17, respectively. This characteristic indicates that the LSMN behaves like a scale-free network and suggests that an effective strategy to control disease spread in the Thai shrimp farming sector can be achieved by removing a small number of targeted inter-site connections (arcs between nodes). Specifically, a disease-control algorithm based on betweenness centrality (defined as the number of shortest paths between node pairs that traverse a given arc) is proposed here to prioritize targets for disease surveillance and control measures.
Collapse
Affiliation(s)
- Nattakan Saleetid
- Department of Fisheries, Kasetsart University Campus, Bangkok, Thailand
| | - Darren Michael Green
- Institute of Aquaculture, Faculty of Natural Sciences, University of Stirling, Stirling, UK
| |
Collapse
|
3
|
Ahnert SE, Fink TMA. Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space. J R Soc Interface 2017; 13:rsif.2016.0179. [PMID: 27440255 PMCID: PMC4971217 DOI: 10.1098/rsif.2016.0179] [Citation(s) in RCA: 17] [Impact Index Per Article: 2.4] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/02/2016] [Accepted: 06/23/2016] [Indexed: 01/18/2023] Open
Abstract
Network motifs have been studied extensively over the past decade, and certain motifs, such as the feed-forward loop, play an important role in regulatory networks. Recent studies have used Boolean network motifs to explore the link between form and function in gene regulatory networks and have found that the structure of a motif does not strongly determine its function, if this is defined in terms of the gene expression patterns the motif can produce. Here, we offer a different, higher-level definition of the ‘function’ of a motif, in terms of two fundamental properties of its dynamical state space as a Boolean network. One is the basin entropy, which is a complexity measure of the dynamics of Boolean networks. The other is the diversity of cyclic attractor lengths that a given motif can produce. Using these two measures, we examine all 104 topologically distinct three-node motifs and show that the structural properties of a motif, such as the presence of feedback loops and feed-forward loops, predict fundamental characteristics of its dynamical state space, which in turn determine aspects of its functional versatility. We also show that these higher-level properties have a direct bearing on real regulatory networks, as both basin entropy and cycle length diversity show a close correspondence with the prevalence, in neural and genetic regulatory networks, of the 13 connected motifs without self-interactions that have been studied extensively in the literature.
Collapse
Affiliation(s)
- S E Ahnert
- Theory of Condensed Matter Group, Cavendish Laboratory, University of Cambridge, JJ Thomson Avenue, Cambridge CB3 0HE, UK
| | - T M A Fink
- London Institute of Mathematical Sciences, 35A South Street, London W1K 2XF, UK
| |
Collapse
|
4
|
Avena-Koenigsberger A, Goñi J, Solé R, Sporns O. Network morphospace. J R Soc Interface 2015; 12:20140881. [PMID: 25540237 PMCID: PMC4305402 DOI: 10.1098/rsif.2014.0881] [Citation(s) in RCA: 58] [Impact Index Per Article: 6.4] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/07/2014] [Accepted: 12/05/2014] [Indexed: 11/23/2022] Open
Abstract
The structure of complex networks has attracted much attention in recent years. It has been noted that many real-world examples of networked systems share a set of common architectural features. This raises important questions about their origin, for example whether such network attributes reflect common design principles or constraints imposed by selectional forces that have shaped the evolution of network topology. Is it possible to place the many patterns and forms of complex networks into a common space that reveals their relations, and what are the main rules and driving forces that determine which positions in such a space are occupied by systems that have actually evolved? We suggest that these questions can be addressed by combining concepts from two currently relatively unconnected fields. One is theoretical morphology, which has conceptualized the relations between morphological traits defined by mathematical models of biological form. The second is network science, which provides numerous quantitative tools to measure and classify different patterns of local and global network architecture across disparate types of systems. Here, we explore a new theoretical concept that lies at the intersection between both fields, the 'network morphospace'. Defined by axes that represent specific network traits, each point within such a space represents a location occupied by networks that share a set of common 'morphological' characteristics related to aspects of their connectivity. Mapping a network morphospace reveals the extent to which the space is filled by existing networks, thus allowing a distinction between actual and impossible designs and highlighting the generative potential of rules and constraints that pervade the evolution of complex systems.
Collapse
Affiliation(s)
| | - Joaquín Goñi
- Department of Psychological and Brain Sciences, Indiana University, Bloomington, IN 47405-7007, USA Indiana University Network Science Institute, Indiana University, Bloomington, IN 47405, USA
| | - Ricard Solé
- ICREA-Complex Systems Laboratory, Universitat Pompeu Fabra (GRIB), Dr Aiguader 80, 08003 Barcelona, Spain Institut de Biologia Evolutiva, CSIC-UPF, Pg Maritim de la Barceloneta 37, 08003 Barcelona, Spain Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA
| | - Olaf Sporns
- Department of Psychological and Brain Sciences, Indiana University, Bloomington, IN 47405-7007, USA Indiana University Network Science Institute, Indiana University, Bloomington, IN 47405, USA
| |
Collapse
|
5
|
McDonnell MD, Yaveroğlu ÖN, Schmerl BA, Iannella N, Ward LM. Motif-role-fingerprints: the building-blocks of motifs, clustering-coefficients and transitivities in directed networks. PLoS One 2014; 9:e114503. [PMID: 25486535 PMCID: PMC4259349 DOI: 10.1371/journal.pone.0114503] [Citation(s) in RCA: 13] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/09/2014] [Accepted: 11/10/2014] [Indexed: 11/18/2022] Open
Abstract
Complex networks are frequently characterized by metrics for which particular subgraphs are counted. One statistic from this category, which we refer to as motif-role fingerprints, differs from global subgraph counts in that the number of subgraphs in which each node participates is counted. As with global subgraph counts, it can be important to distinguish between motif-role fingerprints that are 'structural' (induced subgraphs) and 'functional' (partial subgraphs). Here we show mathematically that a vector of all functional motif-role fingerprints can readily be obtained from an arbitrary directed adjacency matrix, and then converted to structural motif-role fingerprints by multiplying that vector by a specific invertible conversion matrix. This result demonstrates that a unique structural motif-role fingerprint exists for any given functional motif-role fingerprint. We demonstrate a similar result for the cases of functional and structural motif-fingerprints without node roles, and global subgraph counts that form the basis of standard motif analysis. We also explicitly highlight that motif-role fingerprints are elemental to several popular metrics for quantifying the subgraph structure of directed complex networks, including motif distributions, directed clustering coefficient, and transitivity. The relationships between each of these metrics and motif-role fingerprints also suggest new subtypes of directed clustering coefficients and transitivities. Our results have potential utility in analyzing directed synaptic networks constructed from neuronal connectome data, such as in terms of centrality. Other potential applications include anomaly detection in networks, identification of similar networks and identification of similar nodes within networks. Matlab code for calculating all stated metrics following calculation of functional motif-role fingerprints is provided as S1 Matlab File.
Collapse
Affiliation(s)
- Mark D. McDonnell
- Computational and Theoretical Neuroscience Laboratory, Institute for Telecommunications Research, University of South Australia, Mawson Lakes, South Australia, Australia
- Department of Psychology and Brain Research Centre, University of British Columbia, Vancouver, British Columbia, Canada
- * E-mail:
| | - Ömer Nebil Yaveroğlu
- California Institute of Telecommunications and Information Technology (Calit2), University of California Irvine, Irvine, California, United States of America
| | - Brett A. Schmerl
- Computational and Theoretical Neuroscience Laboratory, Institute for Telecommunications Research, University of South Australia, Mawson Lakes, South Australia, Australia
| | - Nicolangelo Iannella
- Computational and Theoretical Neuroscience Laboratory, Institute for Telecommunications Research, University of South Australia, Mawson Lakes, South Australia, Australia
| | - Lawrence M. Ward
- Department of Psychology and Brain Research Centre, University of British Columbia, Vancouver, British Columbia, Canada
| |
Collapse
|
6
|
Sun Y, Zhao Y. Overlapping-box-covering method for the fractal dimension of complex networks. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2014; 89:042809. [PMID: 24827295 DOI: 10.1103/physreve.89.042809] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 07/30/2013] [Indexed: 06/03/2023]
Abstract
The fractality and self-similarity of complex networks have been widely investigated by evaluating the fractal dimension, the crux of which is how to locate the optimal solution or how to tile the network with the fewest boxes. The results yielded by the box-covering method with separated boxes possess great randomness or large errors. In this paper, we adopt the overlapping box to tile the entire network, called the overlapping-box-covering method. In such a case, for verifying its validity, we propose an overlapping-box-covering algorithm; we first apply it to three deterministic networks, then to four real-world fractal networks. It produces optimums or more accurate fractal dimension for the former; the quantities of boxes finally obtained for the latter are fewer and more deterministic, with the redundant box reaching up to 33.3%. The experimental results show that the overlapping-box-covering method is available and that the overlapping box outperforms the previous case, rendering the errors smaller. Moreover, we conclude that the overlapping box is an important determinant to acquire the fewest boxes for complex networks.
Collapse
Affiliation(s)
- Yuanyuan Sun
- College of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China
| | - Yujie Zhao
- College of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China
| |
Collapse
|
7
|
Cui AX, Zhang ZK, Tang M, Hui PM, Fu Y. Emergence of scale-free close-knit friendship structure in online social networks. PLoS One 2012; 7:e50702. [PMID: 23272067 PMCID: PMC3522705 DOI: 10.1371/journal.pone.0050702] [Citation(s) in RCA: 12] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/11/2012] [Accepted: 10/26/2012] [Indexed: 12/31/2022] Open
Abstract
Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter, the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree. Structural properties of numerical simulated networks are analyzed and compared with each of the four real networks. This work helps understand the interplay between structures on different scales in online social networks.
Collapse
Affiliation(s)
- Ai-Xiang Cui
- Web Sciences Center, University of Electronic Science and Technology of China, Chengdu, People's Republic of China
| | - Zi-Ke Zhang
- Web Sciences Center, University of Electronic Science and Technology of China, Chengdu, People's Republic of China
- Institute for Information Economy, Hangzhou Normal University, Hangzhou, People's Republic of China
| | - Ming Tang
- Web Sciences Center, University of Electronic Science and Technology of China, Chengdu, People's Republic of China
- * E-mail:
| | - Pak Ming Hui
- Department of Physics, The Chinese University of Hong Kong, Shatin, Hong Kong, People's Republic of China
| | - Yan Fu
- Web Sciences Center, University of Electronic Science and Technology of China, Chengdu, People's Republic of China
| |
Collapse
|
8
|
Son S, Kang AR, Kim HC, Kwon T, Park J, Kim HK. Analysis of context dependence in social interaction networks of a massively multiplayer online role-playing game. PLoS One 2012; 7:e33918. [PMID: 22496771 PMCID: PMC3319537 DOI: 10.1371/journal.pone.0033918] [Citation(s) in RCA: 23] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/30/2011] [Accepted: 02/19/2012] [Indexed: 11/18/2022] Open
Abstract
Rapid advances in modern computing and information technology have enabled millions of people to interact online via various social network and gaming services. The widespread adoption of such online services have made possible analysis of large-scale archival data containing detailed human interactions, presenting a very promising opportunity to understand the rich and complex human behavior. In collaboration with a leading global provider of Massively Multiplayer Online Role-Playing Games (MMORPGs), here we present a network science-based analysis of the interplay between distinct types of user interaction networks in the virtual world. We find that their properties depend critically on the nature of the context-interdependence of the interactions, highlighting the complex and multilayered nature of human interactions, a robust understanding of which we believe may prove instrumental in the designing of more realistic future virtual arenas as well as provide novel insights to the science of collective human behavior.
Collapse
Affiliation(s)
- Seokshin Son
- Multimedia and Mobile Communications Laboratory, School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea
| | - Ah Reum Kang
- Graduate School of Information Security, Korea University, Seoul, Republic of Korea
| | - Hyun-chul Kim
- Department of Computer Software Engineering, Sangmyung University, Cheonan, Republic of Korea
| | - Taekyoung Kwon
- Department of Physics, Kyung Hee University, Seoul, Republic of Korea
| | - Juyong Park
- Department of Physics, Kyung Hee University, Seoul, Republic of Korea
- * E-mail: (JP); (HKK)
| | - Huy Kang Kim
- Graduate School of Information Security, Korea University, Seoul, Republic of Korea
- * E-mail: (JP); (HKK)
| |
Collapse
|
9
|
Generalizing unweighted network measures to capture the focus in interactions. SOCIAL NETWORK ANALYSIS AND MINING 2011. [DOI: 10.1007/s13278-011-0018-8] [Citation(s) in RCA: 8] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/18/2022]
|