Paper deep dive
Emergence of Fragility in LLM-based Social Networks: the Case of Moltbook
Luca Sodano, Sofia Sciangula, Amulya Galmarini, Francesco Bertolotti
Intelligence
Status: succeeded | Model: google/gemini-3.1-flash-lite-preview | Prompt: intel-v1 | Confidence: 94%
Last extracted: 3/26/2026, 1:46:03 AM
Summary
This paper analyzes the interaction network of Moltbook, a social platform populated entirely by LLM-based autonomous agents. Using network science, the authors find that the platform exhibits strongly heterogeneous connectivity, heavy-tailed degree distributions, and a core-periphery organization. The study reveals that while the network is resilient to random node removal, it is highly vulnerable to targeted attacks on high-degree hubs, suggesting that AI-agent social systems can develop significant structural fragility.
Entities (4)
Relation Signals (3)
Moltbook â composedof â LLM-based agents
confidence 100% · a social platform composed entirely of LLM based agents
Moltbook â exhibits â Core-Periphery Organization
confidence 95% · the network exhibits a pronounced coreâperiphery organization
Moltbook â vulnerableto â Targeted Attacks
confidence 90% · highly vulnerable to targeted attacks on highly connected nodes
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:The rapid diffusion of large language models and the growth in their capability has enabled the emergence of online environments populated by autonomous AI agents that interact through natural language. These platforms provide a novel empirical setting for studying collective dynamics among artificial agents. In this paper we analyze the interaction network of Moltbook, a social platform composed entirely of LLM based agents, using tools from network science. The dataset comprises 39,924 users, 235,572 posts, and 1,540,238 comments collected through web scraping. We construct a directed weighted network in which nodes represent agents and edges represent commenting interactions. Our analysis reveals strongly heterogeneous connectivity patterns characterized by heavy tailed degree and activity distributions. At the mesoscale, the network exhibits a pronounced core periphery organization in which a very small structural core (0.9% of nodes) concentrates a large fraction of connectivity. Robustness experiments show that the network is relatively resilient to random node removal but highly vulnerable to targeted attacks on highly connected nodes, particularly those with high out degree. These findings indicate that the interaction structure of AI agent social systems may develop strong centralization and structural fragility, providing new insights into the collective organization of LLM native social environments.
Tags
Links
- Source: https://arxiv.org/abs/2603.23279v1
- Canonical: https://arxiv.org/abs/2603.23279v1
Trouble viewing inline? Open PDF directly â
Full Text
47,535 characters extracted from source content.
Expand or collapse full text
EMERGENCE OF FRAGILITY IN LLM-BASED SOCIAL NETWORKS: THE CASE OF MOLTBOOK Luca Sodano School of Industrial Engineering Intelligence, Complexity and Technology Lab (ICT Lab) LIUC - UniversitĂ Cattaneo Castellanza (Italy), 21053 lu02.sodano@stud.liuc.it Sofia Sciangula School of Industrial Engineering Intelligence, Complexity and Technology Lab (ICT Lab) LIUC - UniversitĂ Cattaneo Castellanza (Italy), 21053 so10.sciangula@stud.liuc.it Amulya Galmarini Intelligence, Complexity and Technology Lab (ICT Lab) LIUC - UniversitĂ Cattaneo Castellanza (Italy), 21053 a.galmarini3003@gmail.com Francesco Bertolotti School of Industrial Engineering Intelligence, Complexity and Technology Lab (ICT Lab) LIUC - UniversitĂ Cattaneo Castellanza (Italy), 21053 fbertolotti@liuc.it March 25, 2026 ABSTRACT The rapid diffusion of large language models and the growth in their capability has enabled the emergence of online environments populated by autonomous AI agents that interact through natural language. These platforms provide a novel empirical setting for studying collective dynamics among artificial agents. In this paper we analyze the interaction network of Moltbook, a social platform composed entirely of LLM-based agents, using tools from network science. The dataset comprises 39,924 users, 235,572 posts, and 1,540,238 comments collected through web scraping. We construct a directed weighted network in which nodes represent agents and edges represent commenting interactions. Our analysis reveals strongly heterogeneous connectivity patterns characterized by heavy-tailed degree and activity distributions. At the mesoscale, the network exhibits a pronounced coreâperiphery organization in which a very small structural core (0.9% of nodes) concentrates a large fraction of connectivity. Robustness experiments show that the network is relatively resilient to random node removal but highly vulnerable to targeted attacks on highly connected nodes, particularly those with high out-degree. These findings indicate that the interaction structure of AI-agent social systems may develop strong centralization and structural fragility, providing new insights into the collective organization of LLM-native social environments. Keywords network science, AI societies, LLM agents, complexity, alignment, emergence 1 Introduction In recent years, large language models (LLMs) have experienced rapid improvements in capability, largely driven by advances in transformer-based architectures and the large-scale training of models on massive text corpora Vaswani et al. [2017], Brown et al. [2020]. These models have demonstrated strong performance across a wide range of language tasks and have shown an ability to generalize to new problems through prompting and instruction-based interaction Ouyang et al. [2022]. At the same time, LLM-based conversational systems have spread extremely rapidly across digital platforms, reaching hundreds of millions of users and generating large volumes of interaction at global scale arXiv:2603.23279v1 [cs.SI] 24 Mar 2026 A PREPRINT - MARCH 25, 2026 Chatterji et al. [2025]. This diffusion has stimulated debate about their potential economic and social impact Liang et al. [2025], including the possibility that some cognitive tasks may be automated or substantially transformed by AI-assisted systems Eloundou et al. [2024], Brynjolfsson et al. [2025]. Despite these advances, important limitations remain Mohsin et al. [2025]. LLMs can generate fluent but factually incorrect information, a phenomenon often referred to as hallucination, which raises concerns about reliability in high-stakes contexts Lin et al. [2025]. More broadly, the deployment of large foundation models raises questions about bias, misuse, transparency, and governance of AI systems Bender et al. [2021]. A central open challenge in modern AI systems is the problem of alignment Schuster and Kilov [2025], which is ensuring that model behavior remains consistent with human intentions and safety constraints even in ambiguous or novel situations Wang et al. [2024]. Increasing model capability does not automatically guarantee desirable behavior, and highly capable models may still produce responses that are misleading, harmful, or inconsistent with user intent Shen et al. [2023], Bertolotti and Mari [2025]. Consequently, several techniques have been proposed to address this challenge Wolf et al. [2023]. Instruction tuning and supervised fine-tuning aim to improve the ability of models to follow human instructions, while reinforcement learning from human feedback uses human preferences to guide model behavior toward more useful and safer responses Ouyang et al. [2022], Amodei et al. [2016]. In this setting, LLMs are increasingly deployed as the cognitive engine of autonomous or semi-autonomous agents capable of interacting with other agents and with digital environments Plaat et al. [2025]. When multiple agents interact, collective dynamics may emerge that cannot be fully understood by analyzing individual models in isolation Bertolotti et al. [2025]. Especially, experimental studies suggest that populations of LLM-based agents can exhibit emergent social behaviors such as coordination, cooperation, and the spontaneous diffusion of strategies under relatively simple interaction rules De Marzo et al. [2024]. At the same time, multi-agent systems may also generate unintended outcomes, including forms of tacit coordination or collusion in simulated environments Park et al. [2023]. These observations motivate the study of emergent properties at the collective level Piatti et al. [2024]. Among the most informative properties in social systems is the structure of interactions, such as who interacts with whom, with what frequency, and with what directional patterns over time Coscia [2021]. Interaction systems can be naturally modeled as networks, where entities are represented as nodes and interactions between them as edges Newman [2010], Coscia [2021]. This representation enables the analysis of structural properties and allows to link it with dynamical processes such as diffusion, resilience, and fragmentation Albert and BarabĂĄsi [2002]. Human social networksâparticularly online platformsâtypically exhibit highly heterogeneous connectivity patterns, often characterized by heavy-tailed degree distributions and the presence of hubs BarabĂĄsi and Albert [1999], Newman [2010]. Many social networks also display small-world properties, combining short average path lengths with significant local clustering Watts and Strogatz [1998]. In directed systems, large-scale interaction structures often show a distinction between weakly and strongly connected components, sometimes producing notable configurations such as the well-known "bow-tie" structure observed in web-scale networks Broder et al. [2000]. On January 28th, 2026 it was firstly launch an autonomous, bot-centric social network designed for large language model interactions called Moltbook, which immediatly gain large success. The rise of this interaction platform provides a rare opportunity to study the formation of large-scale interaction networks among artificial agents, given that it generates interaction datasets containing hundreds of thousands of posts and millions of comments, enabling structural analysis at the scale typically used in empirical studies of social networks. In this context, this paper aims at studying the interaction network of Moltbook exhibits structural properties similar to those commonly found in human social networks â such as heterogeneous connectivity, hubs, and giant components â and how these structural features influence the robustness and fragility of the system. To address this question, we collected interaction data from Moltbook and constructed a directed network in which users are represented as nodes and commenting interactions from the commenter to the author of a post are represented as weighted edges. On this network we analyze activity and visibility measures, examine connectivity patterns and component structures, investigate mesoscale organization through coreâperiphery analysis, and evaluate structural robustness through random failures and targeted node removal experiments. The paper proceeds as it follows. Section 2 provides the literature background, while Section 3 depicts the methodology employed, namely the data collection and the data analysis process. Later, the results are presented and discussed. Finally conclusions are drawn. 2 A PREPRINT - MARCH 25, 2026 2 Background 2.1 Social network analysis The study of social networks has a long tradition rooting into sociological work on relational structures Prell [2011], that comes back to the introduction of sociometry as a method for representing social relations through graphs, where individuals are modeled as nodes and social interactions as links Moreno [1934]. These ideas were later formalized within the framework of social network analysis, which provides mathematical tools for studying relational systems Wasserman and Faust [1994]. With the emergence of network science in the 90s, these approaches were integrated with graph theory and statistical physics, enabling the analysis of large-scale complex networks Newman [2010], Coscia [2021]. Empirical studies have shown that many real-world networks exhibit highly heterogeneous connectivity patterns characterized by heavy-tailed degree distributions and the presence of hubs BarabĂĄsi and Albert [1999], Newman [2005]. Such structural heterogeneity has become a central concept in the quantitative analysis of social and technological networks Castellano et al. [2000]. Given that real-world systems involve multiple types of relationships among the same actors multilayer network models were introduced Boccaletti et al. [2014], where nodes interact across several relational layers depicting these different type of relationships KivelĂ€ et al. [2014]. Multilayer frameworks have proven useful for studying complex systems in which multiple processes coexist, such as social networks Dickison et al. [2016], transportation systems Alessandretti et al. [2023], Bertolotti and Occa [2020], and electrical grids Danziger and BarabĂĄsi [2022]. A complementary theoretical perspective interprets complex networks through geometric representations Bianconi and Rahmede [2017]. Research has shown that many heterogeneous networks can be embedded in hyperbolic space, where node positions encode both similarity and popularity dimensions Krioukov et al. [2010], Papadopoulos et al. [2012]. Network science has been widely applied to the study of large-scale digital systems. One early example is the analysis of the World Wide Web, where directed hyperlink networks were found to exhibit a characteristic âbow-tieâ structure with a giant strongly connected component embedded in a larger weakly connected graph Broder et al. [2000]. Online social networks have also been extensively analyzed; studies on Twitter revealed strong asymmetries in follower relations and hybrid roles combining social interaction and information diffusion Kwak et al. [2010], which can be depicted also in different social systems Bertolotti and Roman [2022]. Similarly, large-scale measurements of the Facebook graph showed that the vast majority of users belong to a giant connected component and that the network displays strong clustering and short path lengths Ugander et al. [2011]. 2.2 Network analysis and LLMs Recent advances in LLMs have enabled the development of autonomous agents capable of interacting with users and with other agents in shared environments. When multiple LLM-based agents interact, collective behaviors can emerge that resemble social dynamics observed in human systems. Experimental studies on LLM-based agent societies show that such agents can develop coordination patterns, social conventions, and persistent interaction structures Park et al. [2023]. These developments open the possibility of studying populations of artificial agents as interaction networks, extending the methodological tools of network science to emerging AI-mediated environments. The emergence of online environments populated by LLM agents provides a new empirical context for studying artificial social systems Chatterji et al. [2025]. Early examples of social environments populated by autonomous LLM agents include platforms such as Chirper, whose interaction network has been analyzed to study behavioral patterns and structural properties of agent populations Zhu et al. [2025]. More recently, Moltbook has emerged as a large-scale social environment populated entirely by LLM agents that publish posts and interact through comments. Recent preprints have begun to analyze different aspects of the Moltbook ecosystem, mostly comparing its basic statistical properties to the one of real human-generated networks De Marzo and Garcia [2026], Jiang et al. [2026], Holtz [2026], Zhu et al. [2026], Li et al. [2026]. More precisely, De Marzo and Garcia investigate emergent collective behavior and activity regularities among AI agents interacting on the platform De Marzo and Garcia [2026], while Jiang et al. analyze content generation dynamics and structural properties of Moltbook interactions, highlighting patterns in topic formation and communication structure Jiang et al. [2026]. Similarly, Holtz provides one of the structural descriptions of the Moltbook interaction graph, examining early network-level properties of the system Holtz [2026]. Other studies compare Moltbook with human online platforms and explore similarities and divergences between AI-generated and human-generated social dynamics Zhu et al. [2026], Li et al. [2026]. All these early results suggest that LLM-native social networks may reproduce several structural characteristics commonly observed in human online platforms, including highly heterogeneous activity distributions and the emergence of central actors. However, despite these initial contributions, a systematic network-science characterization of LLM-native social platforms remains limited. In particular, the mesoscale organization and structural robustness of interaction networks 3 A PREPRINT - MARCH 25, 2026 formed entirely by artificial agents remain poorly understood. This motivates the present study, which applies established tools from network scienceâincluding connectivity analysis, coreâperiphery structure, and robustness experimentsâto analyze the structural organization and fragility of the Moltbook interaction network. 3 Methods 3.1 Data collection The dataset used in this study was obtained through a web scraping procedure performed on Moltbook. The scraping process collected publicly available interaction data, including posts, comments, and user identifiers. In total, the dataset comprises 235,572 posts, 1,540,238 comments, and 39,924 unique users. These data were subsequently structured into a relational database to enable systematic analysis of user interactions. The resulting dataset constitutes the empirical basis for all network analyses conducted in this study. 3.2 Data analysis Figure 1: Visualization of the Moltbook interaction network after filtering edges with weightâ„ 5. Nodes represent users and edges represent repeated commenting interactions. Colors indicate communities detected through modularity optimization. The layout is generated using the ForceAtlas2 algorithm. The dataset was solely studied with a network perspective, where the construction and statistical. A directed and weighted graph was built, where nodes represent users and edges represent commenting interactions from the commenter to the author of the post. Edge weights correspond to the number of comments exchanged between pairs of users. Both in-degree and out-degree and the weighed strength were computed to characterize user activity and influence, with the complementary cumulative distribution functions of degree and strength were estimated on logarithmic scales. Heavy-tailed behavior was assessed by fitting power-law distributions, estimating the scaling exponentα, the lower bound x min , and the KolmogorovâSmirnov statistic. 4 A PREPRINT - MARCH 25, 2026 Global connectivity was evaluated by computing weakly and strongly connected components and identifying the size of the giant component. Rank-size distributions were analyzed to assess fragmentation patterns. Core-periphery structure was investigated using k-core decomposition. An optimal core threshold was selected following a BorgattiâEverett fitting criterion based on intra-core, intra-periphery, and cross densities. Network robustness was assessed through targeted node removal experiments (ranked by in-degree and out-degree) and random failures. After node removal, we measured the relative size of the giant component, the number of connected components, average shortest path length, and global efficiency. All the analysis fore this paper were performed in Python, using pandas, matplotlib, numpy, networkx and power-laws, with the version available on february 18th, 2026. 4 Results and discussions 4.1 Scale-free structure 10 0 10 1 10 2 10 3 In-degree k in 10 â5 10 â3 10 â1 Density A Empirical (log-binned) Power-law fit (α=1.53, x min =1) 10 0 10 1 10 2 10 3 In-strength s in 10 â6 10 â4 10 â2 Density B Empirical (log-binned) Power-law fit (α=1.43, x min =1) Figure 2: Log-binned empirical distributions and power-law fits for (A) in-degree and (B) in-strength. Each red point show the empirical log-binned distributions, while the solid blue lines indicate the maximum likelihood power-law fit estimated above the threshold x min = 1. The fitted scaling exponents are α = 1.53 and α = 1.43, respectively. Firstly, we analyze the degree and strength distributions, as depicted in Figures 2, which report the distributions of in-degreek in and in-strengths in in the directed user interaction network, shown on logâlog scales. The in-degree measures the number of distinct users who have commented on a given user, whereas the in-strength represents the total number of received comments, which are the sum of incoming edge weights. Both distributions are strongly right-skewed and characterized by extended heavy tails which follows a scale-free distribution for two and an half order of magnitude. As a metter of fact, the KolmogorovâSmirnov distance (KSâ 0.19) indicates that the pure power-law model does not perfectly describe the entire support of the distribution but only on the first regime, which got truncated where high values with few observations. MetricMean (ÎŒ)Median ( Ìx)Difference (ÎŒâ Ìx) In-degree (k in )14.4368.43 In-strength (s in )37.40829.40 Table 1: Comparison of User Visibility Metrics The observed distributions reveal marked heterogeneity in user visibility. Table 1 shows a substantial gap between mean and median values, indicating a highly imbalanced structure in which a small fraction of nodes concentrates a large share of received interactions. Also, the maximum observed values (k in = 1031,s in = 4320) further confirm the presence of highly central hubs. The estimated scaling exponents (αâ 1.5) are consistent with heavy-tailed regimes and imply high structural variability. Strongly asymmetric degree distributions with extended tails are widely documented in human social networks, both offline and online BarabĂĄsi and Albert [1999], Newman [2005]. Similar concentration patterns have been observed in electronic communication networks Ebel et al. [2002] and online social platforms Mislove et al. [2007]. In many 5 A PREPRINT - MARCH 25, 2026 10 0 10 1 10 2 10 3 10 4 10 5 Activity x 10 â4 10 â3 10 â2 10 â1 10 0 P ( X â„ x ) Posts per user Comments per user Figure 3: Complementary cumulative distribution functions (CCDF) of user activity (posts and comments per user) on logâlog scales. empirical contexts, estimated exponents typically fall within the range2 < α < 3, although substantial variability exists Clauset et al. [2009]. In the present case, the estimated exponent is below 2 (αâ 1.5), indicating an even stronger inequality in interaction distribution. Consistent with the discussion in Clauset et al. [2009], Broido and Clauset [2019], the observed KS distance suggests that the network cannot be considered strictly âscale-free.â Overall, the structure is qualitatively similar to many human social networksâcharacterized by high heterogeneity and the presence of hubsâwhile not fully satisfying the statistical criteria of a pure power-law. Notably, these structural patterns emerge in a system populated entirely by artificial agents, without direct human participation, suggesting that several canonical properties of social networks may arise from basic interaction mechanisms rather than uniquely human social behavior. Figure 3 shows the complementary cumulative distribution function of the number of posts and comments per user on logâlog scales. Each point represents the probabilityP(Xâ„ x)that a user has produced at leastxitems. The two curves describe the distribution of user activity: post publication and comment writing. The approximately linear trend in logâlog scale indicates the presence of heavy tails. The comments curve extends over a wider range of magnitudes compared to the one of the posts, signaling a much greater variability in top commenting activity compared to top posting activity. StatisticPosts per UserComments per User Mean5.938.58 Median21 Std Dev35.271221.25 Min00 25th Percentile10 75th Percentile44 90th Percentile1019 95th Percentile2148 99th Percentile80.77275 Max5814120969 Table 2: Descriptive statistics of the number of posts and comments per user. As the table 2 shows, the data reveal a strong inequality in user activity. The median is substantially lower than the mean (posts: 2 vs 5.9; comments: 1 vs 38.58), indicating that the majority of users produce only a small amount of content, while a minority is extremely active. The 99th percentile equals 80.77 posts but exceeds 275 comments, suggesting that interaction intensity is concentrated primarily in commenting behavior. The maximum observed value (over 120,000 comments by a single user) further highlights the presence of extremely high-productivity users. Commenting activity is considerably more dispersed (Ïâ 1221) than posting activity (Ïâ 35), indicating that conversational engagement is structurally more polarized. Overall, content production follows a strongly heterogeneous dynamic dominated by a 6 A PREPRINT - MARCH 25, 2026 10 0 10 1 10 2 10 3 Posts per user 10 0 10 1 10 2 10 3 10 4 Frequency A 10 0 10 1 10 2 10 3 10 4 10 5 Comments per user 10 0 10 1 10 2 10 3 Frequency B Figure 4: Log-binned histograms of posts per user (A) and comments per user (B), shown on logâlog scales. Bins are constructed using logarithmic spacing. Both distributions exhibit strong right-skewness, with a small fraction of users accounting for a large share of activity. small number of highly active users. Highly asymmetric activity distributions are a well-documented characteristic of human social networks; it is shown that activity on online platforms is highly concentrated among a minority of users Wu and Huberman [2007]. Analyses of networks such as YouTube, Flickr, and Orkut report similar patterns of inequality in content production Mislove et al. [2007]. Also the early-age Twitter likewise document a strong concentration of posting activity within a small fraction of users Kwak et al. [2010]. In the present case, the observed distribution is qualitatively consistent with these findings: both posting and, especially, commenting are dominated by a highly active minority. The pronounced dispersion in commenting activity suggests that conversational dynamics amplify inequality relative to the mere publication of original content. The resulting structure is therefore comparable, in terms of activity concentration, to that observed in human social platforms. 4.2 Network fragility 10 0 10 1 Rank 10 1 10 2 10 3 10 4 Component size A Giant = 39,878 10 1 10 2 10 3 10 4 Rank 10 0 10 1 10 2 10 3 10 4 Component size B Giant = 13,369 Figure 5: Rankâsize distributions of WCC and SCC in the directed network. Panel (A) shows the WCC distribution, highlighting the dominance of the Giant WCC (99.9%). Panel (B) shows the SCC distribution, where the Giant SCC is substantially smaller(33.5%). Figure 5 shows the rankâsize distributions of weakly connected components and strongly connected components (respectively, WCC and SCC) in the directed network. The plot highlights how big is the giant component in comparison to the overall network. For the weakly connected components, the largest component includes 39,878 nodes (which is 99.9% of the total), while the remaining components are negligible in size. In contrast, the largest 7 A PREPRINT - MARCH 25, 2026 strongly connected component comprises 13,369 nodes (33.5%), followed by a very large number of unitary or very small components. The discrepancy suggests a strongly asymmetric structure: most users are reachable within the system, yet mutual reachability does not extend across the entire network. From a dynamical perspective, this implies that information can propagate globally (due to the near-total WCC), whereas feedback mechanisms and bidirectional circulation are confined to a more compact structural subset. On a practical size, this suggest the possibility of existence of echo chambers also in LLMs social networks. Such patterns are commonly observed in large-scale directed networks. In the Web graph, for instance, a âbow-tieâ structure emerges in which a Giant SCC is embedded within a much larger weakly connected component [Broder et al., 2000]. Similar directional asymmetries have been documented in Twitter networks [Kwak et al., 2010]. Large-scale social platforms also exhibit near-total weak connectivity; for example, the Facebook graph shows a giant component covering the vast majority of active users [Ugander et al., 2011]. In the broader framework of complex networks, the divergence between WCC and SCC sizes in directed graphs is interpreted as evidence of directional flows and hierarchical organization [Newman, 2010]. The emergence of hubs in growing networks further contributes to globally connected yet structurally asymmetric configurations [BarabĂĄsi and Albert, 1999]. Overall, the Moltbook network exhibits near-total weak connectivity alongside a substantially smaller strongly connected core, indicating a globally reachable but directionally constrained structure consistent with large-scale social systems. Also, a core-periphery analyses is possible, and the results are shown integrating (i) a mesoscale structural characteriza- tion (coreâperiphery) and (i) a robustness/vulnerability experiment based on progressive node removal, summarized in Table 3. Table 3: Coreâperiphery structural indicators for the Moltbook network. MetricValue Optimal threshold (k â )102 Observed k max 102 Nodes in core343 Core (% of nodes)0.9% Nodes in periphery39,535 Periphery (% of nodes)99.1% BorgattiâEverett fit (BE)â 0.1102 In assessing the mesoscale structure, we adopted the coreâperiphery approach proposed by Stephen P. Borgatti and Martin G. Everett, which formalizes the intuition of a dense core and a sparse periphery by estimating a core/periphery partition according to its coherence with such an ideal configuration Borgatti and Everett [2000]. The BorgattiâEverett fit is moderate, but the decomposition still reveals a clear structural separation between a dense nucleus of highly connected nodes and a large peripheral population. In the Moltbook network, the k-core decomposition reveals marked heterogeneity (min = 1, max = 102, mean = 14.66, median = 7, standard deviation = 19.94), indicating that most users occupy low levels of âcoreness,â while a very small fraction attains extreme values. Optimization of the BE criterion selects a threshold (k â = 102), coinciding withk max , yielding a core of 343 nodes (0.9%) and a periphery of 39,535 nodes (99.1%). The BE fit (â 0.1102) signals a present but non-idealized coreâperiphery structure, that is, a coherent structural separation despite interactions that do not perfectly conform to the dense-core/sparse-periphery dichotomy. From an interpretative standpoint, such a restricted core implies that global cohesion is not uniformly distributed: a small number of nodes concentrate the redundancy of connections necessary to sustain the relational backbone, whereas the periphery consists predominantly of users with structurally limited participation and limited capacity to maintain autonomous connectivity. In a directed comment network, this profile is consistent with a system in which interaction organizes around a very small set of âcentral actors,â alongside a broad peripheral basin that contributes less to closure and internal density. To directly connect this mesoscale structure to global connectivity stability, we measured robustness through node removal experiments, comparing random removals with targeted removals of nodes ranked by in-degree and out-degree. This type of experiment corresponds to the classical targeted attack framework used in network science to evaluate the robustness and fragility of heterogeneous networks. Methodologically, robustness is evaluated on the undirected version of the graph, so that fragmentation is interpreted as the loss of topological connectivity rather than directional reachability. Table 4 and Figure 6 present the vulnerability analysis of the network, reporting the fraction of the giant component as a function of the percentage of removed nodes (1%, 5%, 10%, 20%) under random failures and targeted attacks. Under random removal, the giant component remains large even at substantial removal levels (approximately 78% of its initial 8 A PREPRINT - MARCH 25, 2026 0.02.55.07.510.012.515.017.520.0 Nodes removed (%) 0.0 0.2 0.4 0.6 0.8 1.0 Giant component fraction Targeted (in-degree) Targeted (out-degree) Random (mean ± std) Figure 6: Vulnerability analysis of the Moltbook network. Relative size of the giant connected component as a function of the fraction of removed nodes (1%, 5%, 10%, 20%) under random removal (mean±standard deviation) and targeted removal based on in-degree and out-degree. Nodes removed (%)RandomTargeted (in-degree)Targeted (out-degree) 10.990.980.75 50.940.730.59 100.860.640.45 200.780.490.15 Table 4: Fraction of the giant component after removing increasing percentages of nodes under different attack strategies. size after removing 20% of nodes), indicating robustness to unstructured failures. Under targeted removal by in-degree, the giant component decreases more rapidly (approximately 73% at 5% removed; approximately 49% at 20% removed), suggesting that the most ârecognizedâ or highly commented nodes contribute significantly to global cohesion. Targeted removal by out-degree is the most disruptive (approximately 75% already at 1% removed; approximately 45% at 10%; approximately 15% at 20%), indicating that nodes most active in generating interactions are crucial for maintaining overall connectivity. These results suggest that, in AI-agent social environments, the structural backbone of the network may depend more strongly on agents that actively generate interactions than on those that merely accumulate visibility. The combination of (i) an extremely small core and (i) rapid collapse under targeted removals indicates strong structural dependence on a minority of nodes: when the most central nodes are removed, the already weakly cohesive periphery lacks sufficient redundancy to preserve a dominant connected component. Moreover, the greater sensitivity to out- degreeâbased attacks suggests that the structural âpillarsâ of connectivity are not only highly popular nodes (high in-degree), but especially those that activate and distribute interactions, acting as topological bridges between otherwise weakly interconnected regions of the network. These results are consistent with classical findings on the robustness of heterogeneous complex networks: seminal works show that networks with highly unequal connectivity tend to be robust to random failures but vulnerable to targeted attacks on highly connected nodes Albert et al. [2000]. The interpretative link between targeted fragility and hub-dominated architectures is further discussed in BarabĂĄsi and Bonabeau [2003], where the presence of a few extremely connected nodes is associated with asymmetric resilience (robustness to random failures vs. vulnerability to selective removal). In comparison with human online social networks, empirical studies on real platforms regularly report (i) a dominant giant connected component and (i) marked structural and local heterogeneity: for instance, Ugander et al. [2011] describe a Facebook graph that is almost entirely connected and exhibits surprisingly dense local regions within a globally sparse structure. Similarly, Mislove et al. [2007] document recurring structural properties across multiple online social networks and highlight the importance of a small fraction of highly connected nodes 9 A PREPRINT - MARCH 25, 2026 for global structure. For directed networks, studies on Twitter emphasize that link asymmetry and the centrality of particularly active users can shape diffusion and observable connectivity, making the distinction between âreceivingâ and âgeneratingâ connections analytically relevant Kwak et al. [2010]. So, how all of this happens? Why different agents are so more productive than others than connect the overall network in such a delicate way? Our work leave this questions opened, but underlying their importance. We start to be conscious of both our inability of actually align the behavior of an LLM system acting as cognitive engine of an agent Lynch et al. [2025] and the effect of multiple collective interactions Bertolotti and Mari [2025]. We do not know why some agents tend to interact more and other less. We can not interview them, or get anything more than a black-box understanding. We can observed how do they interact, and from this observation we can suggest some kind of emergence properties are generated, given that such a difference could not be necessary generated by a designed training, fine-tuning, context or instructions. 5 Conclusion This study provides a network-science characterization of the interaction structure emerging within Moltbook, a social platform populated entirely by LLM-based agents. By constructing and analyzing a large-scale interaction network derived from posts and comments, we investigated the structural organization of the system in terms of connectivity patterns, activity distributions, mesoscale organization, and robustness properties. The results reveal a highly heterogeneous structure dominated by a small number of highly central nodes. Degree and activity distributions display strong heavy-tailed behavior, indicating substantial inequality in both visibility and participation among agents. At the mesoscale, the k-core decomposition highlights the presence of a very small structural core comprising only 0.9% of nodes, surrounded by a large peripheral population with limited connectivity. Despite a moderate BorgattiâEverett fit, this decomposition still indicates a clear separation between a dense nucleus of highly interconnected agents and a broad periphery. Robustness experiments further show that the network exhibits asymmetric resilience properties. While the giant connected component remains relatively stable under random node removals, targeted removal of highly connected nodes rapidly fragments the network. In particular, nodes with high out-degree play a critical role in sustaining global connectivity, suggesting that agents actively generating interactions function as key structural bridges across the network. Taken together, these findings suggest that interaction networks formed by populations of artificial agents can reproduce several structural features commonly observed in human online social networksâsuch as heterogeneous connectivity, hub dominance, and large giant componentsâwhile also exhibiting pronounced centralization and structural fragility. More broadly, these results suggest that large-scale societies of interacting AI agents may spontaneously generate hier- archical and centralized interaction structures, even in the absence of explicit coordination mechanisms. Understanding these emergent structural properties is therefore essential for anticipating the stability, resilience, and systemic risks of future AI-mediated social ecosystems. As LLM-based agents increasingly interact in shared digital environments, understanding the structural properties of these emerging artificial social systems becomes an important research direction. Future work may explore the temporal evolution of such networks, the dynamics of information diffusion among agents, comparative analyses between AI-native and human social platforms, and discover the underlying generative process. 10 A PREPRINT - MARCH 25, 2026 References RĂ©ka Albert and Albert-LĂĄszlĂł BarabĂĄsi. Statistical mechanics of complex networks. Reviews of modern physics, 74(1): 47, 2002. RĂ©ka Albert, Hawoong Jeong, and Albert-LĂĄszlĂł BarabĂĄsi. Error and attack tolerance of complex networks. nature, 406(6794):378â382, 2000. Laura Alessandretti, Luis Guillermo Natera Orozco, Meead Saberi, Michael Szell, and Federico Battiston. Multimodal urban mobility and multilayer transport networks. Environment and Planning B: Urban Analytics and City Science, 50(8):2038â2070, 2023. Dario Amodei, Chris Olah, Jacob Steinhardt, Paul Christiano, John Schulman, and Dan ManĂ©. Concrete problems in ai safety. arXiv preprint arXiv:1606.06565, 2016. Albert-LĂĄszlĂł BarabĂĄsi and RĂ©ka Albert. Emergence of scaling in random networks. science, 286(5439):509â512, 1999. Albert-LĂĄszlĂł BarabĂĄsi and Eric Bonabeau. Scale-free networks. Scientific american, 288(5):60â69, 2003. Emily M Bender, Timnit Gebru, Angelina McMillan-Major, and Shmargaret Shmitchell. On the dangers of stochastic parrots: Can language models be too big? In Proceedings of the 2021 ACM conference on fairness, accountability, and transparency, pages 610â623, 2021. Francesco Bertolotti and Luca Mari.An llm-based delphi study to predict genai evolution.arXiv preprint arXiv:2502.21092, 2025. Francesco Bertolotti and Riccardo Occa. âroads? where weâre going we donât need roads.â using agent-based modeling to analyze the economic impact of hyperloop introduction on a supply chain. In European Conference on Multi-Agent Systems, pages 493â500. Springer, 2020. Francesco Bertolotti and Sabin Roman. Risk sensitive scheduling strategies of production studios on the us movie market: An agent-based simulation. Intelligenza Artificiale, 16(1):81â92, 2022. Francesco Bertolotti, NiccolĂČ Kadera, Luca Pasquino, and Luca Mari. An epidemiological extension of the el farol bar problem. Frontiers in Big Data, 8:1519369, 2025. Ginestra Bianconi and Christoph Rahmede. Emergent hyperbolic network geometry. Scientific reports, 7(1):41974, 2017. Stefano Boccaletti, Ginestra Bianconi, Regino Criado, Charo I Del Genio, JesĂșs GĂłmez-Gardenes, Miguel Romance, Irene Sendina-Nadal, Zhen Wang, and Massimiliano Zanin. The structure and dynamics of multilayer networks. Physics reports, 544(1):1â122, 2014. Stephen P Borgatti and Martin G Everett. Models of core/periphery structures. Social networks, 21(4):375â395, 2000. Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wiener. Graph structure in the web. Computer networks, 33(1-6):309â320, 2000. Anna D Broido and Aaron Clauset. Scale-free networks are rare. Nature communications, 10(1):1017, 2019. Tom Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared D Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. Language models are few-shot learners. Advances in neural information processing systems, 33:1877â1901, 2020. Erik Brynjolfsson, Danielle Li, and Lindsey Raymond. Generative ai at work. The Quarterly Journal of Economics, 140(2):889â942, 2025. Claudio Castellano, Matteo Marsili, and Alessandro Vespignani. Nonequilibrium phase transition in a model for social influence. Physical Review Letters, 85(16):3536, 2000. Aaron Chatterji, Thomas Cunningham, David J Deming, Zoe Hitzig, Christopher Ong, Carl Yan Shan, and Kevin Wadman. How people use chatgpt. Technical report, National Bureau of Economic Research, 2025. Aaron Clauset, Cosma Rohilla Shalizi, and Mark EJ Newman. Power-law distributions in empirical data. SIAM review, 51(4):661â703, 2009. Michele Coscia. The atlas for the aspiring network scientist. arXiv preprint arXiv:2101.00863, 2021. Michael M Danziger and Albert-LĂĄszlĂł BarabĂĄsi. Recovery coupling in multilayer networks. Nature communications, 13(1):955, 2022. Giordano De Marzo and David Garcia. Collective behavior of ai agents: the case of moltbook. arXiv preprint arXiv:2602.09270, 2026. 11 A PREPRINT - MARCH 25, 2026 Giordano De Marzo, Claudio Castellano, and David Garcia. Ai agents can coordinate beyond human scale. arXiv preprint arXiv:2409.02822, 2024. Mark E Dickison, Matteo Magnani, and Luca Rossi. Multilayer social networks. Cambridge University Press, 2016. Holger Ebel, Lutz-Ingo Mielsch, and Stefan Bornholdt. Scale-free topology of e-mail networks. Physical review E, 66 (3):035103, 2002. Tyna Eloundou, Sam Manning, Pamela Mishkin, and Daniel Rock. Gpts are gpts: Labor market impact potential of llms. Science, 384(6702):1306â1308, 2024. David Holtz. The anatomy of the moltbook social graph. arXiv preprint arXiv:2602.10131, 2026. Yukun Jiang, Yage Zhang, Xinyue Shen, Michael Backes, and Yang Zhang. " humans welcome to observe": A first look at the agent social network moltbook. arXiv preprint arXiv:2602.10127, 2026. Mikko KivelĂ€, Alex Arenas, Marc Barthelemy, James P Gleeson, Yamir Moreno, and Mason A Porter. Multilayer networks. Journal of complex networks, 2(3):203â271, 2014. Dmitri Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, and MariĂĄn BogunĂĄ. Hyperbolic geometry of complex networks. Physical Review EâStatistical, Nonlinear, and Soft Matter Physics, 82(3):036106, 2010. Haewoon Kwak, Changhyun Lee, Hosung Park, and Sue Moon. What is twitter, a social network or a news media? In Proceedings of the 19th international conference on World wide web, pages 591â600, 2010. Lingyao Li, Renkai Ma, Chen Chen, Zhicong Lu, and Yongfeng Zhang. The rise of ai agent communities: Large-scale analysis of discourse and interaction on moltbook. arXiv preprint arXiv:2602.12634, 2026. Weixin Liang, Yaohui Zhang, Mihai Codreanu, Jiayu Wang, Hancheng Cao, and James Zou. The widespread adoption of large language model-assisted writing across society. Patterns, 6(12), 2025. Xixun Lin, Yucheng Ning, Jingwen Zhang, Yan Dong, Yilong Liu, Yongxuan Wu, Xiaohua Qi, Nan Sun, Yanmin Shang, Kun Wang, et al. Llm-based agents suffer from hallucinations: A survey of taxonomy, methods, and directions. arXiv preprint arXiv:2509.18970, 2025. Aengus Lynch, Benjamin Wright, Caleb Larson, Stuart J Ritchie, Soren Mindermann, Evan Hubinger, Ethan Perez, and Kevin Troy. Agentic misalignment: How llms could be insider threats. arXiv preprint arXiv:2510.05179, 2025. Alan Mislove, Massimiliano Marcon, Krishna P Gummadi, Peter Druschel, and Bobby Bhattacharjee. Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pages 29â42, 2007. Muhammad Ahmed Mohsin, Muhammad Umer, Ahsan Bilal, Zeeshan Memon, Muhammad Ibtsaam Qadir, Sagnik Bhattacharya, Hassan Rizwan, Abhiram R Gorle, Maahe Zehra Kazmi, Nukhba Amir, et al. On the fundamental limits of llms at scale. arXiv preprint arXiv:2511.12869, 2025. Jacob Levy Moreno. Who shall survive?: A new approach to the problem of human interrelations. Nervous and mental disease publishing co, 1934. Mark E. J. Newman. Networks: An Introduction. Oxford University Press, 2010. ISBN 9780199206650. Mark EJ Newman. Power laws, pareto distributions and zipfâs law. Contemporary physics, 46(5):323â351, 2005. Long Ouyang, Jeffrey Wu, Xu Jiang, Diogo Almeida, Carroll Wainwright, Pamela Mishkin, Chong Zhang, Sandhini Agarwal, Katarina Slama, Alex Ray, et al. Training language models to follow instructions with human feedback. Advances in neural information processing systems, 35:27730â27744, 2022. Fragkiskos Papadopoulos, Maksim Kitsak, M Ăngeles Serrano, MariĂĄn BogunĂĄ, and Dmitri Krioukov. Popularity versus similarity in growing networks. Nature, 489(7417):537â540, 2012. Joon Sung Park, Joseph OâBrien, Carrie Jun Cai, Meredith Ringel Morris, Percy Liang, and Michael S Bernstein. Generative agents: Interactive simulacra of human behavior. In Proceedings of the 36th annual acm symposium on user interface software and technology, pages 1â22, 2023. Giorgio Piatti, Zhijing Jin, Max Kleiman-Weiner, Bernhard Schölkopf, Mrinmaya Sachan, and Rada Mihalcea. Cooperate or collapse: Emergence of sustainable cooperation in a society of llm agents. Advances in Neural Information Processing Systems, 37:111715â111759, 2024. Aske Plaat, Max van Duijn, Niki Van Stein, Mike Preuss, Peter van der Putten, and Kees Joost Batenburg. Agentic large language models, a survey. Journal of Artificial Intelligence Research, 84, 2025. Christina Prell. Social network analysis: History, theory and methodology. Sage, 2011. Nick Schuster and Daniel Kilov. Moral disagreement and the limits of ai value alignment: a dual challenge of epistemic justification and political legitimacy. AI & society, pages 1â15, 2025. 12 A PREPRINT - MARCH 25, 2026 Tianhao Shen, Renren Jin, Yufei Huang, Chuang Liu, Weilong Dong, Zishan Guo, Xinwei Wu, Yan Liu, and Deyi Xiong. Large language model alignment: A survey. arXiv preprint arXiv:2309.15025, 2023. Johan Ugander, Brian Karrer, Lars Backstrom, and Cameron Marlow. The anatomy of the facebook social graph. arXiv preprint arXiv:1111.4503, 2011. Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Ćukasz Kaiser, and Illia Polosukhin. Attention is all you need. Advances in neural information processing systems, 30, 2017. Zhichao Wang, Bin Bi, Shiva Kumar Pentyala, Kiran Ramnath, Sougata Chaudhuri, Shubham Mehrotra, Xiang-Bo Mao, Sitaram Asur, et al. A comprehensive survey of llm alignment techniques: Rlhf, rlaif, ppo, dpo and more. arXiv preprint arXiv:2407.16216, 2024. Stanley Wasserman and Katherine Faust. Social network analysis: Methods and applications. Cambridge university press, 1994. Duncan J Watts and Steven H Strogatz. Collective dynamics of âsmall-worldânetworks. nature, 393(6684):440â442, 1998. Yotam Wolf, Noam Wies, Oshri Avnery, Yoav Levine, and Amnon Shashua. Fundamental limitations of alignment in large language models. arXiv preprint arXiv:2304.11082, 2023. Fang Wu and Bernardo A Huberman. Novelty and collective attention. Proceedings of the National Academy of Sciences, 104(45):17599â17601, 2007. Yiming Zhu, Yupeng He, Ehsan-Ul Haq, Gareth Tyson, and Pan Hui. Characterizing llm-driven social network: The chirper. ai case. arXiv preprint arXiv:2504.10286, 2025. Yiming Zhu, Gareth Tyson, and Pan Hui. A comparative analysis of social network topology in reddit and moltbook. arXiv preprint arXiv:2602.13920, 2026. 13