Search:
Match:
5 results
Paper#Community Detection, Network Analysis, Machine Learning🔬 ResearchAnalyzed: Jan 3, 2026 15:38

Density-Based Community Detection in Attributed Networks

Published:Dec 30, 2025 16:44
1 min read
ArXiv

Analysis

This paper introduces AttDeCoDe, a novel community detection method designed for attributed networks. It addresses the limitations of existing methods by considering both network topology and node attributes, particularly focusing on homophily and leader influence. The method's strength lies in its ability to form communities around attribute-based representatives while respecting structural constraints, making it suitable for complex networks like research collaboration data. The evaluation includes a new generative model and real-world data, demonstrating competitive performance.
Reference

“AttDeCoDe estimates node-wise density in the attribute space, allowing communities to form around attribute-based community representatives while preserving structural connectivity constraints.”

PermalinkArXiv
Research Paper#Opinion Dynamics, Hypergraphs, Machine Learning🔬 ResearchAnalyzed: Jan 3, 2026 18:57

Adaptive Two-Layer Model for Opinion Spread in Hypergraphs

Published:Dec 29, 2025 10:34
1 min read
ArXiv

Analysis

This paper introduces a novel two-layer random hypergraph model to study opinion spread, incorporating higher-order interactions and adaptive behavior (changing opinions and workplaces). It investigates the impact of model parameters on polarization and homophily, analyzes the model as a Markov chain, and compares the performance of different statistical and machine learning methods for estimating key probabilities. The research is significant because it provides a framework for understanding opinion dynamics in complex social structures and explores the applicability of various machine learning techniques for parameter estimation in such models.
Reference

“The paper concludes that all methods (linear regression, xgboost, and a convolutional neural network) can achieve the best results under appropriate circumstances, and that the amount of information needed for good results depends on the strength of the peer pressure effect.”

PermalinkArXiv
Research#llm🔬 ResearchAnalyzed: Jan 4, 2026 09:22

Feature-Centric Unsupervised Node Representation Learning Without Homophily Assumption

Published:Dec 17, 2025 06:04
1 min read
ArXiv

Analysis

This article describes a research paper on unsupervised node representation learning. The focus is on learning node representations without relying on the homophily assumption, which is a common assumption in graph neural networks. The approach is feature-centric, suggesting a focus on the features of the nodes themselves rather than their relationships with neighbors. This is a significant area of research as it addresses a limitation of many existing methods.

Key Takeaways

    Reference

    “”

    PermalinkArXiv
    Research#llm🔬 ResearchAnalyzed: Jan 4, 2026 07:56

    Dynamic Homophily with Imperfect Recall: Modeling Resilience in Adversarial Networks

    Published:Dec 13, 2025 13:45
    1 min read
    ArXiv

    Analysis

    This article, sourced from ArXiv, likely presents a research paper. The title suggests an investigation into network dynamics, specifically focusing on how networks maintain resilience in the face of adversarial attacks. The concepts of 'dynamic homophily' (the tendency of similar nodes to connect) and 'imperfect recall' (the limited ability to remember past events) are central to the study. The research likely involves modeling and simulation to understand these complex interactions.

    Key Takeaways

      Reference

      “”

      PermalinkArXiv
      Research#llm🔬 ResearchAnalyzed: Jan 4, 2026 07:04

      Harnessing Rich Multi-Modal Data for Spatial-Temporal Homophily-Embedded Graph Learning Across Domains and Localities

      Published:Dec 11, 2025 23:51
      1 min read
      ArXiv

      Analysis

      This article describes a research paper focusing on graph learning, specifically utilizing multi-modal data and spatial-temporal information. The core concept revolves around embedding homophily (similarity) within the graph structure across different domains and locations. The title suggests a focus on advanced techniques for analyzing complex data.
      Reference

      “”

      PermalinkArXiv