Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

89179268357 · Jun 202019922001200920172026
48 results for dynamic communication

GRADE models evolving graph dynamics by learning node and community representations.

problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.

New method learns dynamic brain communication patterns across regions.

problem Current methods struggle with time-varying brain communications and scalability.
method Adaptive Delay Model (ADM) using Markovian Gaussian Processes.
result Captures dynamic neural communication patterns over time.

A fast spectral algorithm detects community structure in evolving graphs.

problem Detecting community structure in time-evolving sparse graphs.
method Extension of the Bethe-Hessian matrix for spectral community detection.
result The algorithm reaches the optimal detectability threshold and outperforms other methods.

Unified framework detects dynamic community structure in brain networks across individuals.

problem Detecting community structure in functional brain networks across multiple subjects and over time.
method Markov-switching stochastic block model (MSS-SBM) for multilayer brain networks.
result Captures dynamic reconfiguration of modular connectivity in brain networks across different task conditions.

Workplace communications became more siloed during the pandemic, reducing stability within communities.

problem Understanding changes in intra-organizational communication networks during the pandemic.
method Analyzed aggregated email metadata from 4,361 organizations worldwide over 24 months.
result Organizations became more siloed in 2020, with decreased stability within silos.

Method analyzes large-scale network data to detect communication pattern shifts.

problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.

DBGDGM models dynamic brain graphs for better understanding brain function.

problem Previous brain graph models ignore temporal dynamics, limiting their usefulness.
method DBGDGM clusters brain regions into evolving communities and learns dynamic node embeddings.
result DBGDGM outperforms baselines in graph generation, dynamic link prediction, and graph classification.

Community-based system dynamics improves ML fairness by involving excluded stakeholders.

problem Bias in ML system development during problem formulation.
method Community-based system dynamics (CBSD) for stakeholder participation.
result CBSD facilitates deeper problem understanding and bias mitigation.

Online algorithm detects community structure in dynamic event streams.

problem Community detection in networks with temporal event streams.
method Continuous-time point process latent network models with fast online variational inference.
result Online inference achieves comparable community recovery to non-online methods but with computational gains.

We introduce a novel algorithm of community detection that maintains dynamically a community structure of a large network that evolves with time. The algorithm maximizes the modularity index thanks to the construction of a randomized hierarchical clustering based on a Monte Carlo Markov Chain (MCMC) method. Interesting…

2016-12-05abs ↗pdf ↗

We use techniques from network science to study correlations in the foreign exchange (FX) market over the period 1991--2008. We consider an FX market network in which each node represents an exchange rate and each weighted edge represents a time-dependent correlation between the rates. To provide insights into the clus…

2009-05-29abs ↗pdf ↗

Study community detection in multi-view data with various types of information.

problem Community detection in multi-view data with different types of information.
method Unified theoretical framework, mutual information analysis, sharp thresholds, iterative algorithms.
result Sharp thresholds for community recovery in various multi-view settings.

The last decade has seen great progress in both dynamic network modeling and topic modeling. This paper draws upon both areas to create a Bayesian method that allows topic discovery to inform the latent network model and the network structure to facilitate topic identification. We apply this method to the 467 top polit…

2016-10-18abs ↗pdf ↗

The paper analyzes how market prices respond to information processing and non-linear dynamics.

problem Understanding how market prices change in response to information.
method Logistic Continuous Wavelet Transformation method applied to SP 500 market data.
result Identifies patterns in market dynamics and describes them using a new theory of reflexive communication.

Most real-world networks exhibit community structure, a phenomenon characterized by existence of node clusters whose intra-edge connectivity is stronger than edge connectivities between nodes belonging to different clusters. In addition to facilitating a better understanding of network behavior, community detection fin…

2015-06-25abs ↗pdf ↗

Path signatures reveal community structure in coupled oscillators' dynamics.

problem Detecting communities in multivariate dynamical processes from time series data.
method Path signatures, a mathematical framework encoding geometric and temporal properties of continuous paths.
result Achieved exact recovery of structural communities from observed time series in multiple KSBM instances.

