[HTML][HTML] Me! Me! Me! Me! A study and comparison of ego network representations
From social networks to brain connectivity, ego networks are a simple yet powerful approach
to visualizing parts of a larger graph, ie those related to a selected focal node—the so-called …
to visualizing parts of a larger graph, ie those related to a selected focal node—the so-called …
Towards efficient motif-based graph partitioning: An adaptive sampling approach
In this paper, we study the problem of efficient motif-based graph partitioning (MGP). We
observe that existing methods require to enumerate all motif instances to compute the exact …
observe that existing methods require to enumerate all motif instances to compute the exact …
Dyads, triads, and tetrads: a multivariate simulation approach to uncovering network motifs in social graphs
D Felmlee, C McMillan, R Whitaker - Applied network science, 2021 - Springer
Motifs represent local subgraphs that are overrepresented in networks. Several disciplines
document multiple instances in which motifs appear in graphs and provide insight into the …
document multiple instances in which motifs appear in graphs and provide insight into the …
Stars, holes, or paths across your facebook friends: A graphlet-based characterization of many networks
R Charbey, C Prieur - Network Science, 2019 - cambridge.org
Network science gathers methods coming from various disciplines which sometimes hardly
cross the boundaries between these disciplines. Widely used in molecular biology in the …
cross the boundaries between these disciplines. Widely used in molecular biology in the …
The structure of interdisciplinary science: uncovering and explaining roles in citation graphs
E Cunningham, D Greene - … Conference on Complex Networks and Their …, 2022 - Springer
Role discovery is the task of dividing the set of nodes on a graph into classes of structurally
similar roles. Modern strategies for role discovery typically rely on graph embedding …
similar roles. Modern strategies for role discovery typically rely on graph embedding …
Central limit theorems for local network statistics
PA Maugis - Biometrika, 2023 - academic.oup.com
Subgraph counts, in particular the number of occurrences of small shapes such as triangles,
characterize properties of random networks. As a result, they have seen wide use as …
characterize properties of random networks. As a result, they have seen wide use as …
Assessing temporal and spatial features in detecting disruptive users on Reddit
JR Ashford, LD Turner, RM Whitaker… - 2020 IEEE/ACM …, 2020 - ieeexplore.ieee.org
Trolling, echo chambers and general suspicious behaviour online are a serious cause of
concern due to their potential disruptive effects beyond social media. This motivates a better …
concern due to their potential disruptive effects beyond social media. This motivates a better …
Topology of complex networks: models and analysis
CJ Carstens - Bulletin of the Australian Mathematical Society, 2017 - cambridge.org
There is a large variety of real-world phenomena that can be modelled and analysed as
networks. Part of this variety is reflected in the diversity of network classes that is used to …
networks. Part of this variety is reflected in the diversity of network classes that is used to …
Mobilizing nascent ties: A Qualitative Structural Analysis of social (izing) capital in newcomer networks
SR Bakker - Network Science, 2020 - cambridge.org
This paper investigates the processes involved when newly hired employees need to
simultaneously build up and mobilize personal network ties during their organizational …
simultaneously build up and mobilize personal network ties during their organizational …
Surrogate explanations for role discovery on graphs
E Cunningham, D Greene - Applied Network Science, 2023 - Springer
Role discovery is the task of dividing the set of nodes on a graph into classes of structurally
similar roles. Modern strategies for role discovery typically rely on graph embedding …
similar roles. Modern strategies for role discovery typically rely on graph embedding …