Results 171 to 180 of about 27,298 (312)

Algorithm 3: analyseSubgraph(Subgraph ).

, 2014
Algorithm 3: analyseSubgraph(Subgraph ).
Pieter Audenaert (404604), Sofie Demeyer (404602), Didier Colle (570226), Maarten Houbraken (570225), Mario Pickavet (404605), Tom Michoel (29810)   +5 more
core   +1 more source

CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks

Computer Graphics Forum, EarlyView.
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci, Annika Bonerath, Walter Didimo, Henry Förster, Seok‐Hee Hong, Maria Eleni Pavlidi, Alessandra Tappini   +6 more
wiley   +1 more source

Random Subgraph

, 2010
In this thesis, random even subgraph of a finite graph G with a general edge-weight p ∈ (0, 1) has been extensively studied. This thesis also demonstrates how to obtain a certain random cluster measure on G and proposes a sampling algorithm based on ...
Rosdiana P., Lena
core  

A Theoretical Approach for Structuring and Analysing Knowledge Provenance for Visual Analytics

Computer Graphics Forum, EarlyView.
VAKG unfolds the interactions within the current knowledge model (A) into a temporal knowledge graph (B), which is structured as a 4‐way graph containing two temporal (green) and two static (yellow) knowledge graphs. By using VAKG, one can structure and store the user's knowledge‐gathering process and all related interactions for eventual analysis (C).
L. Christino, S. Rezaeipour, E. Milios, F. Paulovich   +3 more
wiley   +1 more source

Survey on Visualization of Information Diffusion over Networks

Computer Graphics Forum, EarlyView.
Abstract Information Diffusion (ID) describes how a value (e.g., a pathogen, a rumor, a packet) spreads through an underlying “medium” network of elements (e.g., a social or computer network). Understanding the information diffusion process is essential to predicting trends, controlling misinformation, and enhancing decision‐making as well as ...
T. Baumgartl, M. Sondag, V. Filipov, M. Tuscher, S. Rajendran, S. Miksch, D. Archambault, A. Arleo, T. von Landesberger   +8 more
wiley   +1 more source

Uniform Connected Subgraph Sampling

, 2010
https://rdc.reed.edu/v1/resources/a4d0e0b4-d8a2-409b-91ba-e067f80f9157/thumb/128.jpgThe ability to sample connected subgraphs uniformly from large networks has been motivated by the problem of motif detection.
Strong, Homer
core  

Isomorphic Graph Embedding for Progressive Maximal Frequent Subgraph Mining

Maximal frequent subgraph mining (MFSM) is the task of mining only maximal frequent subgraphs, i.e., subgraphs that are not a part of other frequent subgraphs.
Nguyen, Thanh Hung, Nguyen, Thanh Toan, Nguyen, Thanh Tam, Nguyen, Thanh Thi, Jo, Jun, Nguyen, Quoc Viet Hung, Yin, Hongzhi   +6 more
core   +1 more source

Pairwise Imitation and Tournament Graphs

International Economic Review, EarlyView.
ABSTRACT This paper investigates strategic dynamics under the behavioral rule of pairwise interact and imitate (PII), which requires minimal information and emphasizes outperforming opponents in pairwise interactions. We characterize PII using weak tournament graphs and, for a broad class of dynamics, establish a one‐shot stability result for ...
Sung‐Ha Hwang, Philip R. Neary, Jonathan Newton, Ryoji Sawa   +3 more
wiley   +1 more source

Entangling and Coalescing on Social Media: A Study of Issue Boundary Spanning in Movement of Movements

Information Systems Journal, EarlyView.
ABSTRACT This study examines how issues across boundaries influence contention dynamics in a movement of movements on social media. Participants utilize social media to support or oppose goals and actions related to their visions regarding societal changes. As the boundaries of movements are fluid on social media, we investigate the actors' identities,
Carol Lee, Pratyush Bharati, Emmanuelle Vaast   +2 more
wiley   +1 more source

The reproducibility gap in graph neural network workflows for cell dynamics: A checklist‐driven case study

Journal of Microscopy, EarlyView.
Abstract As part of a Global BioImage Analysts' Society (GloBIAS) initiative, we evaluated the reproducibility of a Graph Neural Network (GNN) study on cell dynamics using structured, community‐developed checklists from the Quality Assessment and Reproducibility for Instruments and Images in Light Microscopy (QUAREP‐LiMi) initiative.
Martin Schätz, Ko Sugawara
wiley   +1 more source