A new algorithm improves Bayesian federated learning by reducing communication overhead.

problem Bayesian federated learning constraints, including privacy, data ownership, and communication overhead.
method Proposes Quantised Langevin Stochastic Dynamics (QLSD) for Bayesian federated learning, using gradient compression and variance reduction techniques.
result Non-asymptotic and asymptotic convergence guarantees for QLSD and its improved versions.

This paper considers a new framework to detect communities in a graph from the observation of signals at its nodes. We model the observed signals as noisy outputs of an unknown network process, represented as a graph filter that is excited by a set of unknown low-rank inputs/excitations. Application scenarios of this m…

2018-09-05abs ↗pdf ↗

Dynamic meta-learning improves multi-agent communication with natural language.

problem Static population-based approaches struggle with adapting to human partners using natural language.
method Dynamic population-based meta-learning approach.
result Agents outperform all prior work in communicating with seen partners and humans.

We consider a variant of the stochastic multi-armed bandit problem, where multiple players simultaneously choose from the same set of arms and may collide, receiving no reward. This setting has been motivated by problems arising in cognitive radio networks, and is especially challenging under the realistic assumption t…

2015-12-09abs ↗pdf ↗

We present a scalable nonparametric Bayesian method to perform network reconstruction from observed functional behavior that at the same time infers the communities present in the network. We show that the joint reconstruction with community detection has a synergistic effect, where the edge correlations used to inform…

2019-03-26abs ↗pdf ↗

This article improves communication efficiency in distributed ML over wireless networks.

problem Achieving high ML inference accuracy at scale with zero communication latency.
method Optimizing communication payload types, techniques, scheduling, and ML architectures.
result Communication-efficient and distributed learning frameworks are presented.

FedDST trains sparse sub-networks to improve efficiency in federated learning.

problem Efficiently train large models on resource-limited edge devices with limited network bandwidth.
method Dynamic sparse training to reduce model size and communication.
result FedDST outperforms existing methods in federated learning, especially in non-i.i.d. settings.

We study the relationship between the sentiment levels of Twitter users and the evolving network structure that the users created by @-mentioning each other. We use a large dataset of tweets to which we apply three sentiment scoring algorithms, including the open source SentiStrength program. Specifically we make three…

2016-04-11abs ↗pdf ↗

Common event-triggered state estimation (ETSE) algorithms save communication in networked control systems by predicting agents' behavior, and transmitting updates only when the predictions deviate significantly. The effectiveness in reducing communication thus heavily depends on the quality of the dynamics models used …

2018-03-05abs ↗pdf ↗

Interneurons improve learning in neural networks by accelerating convergence.

problem Rapid adaptation to changing input statistics in neural networks.
method Two mathematically tractable recurrent linear neural networks were compared: one with direct recurrent connections and the other with interneurons that mediate recurrent communication.
result The network with interneurons converges more quickly than the network with direct recurrent connections, scaling logarithmically with initialization spectrum.

Community detection algorithms are fundamental tools to understand organizational principles in social networks. With the increasing power of social media platforms, when detecting communities there are two possi- ble sources of information one can use: the structure of social network and node attributes. However struc…

2016-04-12abs ↗pdf ↗

New method approximates controllability of large networks from coarse summaries.

problem Controlling large-scale linear dynamical systems with incomplete network information.
method Algorithm using stochastic block model to estimate controllability from coarse summaries.
result Average controllability of fine-scale system can be well approximated by coarse-scale system.

A novel beam training scheme optimizes multi-hop THz communications with up to 75% performance gain.

problem Optimizing beam training for multi-hop THz communications with high data rates and low time overhead.
method Developed a reinforcement learning-based hierarchical beam training scheme with dynamic training levels.
result The proposed scheme achieves up to 75% performance gain in spectral efficiency compared to conventional methods.

To understand the structural dynamics of a large-scale social, biological or technological network, it may be useful to discover behavioral roles representing the main connectivity patterns present over time. In this paper, we propose a scalable non-parametric approach to automatically learn the structural dynamics of …

2012-03-09abs ↗pdf ↗