New pages
Jump to navigation
Jump to search
- 14:00, 25 May 2023 Stochastic blockmodel (hist | edit) [7,495 bytes] Muellerj (talk | contribs) (Created page with "'''Stochastic blockmodels''' are a kind of statistical model for networks based on partitioning the nodes into clusters and describing the distribution of links between any tw...")
- 10:50, 24 May 2023 Delaunay triangulation (hist | edit) [2,950 bytes] Muellerj (talk | contribs) (Created page with "The '''Delaunay triangulation''' of points <math>P</math> is a triangulation of <math>P</math> such that no point in <math>P</math> lies in the circumcircle of a triangle. The...")
- 10:59, 18 June 2018 POLNET (data) (hist | edit) [812 bytes] Lerner (talk | contribs) (Created page with "The following ZIP file contains exemplary data used in introductory visone workshops. (Right-click and choose ''save link as'' to download.) [[Media:Visone_data.zip|'''Visone_da...")
- 14:06, 3 August 2017 Quad census (hist | edit) [2,075 bytes] Ortmann (talk | contribs) (Created page with "=Quad Census= ===Method=== === Complexity === === Parameter ===")
- 11:34, 22 February 2017 Sparse stress minimization (hist | edit) [2,562 bytes] Nocaj (talk | contribs) (Created page with "content will follow.")
- 13:54, 7 August 2015 Edge Connectivity (hist | edit) [160 bytes] Nocaj (talk | contribs) (Created page with "The edge (or link) connectivity between two nodes u and v is the number of edges which have to be removed such that u and v are not connected by a path anymore.")
- 13:40, 7 August 2015 Node Connectivity (hist | edit) [326 bytes] Nocaj (talk | contribs) (Created page with "The node connectivity between two nodes u and v is the number of nodes which have to be removed such that u and v are not connected anymore. If u and v are connected by a direct...")
- 13:32, 29 July 2015 Transitive Reduction (hist | edit) [325 bytes] Nocaj (talk | contribs) (Created page with "In a directed acyclic graph, every transitive link is removed. This transformation maintains the reachability amont the nodes. If the graph has cycles every transitive link betw...")
- 06:26, 9 July 2015 Effective Resistance (hist | edit) [259 bytes] Nocaj (talk | contribs) (Created page with "Computes the pairwise effective resistance (also called resistance distance) for all pairs of nodes. See the following article as a detailed reference: * Klein, D. J., & Randić,...")
- 12:50, 14 June 2015 Dynamic layout (hist | edit) [2,548 bytes] Nataschah (talk | contribs) (Created page with "visone extends the visualization of networks at each moment in time to the animation of networks collections '''over time'''. Such animation is showing a m...")
- 12:57, 10 June 2015 DAG Longest Path (hist | edit) [462 bytes] Nocaj (talk | contribs) (Created page with "The input must be a directed acyclic graph (DAG). A source in DAG is a node which has only outgoing links. Each node gets the length of the longest directed path from any source ...")
- 11:56, 10 June 2015 Loop To Node Attribute (hist | edit) [178 bytes] Nocaj (talk | contribs) (Created page with "For each selected edge attribute a node attribute is created containing the value of the self loop. For multiple self loops aggregation is performed based on the selected action.")
- 14:20, 8 June 2015 Triangle k Core (hist | edit) [1,247 bytes] Nocaj (talk | contribs) (Created page with "will be filled soon...")
- 14:20, 8 June 2015 Triangle k core (hist | edit) [22 bytes] Nocaj (talk | contribs) (Created page with "will be filled soon...")
- 13:38, 8 June 2015 Positional Dominance (hist | edit) [1,964 bytes] Nocaj (talk | contribs) (Created page with "to be filled soon...")
- 10:18, 8 June 2015 Complement Graph (hist | edit) [211 bytes] Mader (talk | contribs) (Created page with "This function creates the complement graph corresponding to the current network. The resulting complement graph contains a link between two nodes exactly if there is no link in t...")
- 13:42, 12 March 2015 Louvain Clustering (hist | edit) [1,107 bytes] Nocaj (talk | contribs) (Created page with "=Louvain Clustering= === Method === Starting with a state where each node is a singleton cluster, it greedily merges two clusters if the modularity score gets higher. === Comple...")
- 12:43, 12 March 2015 Geographic Mapping (hist | edit) [1,269 bytes] Nocaj (talk | contribs) (Created page with "this will be the page describing the geographic mapping, together with an example dataset")