Results 11 to 20 of about 21,926 (256)
IEEE Access, 2022 This paper investigates the global connectivity of complex networks with random links. An expected communication graph with weighted edges is used to model the network.
Hamid Mahboubi +3 more
doaj +1 more source
A Node Differential Privacy-Based Method to Preserve Directed Graphs in Wireless Mobile Networks
Applied Sciences, 2023 With the widespread popularity of Wireless Mobile Networks (WMNs) in our daily life, the huge risk to disclose personal privacy of massive graph structure data in WMNs receives more and more attention.
Jun Yan, Yihui Zhou, Laifeng Lu
doaj +1 more source
The outflow ranking method for weighted directed graphs [PDF]
European Journal of Operational Research, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
René van den Brink, Robert P. Gilles
openaire +6 more sources
Large-scale DCMs for resting-state fMRI [PDF]
Network Neuroscience, 2017 This paper considers the identification of large directed graphs for resting-state brain networks based on biophysical models of distributed neuronal activity, that is, effective connectivity.
Adeel Razi +8 more
doaj +1 more source
A Modular Framework for Centrality and Clustering in Complex Networks
IEEE Access, 2022 The structure of many complex networks includes edge directionality and weights on top of their topology. Network analysis that can seamlessly consider combination of these properties are desirable.
Frederique Oggier +2 more
doaj +1 more source
Approximation algorithms for multi-multiway cut and multicut problems on directed graphs [PDF]
AUT Journal of Mathematics and Computing, 2020 In this paper, we study the directed multicut and directed multimultiway cut problems. The input to the directed multi-multiway cut problem is a weighted directed graph $G=(V,E)$ and $k$ sets $S_1, S_2,\cdots, S_k$ of vertices.
Ramin Yarinezhad, Seyed Naser Hashemi
doaj +1 more source
On the Eigenvalues of Weighted Directed Graphs [PDF]
Complex Analysis and Operator Theory, 2016 This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as the sum of two non self-adjoint Laplacians.
openaire +3 more sources
Parallel modularity computation for directed weighted graphs with overlapping communities
Труды Института системного программирования РАН, 2018 The paper presents new versions of modularity measure for directed weighted graphs with overlapping communities. We consider several approaches to computing modularity and try to extend them.
Mikhail Drobyshevskiy +2 more
doaj +1 more source
Community mining on dynamic weighted directed graphs [PDF]
Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management, 2009 This paper focuses on community mining including community discovery and change-point detection on dynamic weighted directed graphs(DWDG). Real networks such as e-mail, co-author and financial networks can be modeled as DWDG. Community mining on DWDG has not been studied thoroughly, although that on static(or dynamic undirected unweighted)graphs has ...
Dongsheng Duan +3 more
openaire +1 more source
Semi-Markov graph dynamics. [PDF]
PLoS ONE, 2011 In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists
Marco Raberto +2 more
doaj +1 more source