Transfer entropy analyzes interactions between network communities, including rare events.
problem Understanding information flows between network communities.
method Transfer entropy analysis, including Rényi transfer entropy for rare events.
result Transfer entropy provides a coherent description of community interactions, including non-linear interactions.
Novel network models capture social interaction features like reciprocity and community.
problem Modeling temporal social interaction data with reciprocity and community structure.
method Self-exciting Hawkes point processes with conditional intensity function.
result Proposed model outperforms competing approaches for link prediction.
Proposes a new model to capture interaction modalities in networks.
problem Limited information in binary network representations of interactions.
method Topic Blockmodel using a count-based topic model.
result Better extraction of information from interaction networks.
Actors in realistic social networks play not one but a number of diverse roles depending on whom they interact with, and a large number of such role-specific interactions collectively determine social communities and their organizations. Methods for analyzing social networks should capture these multi-faceted role-spec…
A framework infers hyperedges and overlapping communities in hypergraphs.
problem Characterizing the structural organization of hypergraphs with higher-order interactions.
method Statistical inference to infer missing hyperedges and detect overlapping communities.
result Efficient numerical implementation and strong performance on real-world systems.
New method combines hypergraph structure and node attributes for better community detection.
problem Improving community detection in hypergraphs with node attributes.
method Developed a principled model that learns from data to combine higher-order interactions and node attributes.
result Strong performance in hyperedge prediction and community detection, especially when attributes are informative.
Mathematical framework for cooperative communication explains belief transmission.
problem Lack of understanding why cooperation enables effective belief transmission.
method Connection to optimal transport theory, deriving prior models, statistical interpretations, proofs of robustness and instability.
result Cooperative communication provably enables effective, robust belief transmission.
Improved PAC guarantees for multi-agent reinforcement learning with noisy communication.
problem Improving exploration in cooperative multi-agent reinforcement learning with communication constraints.
method Develops PAC guarantees for multiple concurrent MDPs with noisy and resource-limited communication.
result Theoretical and empirical improvements in sample complexity for information fusion.
We introduce Bayesian Poisson Tucker decomposition (BPTD) for modeling country--country interaction event data. These data consist of interaction events of the form "country i took action a toward country j at time t." BPTD discovers overlapping country--community memberships, including the number of latent com…
Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore t…
New method detects communities in hypergraphs by embedding them into a vector space.
problem Detecting communities in hypergraphs with multi-way interactions.
method Augmenting non-uniform hypergraphs, embedding into a vector space, using an alternative updating scheme.
result Asymptotic consistencies in community detection and hypergraph estimation established.
Generative model reveals hidden interaction preferences in networks.
problem Separate analysis of community and hierarchy overlooks real-world network complexities.
method Generative model based on node preferences and hierarchical structures exploiting network sparsity.
result Model accurately identifies overall node preferences and discerns subsets with different behaviors.
Model identifies credible news and trustworthy citizen journalists in online communities.
problem Identifying credible news and trustworthy citizen journalists in online communities.
method Probabilistic graphical model that leverages interactions between users, news, and sources.
result Identifies credible news articles, trustworthy news sources, and expert users.
Framework uncovers symmetric and asymmetric species associations from data.
problem Retrieving bidirectional species associations from co-occurrence data.
method Machine learning framework modeling latent embeddings and joint generative model.
result Framework successfully recovers known symmetric and asymmetric associations.
Proves exponential sample complexity separations in local differential privacy.
problem Sample complexity in locally private protocols.
method Connection between communication complexity and sample complexity, using specific lower bounds for two problems.
result Exponential separations between differentially private protocols.
A hierarchical gamma process infinite edge partition model is proposed to factorize the binary adjacency matrix of an unweighted undirected relational network under a Bernoulli-Poisson link. The model describes both homophily and stochastic equivalence, and is scalable to big sparse networks by focusing its computation…
Paper tackles low sample and communication complexities in decentralized bilevel optimization.
problem Decentralized bilevel optimization problems with limited computation and communication capabilities.
method Proposes INTERACT and SVR-INTERACT algorithms to achieve low sample and communication complexities.
result Achieves both low sample and communication complexities for solving decentralized bilevel optimization problems.
Study characterizes community structure in Japanese production network.
problem Characterize community structure in a large-scale production network.
method Directed network analysis of one million Japanese firms.
result Large fraction of firms have local interactions, and community strengths are heterogeneous.
A study on the communication complexity of estimating correlations between variables.
problem Estimating the correlation between two sets of correlated random variables with limited communication.
method One-way interactive protocol exchanging k bits, optimizing over interaction protocol and estimator.
result Achieves optimal performance with communication complexity of 1/k, improving over naive schemes.
Adversarial perturbations and RIS interaction vectors improve covert communication.
problem Covert communication in the presence of RISs.
method Designing RIS interaction vectors to balance receiver and eavesdropper detection, adding adversarial perturbations to signals.
result Adversarial perturbations and RIS interaction vectors can be jointly designed to boost covert communications.
Unified framework for hyperbolic network embedding considering multiplex interactions.
problem Misleading results from ignoring multiplex interactions in real-world networks.
method Combines multiplex network hyperbolic embedding and community detection using random walk.
result Effective and efficient node embedding across multiplex channels compared to state-of-the-art.
New model captures sparse, evolving multigraph structures.
problem Understanding sparse, evolving multigraph structures in dynamic interaction data.
method Dynamic nonparametric Bayesian model combining sparsity and clustering.
result Improved held-out likelihood and predictive performance.
The paper tests for association between latent community memberships in multi-view network data.
problem Evaluating the independence of latent community memberships in multi-view network data.
method Extended stochastic block model for two-view network data, developed a new hypothesis test.
result Evidence of weak association between latent community memberships in binary interaction and co-complex association data.
Shared workspace improves neural module coordination in deep learning.
problem Pairwise interactions in deep learning models lack global coordination.
method Introduce a shared global workspace with bandwidth limitations among neural modules.
result Capacity limitations encourage specialization and synchronization.
This paper studies the trading volumes and wealth distribution of a novel agent-based model of an artificial financial market. In this model, heterogeneous agents, behaving according to the Von Neumann and Morgenstern utility theory, may mutually interact. A Tobin-like tax (TT) on successful investments and a flat tax …
In evolving complex systems such as air traffic and social organizations, collective effects emerge from their many components' dynamic interactions. While the dynamic interactions can be represented by temporal networks with nodes and links that change over time, they remain highly complex. It is therefore often neces…
This paper discusses the role of risk communication in macroprudential oversight and of visualization in risk communication. Beyond the soar in data availability and precision, the transition from firm-centric to system-wide supervision imposes vast data needs. Moreover, except for internal communication as in any orga…
Paper sets fundamental limits for distributed covariance estimation with constrained communication.
problem Estimating high-dimensional covariance matrices in a feature-split setting with limited communication.
method Developed a Conditional Strong Data Processing Inequality (C-SDPI) to establish minimax lower bounds and an optimal estimation protocol.
result Achieved nearly optimal estimation protocol with sample and communication requirements matching lower bounds up to logarithmic factors.
Paper studies collaboration in multi-armed bandits with limited interaction.
problem Identifying the best arm collaboratively with limited communication.
method Developed techniques to quantify and prove round-speedup tradeoffs.
result Almost tight round-speedup tradeoffs for distributed exploration.
Paper proposes MLPCD for protein community detection in large PPI networks.
problem Identifying reliable protein communities from large-scale PPI networks.
method Integrates Gene Expression Data and uses Multi-source Learning with cloud computing.
result Demonstrates superior performance compared to existing methods.
Bayesian method detects mesoscale structures in pathway data networks.
problem Mesoscale structures in pathway data networks are hard to detect due to dependencies between interactions.
method Bayesian approach modeling optimal partitioning and higher-order dynamics.
result Method can recover both proximity-based and role-based groupings of nodes.
A fuzzy recommender system using PageRank for community detection.
problem Improving recommendation systems for large user communities.
method Fuzzy community detection using personalized PageRank.
result The method outperforms recent recommender systems on MovieLens and FilmTrust datasets.
With the network methods and random matrix theory, we investigate the interaction structure of communities in financial markets. In particular, based on the random matrix decomposition, we clarify that the local interactions between the business sectors (subsectors) are mainly contained in the sector mode. In the secto…
Game aims to improve social interactions for teenagers with ASD.
problem Improving social interactions for teenagers with ASD.
method Presentation of game structure, skeleton detection, and imitation learning methods.
result Game structure and support tools for skeleton detection and imitation learning presented.
Proposes CCCVAE for better single-cell clustering with cell-cell communication.
problem Improving single-cell RNA sequencing clustering by incorporating cell-cell communication.
method Integrates cell-cell communication into a variational autoencoder framework.
result Empirical results show CCCVAE outperforms standard VAEs in clustering performance.
We propose dynamical systems trees (DSTs) as a flexible class of models for describing multiple processes that interact via a hierarchy of aggregating parent chains. DSTs extend Kalman filters, hidden Markov models and nonlinear dynamical systems to an interactive group scenario. Various individual processes interact a…
A crowdsourcing framework improves communication efficiency in federated learning.
problem Improving communication efficiency in federated learning with uncoordinated clients.
method Formulated a utility maximization problem and proposed a crowdsourcing framework.
result Simulated results show up to 22% gain in offered reward.
Perfect clustering achieved in hypergraphs with enough interactions.
problem Complexity and lack of tractable models for analyzing hypergraphs.
method Introduced an interaction hypergraph model for analyzing hypergraphs, defined latent embeddings, and analyzed spectral estimators.
result A spectral estimate of interaction latent positions can achieve perfect clustering with enough interactions.
This paper proposes a web-based visual graph analytics platform for interactive graph mining, visualization, and real-time exploration of networks. GraphVis is fast, intuitive, and flexible, combining interactive visualizations with analytic techniques to reveal important patterns and insights for sense making, reasoni…
We develop a class of rules spanning the range between quadratic discriminant analysis and naive Bayes, through a path of sparse graphical models. A group lasso penalty is used to introduce shrinkage and encourage a similar pattern of sparsity across precision matrices. It gives sparse estimates of interactions and pro…
VEC-SBM detects communities using side information like texts and images.
problem Community detection in social networks with side information.
method Proposes a novel algorithm based on iterative refinement techniques.
result Optimally recovers latent communities with side information.
In this paper we propose network methodology to infer prognostic cancer biomarkers based on the epigenetic pattern DNA methylation. Epigenetic processes such as DNA methylation reflect environmental risk factors, and are increasingly recognised for their fundamental role in diseases such as cancer. DNA methylation is a…
New method detects overlapping communities in weighted graphs without pure nodes assumption.
problem Detect overlapping communities in weighted graphs without making pure nodes assumption.
method Convex optimization-based approach for weighted graphs.
result Success on artificial and real-world datasets.
Study shows sockpuppets in online discussions differ from regular users in posting behavior and social networks.
problem Undesired behavior by sockpuppets in online discussion communities.
method Analysis of nine discussion communities, focusing on posting behavior, linguistic traits, and social network structure.
result Sockpuppets tend to start fewer discussions, write shorter posts, use more personal pronouns, and have more clustered ego-networks.
This paper presents a novel study on gas-like models for economic systems. The interacting agents and the amount of exchanged money at each trade are selected with different levels of randomness, from a purely random way to a more chaotic one. Depending on the interaction rules, these statistical models can present dif…
Locally private learning without interaction is shown to be harder for certain classes of functions.
problem Locally private learning without interaction is challenging for certain classes of functions.
method Margin complexity of a class of Boolean functions is used as a lower bound for non-interactive LDP learning.
result Classes of linear separators and decision lists require exponential number of samples to learn non-interactively.
Paper addresses ERM in non-interactive local differential privacy, reducing sample complexity in high dimensions.
problem Empirical Risk Minimization in non-interactive local differential privacy with high dimensionality.
method Polynomial approximation for constant or low dimensionality, 1-bit communication for high dimensionality.
result Achieves error bounds independent of dimensionality for constant or low dimensionality, dependent on Gaussian width for high dimensionality.
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.