Results 11 to 20 of about 114,934,093 (299)
The agreement distance of unrooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj +9 more sources
Deliverable D32 Core indicators for the interconnection between short and long-distance transport networks ; projet 7FP CLOSER (Connecting LOng and Short-distance networks for Efficient Transport); September 2011 [PDF]
, 2011 The CLOSER project has been set to analyse the interfaces and interconnections between long distance transport networks and local/regional transport networks of all modes.
Eftithia, Nathanail +8 more
core +6 more sources
Resistance distance, information centrality, node vulnerability and vibrations in complex networks [PDF]
, 2010 We discuss three seemingly unrelated quantities that have been introduced in different fields of science for complex networks. The three quantities are the resistance distance, the information centrality and the node displacement.
Estrada, Ernesto, Hatano, Naomichi
core +4 more sources
The distance backbone of complex networks [PDF]
Journal of Complex Networks, 2021 AbstractRedundancy needs more precise characterization as it is a major factor in the evolution and robustness of networks of multivariate interactions. We investigate the complexity of such interactions by inferring a connection transitivity that includes all possible measures of path length for weighted graphs.
Tiago Simas +2 more
openaire +4 more sources
Resistance Distances In Simplicial Networks
The Computer Journal, 2022 Abstract It is well known that in many real networks, such as brain networks and scientific collaboration networks, there exist higher order nonpairwise relations among nodes, i.e. interactions between more than two nodes at a time.
Mingzhe Zhu +4 more
openaire +3 more sources
Social Distancing Network Creation
Algorithmica, 2023 AbstractDuring a pandemic people have to find a trade-off between meeting others and staying safely at home. While meeting others is pleasant, it also increases the risk of infection. We consider this dilemma by introducing a game-theoretic network creation model in which selfish agents can form bilateral connections.
Friedrich, Tobias +3 more
openaire +7 more sources
Distance closures on complex networks [PDF]
Network Science, 2015 AbstractTo expand the toolbox available to network science, we study the isomorphism between distance and Fuzzy (proximity or strength) graphs. Distinct transitive closures in Fuzzy graphs lead to closures of their isomorphic distance graphs with widely different structural properties. For instance, the All Pairs Shortest Paths (APSP) problem, based on
Tiago Simas, Luis M. Rocha
openaire +3 more sources
The Distance Backbone of Directed Networks
, 2023 In weighted graphs the shortest path between two nodes is often reached through an indirect path, out of all possible connections, leading to structural redundancies which play key roles in the dynamics and evolution of complex networks. We have previously developed a parameter-free, algebraically-principled methodology to uncover such redundancy and ...
Felipe Xavier Costa +2 more
openaire +5 more sources
Are Euclidean Distance and Network Distance Related ? [PDF]
Environment-Behaviour Proceedings Journal, 2016 Although spatial distance is a very important concept for a wide variety of disciplines including social, natural, and information sciences, the methods used to measure spatial distance are not directly expressed and fully explained. In this study, we calculate and compare Euclidean distances and network distances for 10 randomly selected European ...
Taha, Hatcha, ÇUBUKÇU, KEMAL MERT
openaire +2 more sources
Correlation distances in social networks
Journal of Complex Networks, 2023 Abstract In this work, we explore degree assortativity in complex networks, and extend its usual definition beyond that of nearest neighbours. We apply this definition to model networks, and describe a rewiring algorithm that induces assortativity. We compare these results to real networks.
Pádraig MacCarron +2 more
openaire +4 more sources