惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Visual Studio Blog
Engineering at Meta
Engineering at Meta
月光博客
月光博客
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
T
Tailwind CSS Blog
博客园 - Franky
The GitHub Blog
The GitHub Blog
大猫的无限游戏
大猫的无限游戏
The Cloudflare Blog
B
Blog RSS Feed
云风的 BLOG
云风的 BLOG
小众软件
小众软件
罗磊的独立博客
Microsoft Azure Blog
Microsoft Azure Blog
I
InfoQ
美团技术团队
H
Hackread – Cybersecurity News, Data Breaches, AI and More
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
V
V2EX
C
Check Point Blog
WordPress大学
WordPress大学
博客园 - 【当耐特】
博客园 - 司徒正美
D
Docker

cs.SI updates on arXiv.org

Hiding in Plain Sight: Finding MAHA on Reddit Prism: Structural Symmetry Scanning via Duality-Constrained Laplacian Projection MV-Gate: Insider Threat Detection via Multi-View Behavioral Statistics and Semantic Modeling Algorithmic Cultivation: How Social Media Feeds Shape User Language Universal Dynamics of Punctuated Progress AI-Mediated Communication Can Steer Collective Opinion CitePrism: Human-in-the-Loop AI for Citation Auditing and Editorial Integrity Explainable Detection of Depression Status Shifts from User Digital Traces Can Visual Mamba Improve AI-Generated Image Detection? An In-Depth Investigation ScioMind: Cognitively Grounded Multi-Agent Social Simulation with Anchoring-Based Belief Dynamics and Dynamic Profiles Humanwashing -- It Should Leave You Feeling Dirty When Do LLMs Generate Realistic Social Networks? A Multi-Dimensional Study of Culture, Language, Scale, and Method Moltbook Moderation: Uncovering Hidden Intent Through Multi-Turn Dialogue Linking Extreme Discourse to Structural Polarization in Signed Interaction Networks Predicting Channel Closures in the Lightning Network with Machine Learning Latent Causal Void: Explicit Missing-Context Reconstruction for Misinformation Detection Predictive Maps of Multi-Agent Reasoning: A Successor-Representation Spectrum for LLM Communication Topologies Large Language Models for Causal Relations Extraction in Social Media: A Validation Framework for Disaster Intelligence When Can Digital Personas Reliably Approximate Human Survey Findings? RAwR: Role-Aware Rewiring via Approximate Equitable Partition GravityGraphSAGE: Link Prediction in Directed Attributed Graphs Structure-Centric Graph Foundation Model via Geometric Bases Attention-based graph neural networks: a survey When AI Meets Science: Research Diversity, Interdisciplinarity, Visibility, and Retractions across Disciplines in a Global Surge Scalable inference of spatial regions and temporal signatures from time series Can LLMs Emulate Human Belief Dynamics? Predicting Post Virality with Temporal Cross-Attention over Trend Signals H3: A Healthcare Three-Hop Index for Physician Referral Network Prediction Dynamic Graph with Similarity-Aware Attention Graph Neural Network for Recommender Systems Spectral Graph Sparsification Preserves Representation Geometry in Graph Neural Networks
Analytical results for the in-degree and out-degree distr...
Chanania Steinbock, Ofer Biham, Eytan Katzav · 2018-07-03 · via cs.SI updates on arXiv.org

We present exact results for the degree distribution in a directed network model that grows by node duplication (ND). Such models are useful in the study of the structure and growth dynamics of gene regulatory networks and scientific citation networks. Starting from an initial seed network, at each time step a random node, a mother node, is selected for duplication. Its daughter node is added to the network and duplicates each outgoing link of the mother node with probability p. In addition, the daughter node forms a directed link to the mother node itself. We obtain analytical results for the in-degree distribution $P_t(K_{in}=k)$, and for the out-degree distribution $P_t(K_{out}=k)$ at time t. The in-degrees follow a shifted power-law, so the network is asymptotically scale free. In contrast, the out-degree distribution is narrow, and converges to a Poisson distribution in the sparse network limit and to a Gaussian distribution in the dense network limit. Such distinction between a broad in-degree distribution and a narrow out-degree distribution is common in empirical networks such as scientific citation networks. Using this we calculate the mean degree $\langle K_{in}\rangle_t=\langle K_{out}\rangle_t$, which converges to $1/(1-p)$ in the large network limit, for the whole range of $0<p<1$. This is in contrast to the corresponding undirected network, which exhibits a phase transition at $p=1/2$ such that for $p>1/2$ the mean degree diverges in the large network limit. We also present analytical results for the distribution of the number of upstream and downstream nodes from a random node. The mean values $\langle N_{up}\rangle_t=\langle N_{down}\rangle_t$ scale logarithmically with the network size, implying that only a small fraction of pairs of nodes are connected by directed paths, unlike the undirected ND case that consists of a single component, hence not a small-world network.