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

推荐订阅源

Vercel News
Vercel News
F
Fortinet All Blogs
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
GbyAI
GbyAI
MongoDB | Blog
MongoDB | Blog
Jina AI
Jina AI
aimingoo的专栏
aimingoo的专栏
I
InfoQ
IT之家
IT之家
罗磊的独立博客
Blog — PlanetScale
Blog — PlanetScale
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
The Cloudflare Blog
爱范儿
爱范儿
Microsoft Azure Blog
Microsoft Azure Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
美团技术团队
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
B
Blog RSS Feed
G
Google Developers Blog
大猫的无限游戏
大猫的无限游戏
博客园_首页
Engineering at Meta
Engineering at Meta
Martin Fowler
Martin Fowler

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
Dynamics of hot random hyperbolic graphs
Fragkiskos Papadopoulos, Sofoclis Zambirinis · 2021-10-06 · via cs.SI updates on arXiv.org

We derive the most basic dynamical properties of random hyperbolic graphs (the distributions of contact and intercontact durations) in the hot regime (network temperature $T > 1$). We show that for sufficiently large networks the contact distribution decays as a power law with exponent $2+T > 3$ for durations $t > T$, while for $t < T$ it exhibits exponential-like decays. This result holds irrespective of the expected degree distribution, as long as it has a finite $T^{\text{th}}$ moment. Otherwise, the contact distribution depends on the expected degree distribution and we show that if the latter is a power law with exponent $γ\in (2, T+1]$, then the former decays as a power law with exponent $γ+1 > 3$. On the other hand, the intercontact distribution exhibits power-law decays with exponent $2-T \in (0, 1)$ for $T \in (1,2)$, while for $T > 2$ it displays linear decays with a slope that depends on the observation interval. This result holds irrespective of the expected degree distribution as long as it has a finite $T^{\text{th}}$ moment if $T \in (1,2)$, or a finite second moment if $T > 2$. Otherwise, the intercontact distribution depends on the expected degree distribution and if the latter is a power law with exponent $γ\in (2, 3)$, then the former decays as a power law with exponent $3-γ\in (0,1)$. Thus, hot random hyperbolic graphs can give rise to contact and intercontact distributions that both decay as power laws. These power laws however are unrealistic for the case of the intercontact distribution, as their exponent is always less than one. These results mean that hot random hyperbolic graphs are not adequate for modeling real temporal networks, in stark contrast to cold random hyperbolic graphs ($T < 1$). Since the configuration model emerges at $T \to \infty$, these results also suggest that this is not an adequate null temporal network model.