Results 11 to 20 of about 22,888 (290)

Coordination Games on Weighted Directed Graphs [PDF]

Mathematics of Operations Research, 2022
We study strategic games on weighted directed graphs, where each player’s payoff is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed nonnegative integer bonus for picking a given strategy ...
Wojtczak, D.K. (Dominik), Apt, Krzysztof R, Simon, S.E. (Sunil), Simon, Sunil, Apt, K.R. (Krzysztof), Wojtczak, Dominik   +5 more
core   +4 more sources

Edge-weighted anonymity for directed network graph

Intelligent and Converged Networks
In social networks, weighted graph anonymity is gaining more and more attention. But fan-following graphs like Twitter’s are not protected by anonymity.
Yanze Huang, Jianghong Lin, Wei Li, Jiaru Wang, Limei Lin   +4 more
doaj   +2 more sources

On the eigenvalues of weighted directed graphs [PDF]

Complex Analysis and Operator Theory, 2016
International audienceThis 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 ...
Balti, Marwa
core   +4 more sources

Ranking the nodes in directed and weighted directed graphs [PDF]

, 1994
Graphs ...
Gilles, R.P., Brink, J.R. van den
core   +2 more sources

On computing the diameter of real-world directed (weighted) graphs

, 2012
In this paper we propose a new algorithm for computing the diameter of directed unweighted graphs. Even though, in the worst case, this algorithm has complexity O(nm), where n is the number of nodes and m is the number of edges of the graph, we ...
Lanzi, Leonardo, P. Crescenzi, L. Lanzi, Crescenzi, Pierluigi, GROSSI, ROBERTO, MARINO, ANDREA   +5 more
core   +4 more sources

On an asymptotic optimization problem in finite, directed, weighted graphs

Information and Control, 1968
This paper is concerned with finite, directed, branch-weighted graphs, where each weight is a real number bearing the connotation of “payoff.” The “average payoff” of a k-branch path is defined as the sum of the weights along this path divided by k.
Gill, A., Traiger, I.L.
core   +2 more sources

An algebraic framework of weighted directed graphs [PDF]

International Journal of Mathematics and Mathematical Sciences, 2003
We show that an algebraic formulation of weighted directed graphs leads to introducing a k‐vector space equipped with two coproducts Δ and verifying the so‐called coassociativity breaking equation . Such a space is called an L‐coalgebra. Explicit examples of such spaces are constructed and links between graph theory and coassociative coalgebras are ...
Philippe Leroux
doaj   +3 more sources

Edge Weight Reduction Problems in Directed, Acyclic Graphs

Journal of Algorithms, 1997
Let G be a weighted, directed, acyclic graph in which each edge weight is not a static quantity, but can be reduced for a certain cost. In this paper we consider the problem of determining which edges to reduce so that the length of the longest paths is ...
Susanne Hambrusch, Hung-yi Tu
core   +3 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, Mohamed L. Seghier, Yuan Zhou, Peter McColgan, Peter Zeidman, Hae-Jeong Park, Olaf Sporns, Geraint Rees, Karl J. Friston   +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, Silivanxay Phetsouvanh, Anwitaman Datta   +2 more
doaj   +1 more source