Optimizes edge coloring in graph bundling for better edge differentiation.
problem Difficulty in identifying origins and destinations of individual edges in strongly bundled graphs.
method Optimizes edge coloring based on pairwise edge strength and origin-destination dissimilarity, solving a nonlinear optimization problem.
result Peacock bundles enhance graph layout comprehensibility with edge differentiation.
Bayesian model infers strengths from noisy tennis match outcomes.
problem Ranking tennis players from match outcomes.
method Bayesian approach to infer unobserved strengths and mapping function.
result Bayesian approach robust to different model specifications.
The paper studies dynamic ranking and translation synchronization from evolving pairwise comparison graphs.
problem Dynamic pairwise comparison graphs in evolving environments.
method Proposes estimators based on smoothness-penalized least squares and projection onto low frequency eigenspace.
result Finite sample bounds for the ℓ2 estimation error, proving consistency of the proposed methods. We present atomistic molecular dynamics simulations of two Polyethylene systems where all entanglements are trapped: a perfect network, and a melt with grafted chain ends. We examine microscopically at what level topological constraints can be considered as a collective entanglement effect, as in tube model theories, o…
Improved KAN model explains brain dynamics through edge learning and synaptic strength.
problem Explaining brain dynamics and frequencies in different brain regions.
method ELKAN (Edge Learning KNN) model with edge learning and trimming, inspired by brain science.
result ELKAN model outperforms KAN in explaining brain frequencies and dynamics.
Algorithm recovers graph from Glauber dynamics trajectory without mixing.
problem Learning Gaussian graphical models from a single Glauber dynamics trajectory.
method Three components: conditional variance estimation, pairwise influence test, robust median aggregation.
result Polynomial-time recovery of conditional independence graph from a single trajectory.
Math connects quantum physics and decision-making.
problem Connecting quantum physics and decision-making models.
method Holonomy concept linking information theory and gauge theories.
result Open questions in both fields.
Method learns all edges and link parameters globally for binary pairwise Markov models.
problem Learning sparse Ising models with sparsity assumption.
method l1-regularized logistic regression for simultaneous estimation of all edges and link parameters.
result Numerical experiments show the advantage of the simultaneous estimation method.
Paper characterizes and represents pairwise causal background knowledge for improved causal inference.
problem Improving causal inference by handling pairwise causal constraints.
method Graphical characterization, direct causal clause (DCC), unified representation, MPDAG, polynomial-time algorithms.
result Pairwise causal background knowledge uniquely decomposes into MPDAG and DCCs, improving causal effect identification.
This study explores how feature graphs enhance GNNs' performance in modeling interactions.
problem Improving GNNs' ability to model feature interactions effectively.
method Investigates feature graphs and their importance in GNNs, using experiments and theoretical support.
result Edges between interacting features are crucial for GNNs, while non-interaction edges can degrade performance.
SWRLDA improves LDA for multi-class classification with edge classes.
problem LDA's vulnerability to edge classes causing biased mean and large distances.
method Self-weighted robust LDA with l21-norm distance criterion.
result SWRLDA outperforms other methods on synthetic and real-world datasets.
A method for dynamic ranking using BTL model and nearest neighbor rank centrality.
problem Aggregating evolving pairwise comparisons to recover item strengths over time.
method Adapting Rank Centrality method to handle dynamic pairwise outcomes.
result Consistency of the method in estimating latent strengths over time.
Study higher-order interactions in networks, proposing link prediction as a new benchmark.
problem Understanding higher-order interactions in complex systems.
method Temporal analysis of 19 datasets, focusing on interactions involving more than two nodes.
result Higher-order interactions are consistent across different systems, with tie strength and edge density influencing their presence.
Optimized parallel algorithms for identifying strong ties in data.
problem Identifying strong ties in data with varying distances and community sizes.
method Design and analysis of sequential and parallel algorithms for partitioned local depths.
result Optimized algorithms achieve up to 19.4x speedup in parallel execution.
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interactions among existing members are likely to occur in the near future or which existing interactions are we missing. Although this problem has b…
Develops new oracle inequalities for Gaussian ranking estimators.
problem Lack of rigorous theoretical support for Gaussian ranking estimators.
method Novel oracle inequalities for regularized pairwise ranking.
result Derives fast learning rates under general dimension assumptions.
A new method for identifying causal directions in complex systems.
problem Identifying causal relationships in nonlinear systems with limited data.
method Sequential edge orientation approach using pairwise additive noise model.
result The method can recover true causal DAGs under nonlinear additive noise models.
Best-choice edge grafting speeds up MRF structure learning.
problem Efficiently learning the structure of Markov random fields (MRFs) in a scalable manner.
method Incremental, structured approach that activates edges in groups of features.
result Significant speedup in structure learning with a controllable trade-off between speed and quality.
Optimal privacy-preserving ranking from noisy comparisons.
problem Protecting individual privacy in ranking from noisy comparisons.
method Differentially private ranking algorithms under edge and individual differential privacy.
result Achieved minimax optimal rates of convergence under privacy constraints.
A new model clusters network nodes based on relative edge weights.
problem Clustering networks ignores node capacities, leading to biased results.
method Proposes a Dirichlet stochastic block model for composition-weighted networks.
result Validated on simulated and real-world networks, showing improved clustering accuracy.
This paper investigates the strength of the trace field as a commensurability invariant of hyperbolic 3-manifolds. We construct an infinite family of two-component hyperbolic link complements which are pairwise incommensurable and have the same trace field, and infinitely many 1-cusped finite volume hyperbolic 3-manifo…
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.
Efficiently learns tree-structured Ising models with minimal samples.
problem Learning tree-structured Ising models efficiently and accurately.
method Plug-in estimator for mutual information using the Chow-Liu algorithm.
result Proper learning of tree-structured Ising models with O(nlnn/ε2) samples. Proposes Population Difference Criterion for visually observed subpopulation differences.
problem Statistical significance of visually observed subpopulation differences in high-dimensional and high-signal contexts.
method Balanced permutation approach and bootstrap confidence interval for quantifying uncertainty.
result Balanced permutation approach is more powerful in high-signal contexts.
Exact inference in structured prediction for various graphs.
problem Exact recovery of labels in structured prediction models.
method Analysis of graph structures and application of Cheeger's inequality.
result Exact recovery is possible and achievable in polynomial time for a large class of graphs.
WiFi helps align and calibrate foot-mounted IMU trajectories.
problem Inertial drift and unknown initial states in FMIP.
method Graph-based SLAM with RSS measurements for WiFi APs.
result Aligns and calibrates trajectories accurately.
New method detects edges in time-varying networks without minimum signal strength.
problem Detecting edges in time-varying, heavy-tailed, nonparanormal networks.
method Time-varying nonparanormal graphical models, high-dimensional debiasing-free moment estimator, kernel smoothed Kendall's tau correlation matrix.
result Minimax optimal rate of convergence for estimating latent inverse Pearson correlation matrix.
GNNRank uses neural networks to learn global rankings from competition match data.
problem Learning global rankings from pairwise comparisons in directed graphs.
method Proposes GNNRank, a trainable GNN-based framework with digraph embedding and new objectives.
result GNNRank achieves competitive and superior performance compared to baselines.
RECON reconstructs regulatory networks from time-course data, reducing spurious edges and preserving true regulatory edges.
problem Reconstructing regulatory networks from time-course data with minimal spurious edges and preserving true regulatory relationships.
method RECON uses an integral-based additive nonparametric ODE model with five methodological advances to reconstruct regulatory networks.
result RECON consistently outperforms existing methods, reducing spurious edges and preserving true regulatory edges across various scenarios.
EPFGNN models graph connections for better node classification.
problem Graph node classification issues due to feature aggregation.
method EPFGNN models graph as a Markov Random Field with explicit pairwise factors and a GNN backbone.
result EPFGNN improves semi-supervised node classification performance.
We extend the edge version of the classical Menger's Theorem for undirected graphs to n-dimensional simplicial complexes with chains over the field F2. The classical Menger's Theorem states that two different vertices in an undirected graph can be connected by k pairwise edge-disjoint paths if, and only…
Network geometry measures predict market instability.
problem Predicting financial market instability using network geometry.
method Discrete Ricci curvatures to capture network fragility.
result Different geometric measures distinguish normal and crash periods.
Proposes a sparse linear classifier for classification with pairwise dependencies.
problem Classification accuracy is limited by tree-structured graphical models.
method Semi-parametric approach using sparse linear combination of univariate and bivariate log-transformed densities.
result SLB classifier is competitive with popular methods.
Enhances graph comparison by incorporating edge features using Fused Gromov-Wasserstein distance.
problem Graph distances overlook edge attributes, limiting their effectiveness.
method Introduced Fused Gromov-Wasserstein distance for graph comparison with edge features. Proposed algorithms for distance and barycenter computation.
result Empirically validated the effectiveness of the novel distance in graph learning tasks.
Modeling brain connectivity networks with graph-aware inference.
problem Pooling over functional regions loses information and independence assumptions are unreliable.
method Linear mixed effects model accounting for functional regions and edge dependence.
result Interpretable results comparing schizophrenics and healthy controls.
Sparse logistic regression recovers any discrete pairwise graph model.
problem Recovering the Markov graph of discrete pairwise graphical models.
method Maximum conditional log-likelihood with convex optimization.
result The algorithm can recover any arbitrary discrete pairwise graphical model.
The report studies ranking from pairwise comparisons in graphs, achieving optimal error bounds and proposing efficient algorithms.
problem Ranking items from pairwise comparisons in general graphs and graphs with locality.
method Maximum likelihood estimation (MLE) and preconditioned gradient descent for general graphs; divide-and-conquer algorithms for graphs with locality.
result MLE achieves optimal error bounds in general graphs and identifies conditions for locality.
Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.
problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.
Graph-based regularization improves regression in highly-correlated data.
problem High-dimensional regression with highly-correlated covariates and alignment between features and coefficients.
method Form a graph from covariate correlations, use graph total variation to regularize regression coefficients.
result Graph-based regularization yields optimal mean-squared error guarantees for various covariance graph structures.
Motivated by an abstract notion of low-level edge detector filters, we propose a simple method of unsupervised feature construction based on pairwise statistics of features. In the first step, we construct neighborhoods of features by regrouping features that correlate. Then we use these subsets as filters to produce n…
Recovering edge activities from node activity data in temporal networks.
problem Recovering lost edge activity data from aggregated node activity data in temporal networks.
method Analyzing the relationship between edge activity and node activity data, using both theoretical and empirical methods to show recovery is possible and under what conditions.
result Recovery of edge activities from node activities is possible with surprising accuracy, even when network density increases.
Study compares six feature sets and three baselines for time-series classification.
problem Comparing feature sets for time-series classification tasks.
method Normalization-based approach to benchmarking, comparing 124 problems.
result Feature sets perform similarly overall, with tsfresh showing strongest performance.
New tests detect communities in dense bipartite graphs with high accuracy.
problem Detecting communities in dense bipartite graphs with high accuracy.
method Non-asymptotic upper and lower bounds, novel minimax-optimal tests, hard-thresholded nonlinear statistics.
result Non-asymptotic upper and lower bounds match for any configuration of graph sizes.
Develops methods for clustering hypergraphs with categorical edge labels.
problem Complex graph representations with multiple interaction types.
method Combinatorial objective function, polynomial-time algorithm for two types, linear programming relaxations for more types.
result Efficient algorithms for clustering hypergraphs with categorical edge labels.
GTEA learns node representations in temporal interaction graphs.
problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.
Research shows growth in Higgs field strength for certain equations.
problem Understanding behavior of Higgs field in Kapustin-Witten equations.
method Analyzes equations for connections and Higgs fields on R^4.
result Growth of Higgs field norm on large radius spheres.
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced -- characteristics almost universal to modern datasets coming from e-commerce and internet applications. We are primarily interested in score or rating-based cardinal data. From raw ranking data, we construc…
Framework uses Minimax distances for unsupervised feature extraction.
problem Extracting features from unlabeled data.
method Develops a framework for computing Minimax distances and embedding them into a vector space.
result Minimax distances effectively capture underlying patterns and structures in data.