Results 41 to 50 of about 572,176 (269)
Limit theorems for assortativity and clustering in null models for scale-free networks [PDF]
, 2019 An important problem in modeling networks is how to generate a randomly sampled graph with given degrees. A popular model is the configuration model, a network with assigned degrees and random connections.
Litvak, Nelly +3 more
core +3 more sources
Geophysical Research Letters, 2023 Concurrent extreme rainfall events, or synchronous extremes, during Indian Summer Monsoon Rainfall (ISMR), cause significant damage, but their spatiotemporal evolution remains unclear. Using the event synchronization approach to examine the synchronicity
Danish Tantary +5 more
doaj +1 more source
Statistical Self-Similar Properties of Complex Networks [PDF]
, 2006 It has been shown that many complex networks shared distinctive features, which differ in many ways from the random and the regular networks. Although these features capture important characteristics of complex networks, their applicability depends on ...
B. Bollobás +2 more
core +2 more sources
IEEE Access, 2023 Over the past decade, there has been extensive research conducted on complex networks, primarily driven by their crucial role in understanding the various real-world networks such as social networks, communication networks, transportation networks, and ...
Mondikathi Chiranjeevi +3 more
doaj +1 more source
Large values of the clustering coefficient
Discrete Mathematics, 2018 A prominent parameter in the context of network analysis, originally proposed by Watts and Strogatz (Collective dynamics of `small-world' networks, Nature 393 (1998) 440-442), is the clustering coefficient of a graph $G$. It is defined as the arithmetic mean of the clustering coefficients of its vertices, where the clustering coefficient of a vertex $u$
Gentner, Michael +3 more
openaire +3 more sources
Clustering of tag-induced sub-graphs in complex networks
, 2012 We study the behavior of the clustering coefficient in tagged networks. The rich variety of tags associated with the nodes in the studied systems provide additional information about the entities represented by the nodes which can be important for ...
Aittokallio +43 more
core +1 more source
Identifying Influential Spreaders in Social Networks Via Normalized Local Structure Attributes
IEEE Access, 2018 In social networks, influential spreaders are those nodes that can spread information to a large number of nodes. Identifying influential spreaders is a major challenge for applications, such as information diffusion acceleration, epidemic outbreak ...
Xiaohui Zhao +3 more
doaj +1 more source
Modeling Bilingual Lexical Processing Through Code-Switching Speech: A Network Science Approach
Frontiers in Psychology, 2021 The study of code-switching (CS) speech has produced a wealth of knowledge in the understanding of bilingual language processing and representation. Here, we approach this issue by using a novel network science approach to map bilingual spontaneous CS ...
Qihui Xu +4 more
doaj +1 more source
A new measure for community structures through indirect social connections
, 2018 Based on an expert systems approach, the issue of community detection can be conceptualized as a clustering model for networks. Building upon this further, community structure can be measured through a clustering coefficient, which is generated from the ...
Cerqueti, Roy +2 more
core +1 more source
Frontiers in Aging Neuroscience, 2021 Impairment in spatial navigation (SN) and structural network topology is not limited to patients with Alzheimer’s disease (AD) dementia and can be detected earlier in patients with mild cognitive impairment (MCI). We recruited 32 MCI patients (65.91 ± 11.
Weiping Li +12 more
doaj +1 more source