In Stochastic blockmodels, which are among the most prominent statistical models for cluster analysis of complex networks, clusters are defined as groups of nodes with statistically similar link probabilities within and between groups. A recent extension by Karrer and Newman incorporates a node degree correction to mod…
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
48 results for “degree heterogeneity”
Unified spectral clustering for sparse networks with heterogeneous degrees.
problem Efficiently detecting communities in sparse networks with varying degrees.
method Developed a parametrized regularized Laplacian matrix for spectral clustering.
result Improved parametrization accounts for network heterogeneity and community hardness.
Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodelstat.ML
New spectral clustering method for graphs with uneven node degrees.
problem Challenges in community detection for graphs with heterogeneous degree distributions.
method Spectral clustering on spherical coordinates with degree correction.
result Improved performance in representing computer networks.
Ensemble methods have been widely used for improving the results of the best single classificationmodel. A large body of works have achieved better performance mainly by applying one specific ensemble method. However, very few works have explored complex fusion schemes using het-erogeneous ensembles with new aggregatio…
Study shows neural ODEs generalize well on synthetic graphs but struggle with degree heterogeneity and clustering.
problem Understanding neural ODEs on complex networks, especially with varying graph sizes and structures.
method Synthetic data from five dynamical systems on graphs, using Barabási-Barzel form vector fields.
result Degree heterogeneity and dynamical system type are primary factors affecting neural ODEs' generalization.
We consider a model of contagion in financial networks recently introduced in the literature, and we characterize the effect of a few features empirically observed in real networks on the stability of the system. Notably, we consider the effect of heterogeneous degree distributions, heterogeneous balance sheet size and…
The paper corrects for node degree in spectral clustering using random walk Laplacian.
problem Node degree heterogeneity in spectral clustering.
method Graph spectral embedding using the random walk Laplacian.
result The embedding provides uniformly consistent estimates of degree-corrected latent positions.
The noisy voter model on complex networksphysics.soc-ph
We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogen…
The paper proposes a new model to analyze directed networks and accurately estimate community memberships.
problem Modeling and estimating community memberships in directed networks with heterogeneous degrees.
method Directed Degree Corrected Mixed Membership (DiDCMM) model and DiMSC algorithm.
result The proposed DiMSC algorithm is asymptotically consistent and provides error bounds for community membership vectors.
Spectral clustering is one of the most popular, yet still incompletely understood, methods for community detection on graphs. This article studies spectral clustering based on the Bethe-Hessian matrix for sparse heterogeneous graphs (following the degree-corrected stochastic block model) in a …
Develops a new tensor model for clustering with degree correction.
problem Clustering with unknown degree heterogeneity in multiway data.
method Degree-corrected tensor block model with estimation guarantees.
result Demonstrates an intrinsic statistical-to-computational gap for tensors of order three or greater.
Improves community detection in directed networks with theoretical guarantees.
problem Degree heterogeneity affects community detection in directed networks.
method Introduced D-SCORE algorithm and established theoretical guarantees for Directed-DCBM.
result Established theoretical guarantees and provided improvements for D-SCORE.
The paper studies inference in hypergraph β-models with multiple layers.
problem Estimating and testing in hypergraph β-models with degree heterogeneity.
method Maximum likelihood estimation and likelihood ratio test for hypergraph β-models with multiple layers.
result The ML estimate and LR test are optimally powerful under the null hypothesis.
Empirical networks are often globally sparse, with a small average number of connections per node, when compared to the total size of the network. However, this sparsity tends not to be homogeneous, and networks can also be locally dense, for example with a few nodes connecting to a large fraction of the rest of the ne…
We consider community detection in Degree-Corrected Stochastic Block Models (DC-SBM). We propose a spectral clustering algorithm based on a suitably normalized adjacency matrix. We show that this algorithm consistently recovers the block-membership of all but a vanishing fraction of nodes, in the regime where the lowes…
Modelling sparsity, heterogeneity, reciprocity and community structure in temporal interaction datastat.ML
We propose a novel class of network models for temporal dyadic interaction data. Our goal is to capture a number of important features often observed in social interactions: sparsity, degree heterogeneity, community structure and reciprocity. We propose a family of models based on self-exciting Hawkes point processes i…
Study shows data heterogeneity affects distributed learning's generalization error.
problem Effect of data heterogeneity on distributed learning performance.
method Established bounds on generalization error using information-theoretic rate-distortion theory.
result Data heterogeneity improves generalization error for distributed learning.
Change detection in dynamic networks is an important problem in many areas, such as fraud detection, cyber intrusion detection and health care monitoring. It is a challenging problem because it involves a time sequence of graphs, each of which is usually very large and sparse with heterogeneous vertex degrees, resultin…
For the degree corrected stochastic block model in the presence of arbitrary or even adversarial outliers, we develop a convex-optimization-based clustering algorithm that includes a penalization term depending on the positive deviation of a node from the expected number of edges to other inliers. We prove that under m…
We study the misclassification error for community detection in general heterogeneous stochastic block models (SBM) with noisy or partial label information. We establish a connection between the misclassification rate and the notion of minimum energy on the local neighborhood of the SBM. We develop an optimally weighte…
Contagion in an interacting economyphysics.soc-ph
We investigate the credit risk model defined in Hatchett & Kühn under more general assumptions, in particular using a general degree distribution for sparse graphs. Expanding upon earlier results, we show that the model is exactly solvable in the limit and demonstrate that the exact solution is de…
LATTE tackles heterogeneous network embedding challenges with layer-stacked attention.
problem Aggregating higher-order indirect relations in heterogeneous networks.
method Layer-stacked ATTention Embedding (LATTE) that decomposes meta relations at each layer.
result LATTE achieves state-of-the-art performance on benchmark datasets.
Spectral clustering is a fast and popular algorithm for finding clusters in networks. Recently, Chaudhuri et al. (2012) and Amini et al.(2012) proposed inspired variations on the algorithm that artificially inflate the node degrees for improved statistical performance. The current paper extends the previous statistical…
New algorithm detects community labels in networks using unlabeled data.
problem Detect community labels in networks with partially labeled data.
method Proposes an algorithm using structural similarity metrics.
result Theoretical guarantees for misclassification error.
A network may have weak signals and severe degree heterogeneity, and may be very sparse in one occurrence but very dense in another. SCORE (Jin, 2015) is a recent approach to network community detection. It accommodates severe degree heterogeneity and is adaptive to different levels of sparsity, but its performance for…
Community detection was a hot topic on network analysis, where the main aim is to perform unsupervised learning or clustering in networks. Recently, semi-supervised learning has received increasing attention among researchers. In this paper, we propose a new algorithm, called weighted inverse Laplacian (WIL), for predi…
In this paper, we present a multi-period trading model by assuming that traders face not only asymmetric information but also heterogenous prior beliefs, under the requirement that the insider publicly disclose his stock trades after the fact. We show that there is an equilibrium in which the irrational insider camoufl…
Privacy utility trade offs for parameter estimation in degree heterogeneous higher order networksstat.ML
Study privacy vs. utility in estimating network parameters with aggregated data.
problem Privacy-preserving estimation of network parameters from aggregated node degrees.
method β model, local and central differential privacy, minimax lower bounds, simple estimators.
result Achieved minimax-optimal risk bounds for parameter estimation under privacy constraints.
Polynomial-time test for detecting dense subgraphs in heterogeneous networks.
problem Detecting a planted community in heterogeneous networks.
method Proposes a polynomial-time test with a standard normal distribution null limiting distribution.
result The test is efficient and performs well in both simulations and real data.
The stochastic block model (SBM) is a popular framework for studying community detection in networks. This model is limited by the assumption that all nodes in the same community are statistically equivalent and have equal expected degrees. The degree-corrected stochastic block model (DCSBM) is a natural extension of S…
The paper introduces heterogeneous manifolds for better graph embeddings.
problem Graph embeddings in Euclidean spaces often fail to capture the curvature of real-world graphs.
method The authors propose heterogeneous rotationally-symmetric manifolds with a radial dimension to account for varying curvature.
result The method improves graph embeddings by better preserving high-order structures and heterogeneous random graphs.
We present an analysis of the price impact associated with trades effected by different financial firms. Using data from the Spanish Stock Market, we find a high degree of heterogeneity across different market members, both in the instantaneous impact functions and in the time-dependent market response to trades by ind…
Estimating heterogeneous survival treatment effect in observational data using machine learningstat.AP
Study improves machine learning for estimating survival treatment effects.
problem Estimating heterogeneous survival treatment effects in observational data.
method Flexible machine learning methods in the counterfactual framework, including AFT-BART-NP.
result AFT-BART-NP consistently yields best performance in terms of bias, precision, and frequentist coverage.
We consider a model of financial contagion in a bipartite network of assets and banks recently introduced in the literature, and we study the effect of power law distributions of degree and balance-sheet size on the stability of the system. Relative to the benchmark case of banks with homogeneous degrees and balance-sh…
Combines historical and market data for better portfolio selection.
problem Improving portfolio selection through diverse information integration.
method Bayesian learning via Gaussian mixture model to harmonize historical and market data.
result The method enhances forecasting accuracy and robustness across various capital markets.
This work optimizes mean estimation under varying privacy constraints.
problem Mean estimation with heterogeneous privacy constraints.
method Proposes an algorithm for mean estimation under different privacy levels for users.
result Shows a saturation phenomenon in performance as privacy levels are relaxed.
This paper characterizes and explains the disagreement between two graph embedding methods.
problem Understanding why two popular graph embedding methods produce different results.
method End-to-end analysis of ASE-LSE latent subspaces, proving conditions for agreement and disagreement.
result No maximal-disagreement graph exists; disagreement is strictly below its theoretical ceiling.
Our main task is to study the effect of corporate governance on the market liquidity of listed companies' stocks. We establish a theoretical model that contains the heterogeneity of investors' beliefs to explain the mechanisms by which corporate governance improves liquidity of the corporate stocks. In this process we …
New method improves community detection for large networks.
problem Inefficient community detection for large sparse networks.
method Decouples row and column labels in likelihood function for fast alternating maximization.
result Strongly consistent estimates of communities with provable convergence guarantee.
Jointly Modeling Heterogeneous Student Behaviors and Interactions Among Multiple Prediction Taskscs.LG
Modeling student behaviors and multiple predictions for early intervention.
problem Predicting student outcomes and interactions among multiple tasks.
method Proposes a variant of LSTM and soft-attention mechanism for heterogeneous behaviors, and co-attention mechanism for task interactions.
result Demonstrated effectiveness in predicting student outcomes and interactions.
Model dynamic customer sensitivities across categories.
problem Dynamic heterogeneity in customer sensitivities to marketing elements.
method Hierarchical dynamic factor model with Bayesian nonparametric Gaussian processes.
result Dynamic heterogeneity can be explained by a few global trends.
Develops a sparsity-inducing Bayesian Causal Forest for estimating heterogeneous treatment effects.
problem Estimating heterogeneous treatment effects using observational data with varying degrees of sparsity.
method Introduces a sparsity-inducing version of Bayesian Causal Forests with additional priors to adjust covariate weights.
result Improves adaptability to sparse data generating processes and uncovering moderating factors driving heterogeneity.
The paper argues for using more degrees of freedom in empirical financial analysis to improve conclusions.
problem Improving trustworthiness of financial analysis conclusions.
method Using more degrees of freedom and forking paths in multiple testing.
result Forking paths raises the bar for significance in multiple testing.
Paper characterizes optimal graph clustering limits under a new model.
problem Graph clustering under varying edge density signals.
method Introduced Popularity-Adjusted Block Model (PABM) to address SBM and DCBM limitations.
result Cluster recovery possible even when edge density signals vanish, highlighting local connectivity differences.
We model the default contagion process in a large heterogeneous financial network under the interventions of a regulator (a central bank) with only partial information which is a more realistic setting than most current literature. We provide the analytical results for the asymptotic optimal intervention policies and t…
Interactive news recommendation has been launched and attracted much attention recently. In this scenario, user's behavior evolves from single click behavior to multiple behaviors including like, comment, share etc. However, most of the existing methods still use single click behavior as the unique criterion of judging…
New algorithm tackles multi-agent bandits with heavy-tailed data.
problem Maximizing system performance in multi-agent settings with heavy-tailed data.
method Algorithm exploits hub-like structures and synchronization among clients.
result Regret bound of for homogeneous settings, for heterogeneous.
The paper models social networks with varying levels of reciprocity.
problem Understanding diverse reciprocal behavior in social networks.
method Developed a preferential attachment model with heterogeneous reciprocity.
result Captures the heavy-tailed nature of empirical degree distributions and identifies multiple user groups.