Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1906.04566

Symmetric core-cohesive blockmodel in preschool children's interaction networks

Marjan Cugmas·Dawn DeLay·Aleš Žiberna·Anuška Ferligoj
View original source ↗Read source document ↗Export metadata ↓

Abstract

Researchers have extensively studied the social mechanisms that drive the formation of networks observed among preschool children. However, less attention has been given to global network structures in terms of blockmodels. A blockmodel is a network where the nodes are groups of equivalent units (according to links to others) from a studied network. Cugmas et al. (2019) showed that mutuality, popularity, assortativity, and different types of transitivity mechanisms can lead the global network structure to the proposed asymmetric core-cohesive blockmodel. Yet, they did not provide any evidence that such a global network structure actually appears in any empirical data. In this paper, the symmetric version of the core-cohesive blockmodel type is proposed. This blockmodel type consists of three or more groups of units. The units from each group are internally well linked to each other while those from different groups are not linked to each other. This is true for all groups, except one in which the units have mutual links to all other units in the network. In this study, it is shown that the proposed blockmodel type appears in empirical interactional networks collected among preschool children. Monte Carlo simulations confirm that the most often studied social network mechanisms can lead the global network structure to the proposed symmetric blockmodel type. The units' attributes are not considered in this study.

Explore related subjects

cs.SIstat.ME

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marjan Cugmas, Dawn DeLay, Aleš Žiberna, Anuška Ferligoj. 2019-06-05. Symmetric core-cohesive blockmodel in preschool children's interaction networks. https://doi.org/10.1371/journal.pone.0226801

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Local-to-Global AD-k Conjecture is Resolved

AD-k stands for Alternating Differences through order k, and it is a property of set functions denoting that the first order difference of the set function is nonnegative (a.k.a. monotnocity), the second order difference is nonpositive (submodularity), and so on with signs alternating through order k. Chen et al. [1] conjectured that in an influence diffusion model called the general threshold model originally defined by Kempe et al. [2], if every local influence function is AD-k, then the global influence spread function is also AD-k, for any (possibly cyclic) directed graph and any k. This paper provides a complete proof showing that the conjecture is true. The proof utilizes Möbius inversion, reverse reachable sets, and decision tree partition techniques and extends the probability distribution of node triggering sets into a generalized algebraic structure allowing negative weights for triggering sets. The extension to negative-weighted triggering sets may be of independent interest and may have further algorithmic implications.

cs.SI↗
arXiv2026

Higher-order rich clubs and configuration models on general directed hypergraphs

Detecting structure in complex networks, especially those arising from physical systems, is a central problem across the sciences. One approach is via rich club analysis, which identifies important vertices using a centrality metric and measures whether those vertices are more tightly interconnected than expected by chance. While informative, this approach captures only pairwise interactions, missing out on higher-order ones known to shape the structure and function of many complex systems. We propose a hyper-rich club pipeline that asks whether central vertices are more tightly interconnected than expected by chance through hyperedges encoding higher-order interactions, which also enables the inclusion of important, often omitted, directional information. We work in a broad class of hypergraphs, which we call general directed hypergraphs, that includes as special cases undirected hypergraphs, head-and-tail directed hypergraphs, and totally ordered hypergraphs (a hypergraph related to directed simplicial complexes from topological data analysis). This unifies several non-equivalent notions of directed hypergraph under one definition. On these hypergraphs we define a hyper-rich club framework whose concrete construction depends on explicit choices the domain scientist fixes according to their research goals. Particular choices recover the existing rich club notions for graphs and undirected hypergraphs, and yield the first such notion for each version of directed hypergraphs. We demonstrate that the pipeline recovers meaningful structure in data by studying networks of very different origins: connectomes, temporal networks of infectious spread, networks of poems, and the XGI hypergraph database, in each case detecting structure the standard graph rich club misses.

cs.SI↗
arXiv2026

Inferring Temporal Dependencies from Social Time Series with the Cross-Correlogram

Characterizing temporal interactions in social systems is challenging because social behavior can be bursty and non-stationary, violating the stationarity assumptions of many methods used to measure temporal dependence. The cross-correlogram, an existing technique used to profile neural excitations and inhibitions, offers an interpretable alternative to methods such as Granger causality or co-occurrence, as it produces a full profile of lagged dependence directly from event times rather than a single summary statistic. We adapt the cross-correlogram by integrating functional models of behavior with data-driven temporal response profiling. By characterizing how periodic structure biases traditional cross-correlograms, we propose a correction based on smooth intensity functions, specified from a known functional form or estimated empirically. This approach provides a robust, interpretable estimator of temporal dependency profiles even when collective rhythms operate on timescales that overlap those of the interactions of interest. We demonstrate theoretically and through simulation that the proposed method recovers temporal dependencies in periodic regimes, outperforming interval-jitter and Granger causality methods. Finally, we apply the method to 3.1 million event times from X (formerly Twitter) collected between 2019 and 2020, demonstrating how cross-correlograms reveal delayed temporal relationships in collective online behavior that are missed by co-occurrence measures. For a subset of television-related hashtags, recovered delays align with known broadcast schedules, providing evidence that the proposed method captures genuine temporal structure rather than artifacts of shared attention cycles.

cs.SI↗