[graph-tool] Re: Ubuntu Impish support

Thanks for addressing the issue so quickly! Have a nice week-end. T On 12/02/2022 13:07, Tiago de Paula Peixoto wrote: Dear Tanguy, Indeed there was a problem with the impish repository, but it is fixed now. Thank you for letting me know! Best, Tiago _

[graph-tool] Ubuntu Impish support

-instructions#debian-ubuntu [2]: https://downloads.skewed.de/apt/dists/impish/ Thanks in advance -- Tanguy Fardet Postdoctoral researcher, University of Tübingen, Max Planck Institute for Biological Cybernetics. Website: https://tfardet.srht.site ___ graph-tool

[graph-tool] Issue with signature for bionic repository

ning: Permanently added '[localhost]:22291' (ECDSA) to the list of known hosts. Thanks in advance for your help. Best. -- Tanguy Fardet Postdoctoral researcher, University of Tübingen, Max Planck Institute for Biological Cybernetics. Website: http://www.msc.univ-paris-dide

Re: [graph-tool] Clustering coefficient with parallel edges

Ah, I did not think I could use it that way! I'll try it out, thank you. Best, Tanguy PS: (sorry for the spam, I hit reply again) On 14/04/2020 14:36, Tiago de Paula Peixoto wrote: Am 14.04.20 um 14:34 schrieb Tanguy Fardet: Yes, I was thinking that way because there were no attribut

Re: [graph-tool] Clustering coefficient with parallel edges

Hi Tiago, It is consistent with how directionality is implement in graph-tool, which preserves the total number of edges. Furthermore, the concept of multigraph vs simple graph is orthogonal to directed vs undirected graphs. So this is not really about the clustering coefficient computation.

Re: [graph-tool] Clustering coefficient with parallel edges

But doesn't the function compute exactly what it says in the documentation? It does, but one needs to know what the undirected=True implies for the graph, otherwise the result is surprising (or just not what one's think one is computing, if not working on a super simple test graph where it is

Re: [graph-tool] Clustering coefficient with parallel edges

Hi Tiago, thanks for the quick and precise answer! Yes, it's desired behavior. Ignoring parallel edges would have complicated and slowed down the code, and in any case can be easily implemented by the user (see below), who should have something specific in mind when attempting to compute the

[graph-tool] Clustering coefficient with parallel edges

Hi Tiago, I was recently comparing the behavior of the clustering coefficient in different graph libraries and I was surprised by the results given by graph-tool with parallel edges: import graph_tool as gt from graph_tool.clustering import local_clustering from graph_tool.stats impo

Re: [graph-tool] Fwd: Generate scale-free networks with desired power-law degree distributions

Hi Weitao Han In general I think you would want to use a generative model (see for instance http://tuvalu.santafe.edu/~aaronc/courses/5352/fall2013/csci5352_2013_L11.pdf for an introduction). You can find an implementation that is already ready in my library, (primarily for directed network

Re: [graph-tool] graph tool and pyplot

conflicts) Good luck. -- Tanguy Fardet PhD student in Computational Neurosciences MSC Lab - Paris 7 Diderot 911A ___ graph-tool mailing list graph-tool@skewed.de http://lists.skewed.de/mailman/listinfo/graph-tool