The majority of real-world networks are dynamic and extremely large (e.g., Internet Traffic, Twitter, Facebook, ...). To understand the structural behavior of nodes in these large dynamic networks, it may be necessary to model the dynamics of behavioral roles representing the main connectivity patterns over time. In th…
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,695 papers · 148 categories
Trend · papers per month
48 results for “node behavior”
New method embeds dynamic networks with stability for node behavior.
problem Embed time-evolving node representations with stability.
method Unfolded adjacency spectral embedding for dynamic networks.
result Method satisfies cross-sectional and longitudinal stability.
Improved NODEs for long-term time series forecasting.
problem Dealing with complex, multi-frequency data.
method Progressive learning paradigm with curriculum learning.
result Performance improved by over 64%.
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 …
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…
Graph Posterior Network improves uncertainty estimation for node classification in interdependent graphs.
problem Uncertainty quantification for non-independent node-level predictions in graphs.
method Derives axioms for expected predictive uncertainty, proposes Graph Posterior Network (GPN) which performs Bayesian posterior updates.
result GPN outperforms existing approaches for uncertainty estimation in semi-supervised node classification.
Low-dimensional embeddings of knowledge graphs and behavior graphs have proved remarkably powerful in varieties of tasks, from predicting unobserved edges between entities to content recommendation. The two types of graphs can contain distinct and complementary information for the same entities/nodes. However, previous…
BehavDT: A Behavioral Decision Tree Learning to Build User-Centric Context-Aware Predictive Modelcs.LG
This paper formulates the problem of building a context-aware predictive model based on user diverse behavioral activities with smartphones. In the area of machine learning and data science, a tree-like model as that of decision tree is considered as one of the most popular classification techniques, which can be used …
We study the problem of identifying different behaviors occurring in different parts of a large heterogenous network. We zoom in to the network using lenses of different sizes to capture the local structure of the network. These network signatures are then weighted to provide a set of predicted labels for every node. W…
Analyzing the temporal behavior of nodes in time-varying graphs is useful for many applications such as targeted advertising, community evolution and outlier detection. In this paper, we present a novel approach, STWalk, for learning trajectory representations of nodes in temporal graphs. The proposed framework makes u…
In-network distributed estimation of sparse parameter vectors via diffusion LMS strategies has been studied and investigated in recent years. In all the existing works, some convex regularization approach has been used at each node of the network in order to achieve an overall network performance superior to that of th…
In order to model volatile real-world network behavior, we analyze phase-flipping dynamical scale-free network in which nodes and links fail and recover. We investigate how stochasticity in a parameter governing the recovery process affects phase-flipping dynamics, and find the probability that no more than q% of nodes…
Study Bergman kernel metrics on degenerating hyperelliptic surfaces.
problem Asymptotic behavior of Bergman kernels near singularities.
method Taylor expansion for Abelian differentials and period matrices.
result Explicit coefficients in asymptotic formulas for Bergman kernels.
Given a hyperbolic surface and a simple closed geodesic on it, complex-twists along the curve produce a holomorphic family of deformations in Teichmüller space, degenerating to the Riemann surface where it is pinched. We show there is a corresponding Teichmüller disk such that the two are strongly asymptotic, in the Te…
GGP models multivariate time series with latent sub-sequences for diverse behaviors.
problem Modeling multivariate time series with diverse behaviors and patterns.
method Graph Gamma Process (GGP) linear dynamical systems with latent sub-sequences.
result GGP models exhibit good predictive performance and reveal interpretable latent patterns.
Many optimization, inference and learning tasks can be accomplished efficiently by means of decentralized processing algorithms where the network topology (i.e., the graph) plays a critical role in enabling the interactions among neighboring nodes. There is a large body of literature examining the effect of the graph s…
In many graphs such as social networks, nodes have associated attributes representing their behavior. Predicting node attributes in such graphs is an important problem with applications in many domains like recommendation systems, privacy preservation, and targeted advertisement. Attributes values can be predicted by a…
This paper learns graph node representations using global context prediction.
problem Efficiently learning useful node representations from unlabeled graph data.
method Randomly selects node pairs, trains a neural net to predict contextual positions.
result Our approach outperforms many unsupervised methods and sometimes supervised ones.
New algorithms cluster nodes in SBM graphs faster and more accurately.
problem Efficiently clustering nodes in graphs generated from SBM models.
method Inspired by Lloyd's algorithm, proposes model-free clustering methods for SBM graphs.
result Consistent estimation of node clusters and parameters in SBM graphs.
We propose a dynamic network model where two mechanisms control the probability of a link between two nodes: (i) the existence or absence of this link in the past, and (ii) node-specific latent variables (dynamic fitnesses) describing the propensity of each node to create links. Assuming a Markov dynamics for both mech…
A new algorithm for decentralized optimization over directed graphs.
problem Decentralized stochastic optimization over directed networks.
method Gradient tracking and S-ADDOPT algorithm with constant and decaying step-sizes.
result S-ADDOPT converges linearly with constant step-size and sublinearly with decaying step-size.
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is considered unrealistic in observed graphs. We define a notion of edge exchangeability …
Bayesian Optimization for graph node subset functions.
problem Optimizing functions over node subsets in graphs.
method Bayesian Optimization framework for combinatorial optimization on graphs.
result Effectiveness of the proposed BO framework on various graph types and tasks.
Manipulation is an important issue for both developed and emerging stock markets. For the study of manipulation, it is critical to analyze investor behavior in the stock market. In this paper, an analysis of the full transaction records of over a hundred stocks in a one-year period is conducted. For each stock, a tradi…
Detects malicious accounts in permissionless blockchains using graph properties and ML.
problem Identifying and classifying malicious accounts in permissionless blockchains.
method Temporal graph properties, ML algorithms (ExtraTreesClassifier, K-Means), cosine similarity, behavior change analysis.
result ExtraTreesClassifier performs best in detecting malicious accounts on Ethereum blockchain.
It is well known that the problem of vanishing/exploding gradients is a challenge when training deep networks. In this paper, we describe another phenomenon, called vanishing nodes, that also increases the difficulty of training deep neural networks. As the depth of a neural network increases, the network's hidden node…
The Social Internet of Things (SIoT), integration of the Internet of Things and Social Networks paradigms, has been introduced to build a network of smart nodes that are capable of establishing social links. In order to deal with misbehaving service provider nodes, service requestor nodes must evaluate their trustworth…
We study, to the best of our knowledge, the first Bayesian algorithm for unimodal Multi-Armed Bandit (MAB) problems with graph structure. In this setting, each arm corresponds to a node of a graph and each edge provides a relationship, unknown to the learner, between two nodes in terms of expected reward. Furthermore, …
Comparing the collective behavior of banking industryphysics.soc-ph
The study examines collective behavior in banking sectors across mature and emerging markets.
problem Understanding collective behavior in banking sectors across different market types.
method Applied Random Matrix Theory (RMT) to analyze the banking sectors of 4 world stock markets.
result Mature markets exhibit higher collective behavior compared to emerging markets.
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.
Graph-based LRE estimates likelihood-ratios collaboratively for nodes.
problem Comparing unknown pdfs at graph nodes with graph structure.
method Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF).
result Collaborative estimation improves performance compared to independent methods.
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement, or spread, through a network interpolating between a random-walk and a shortest-path behavior [30, 42, 49]. The framework assumes a unit f…
Transductive Generalization via Optimal Transport and Its Application to Graph Node Classificationcs.LG
New bounds improve graph node classification using optimal transport.
problem Improving transductive generalization bounds for graph node classification.
method Representation-based generalization bounds via optimal transport, expressed in terms of Wasserstein distances.
result Strong correlation between derived bounds and empirical generalization in graph node classification.
GNNs improve semi-supervised node regression, but why? We explain.
problem Understanding when and why GNNs succeed in semi-supervised node regression.
method Aggregate-and-readout model encompassing message passing architectures, least-squares estimation over GNNs with linear graph convolutions and a deep ReLU readout.
result Sharp non-asymptotic risk bound separating approximation, stochastic, and optimization errors.
ProxSkip achieves linear speedup in distributed non-convex optimization.
problem Achieving linear speedup in distributed non-convex optimization.
method Unified convergence analysis for stochastic non-convex, convex, and strongly convex problems.
result ProxSkip achieves linear speedup in the number of nodes under stochastic gradients.
Data collection often involves the partial measurement of a larger system. A common example arises in collecting network data: we often obtain network datasets by recording all of the interactions among a small set of core nodes, so that we end up with a measurement of the network consisting of these core nodes along w…
Dealing with the shear size and complexity of today's massive data sets requires computational platforms that can analyze data in a parallelized and distributed fashion. A major bottleneck that arises in such modern distributed computing environments is that some of the worker nodes may run slow. These nodes a.k.a.~str…
On the topologic structure of economic complex networks: Empirical evidence from large scale payment network of Estoniaphysics.soc-ph
This paper presents the first topological analysis of the economic structure of an entire country based on payments data obtained from Swedbank. This data set is exclusive in its kind because around 80% of Estonia's bank transactions are done through Swedbank, hence, the economic structure of the country can be reconst…
DE-SGD shows heavy-tailed behavior in decentralized settings.
problem Heavy-tailed behavior in decentralized SGD.
method Analyzes the emergence of heavy-tails in DE-SGD, considering both quadratic and twice continuously differentiable strongly convex loss functions.
result DE-SGD exhibits heavier tails than centralized SGD, and tail behavior depends on network parameters.
Analytical solution for a class of network dynamics with mechanical and financial applicationscond-mat.stat-mech
We show that for a certain class of dynamics at the nodes the response of a network of any topology to arbitrary inputs is defined in a simple way by its response to a monotone input. The nodes may have either a discrete or continuous set of states and there is no limit on the complexity of the network. The results pro…
This work examines the problem of graph learning over a diffusion network when data can be collected from a limited portion of the network (partial observability). The main question is to establish technical guarantees of consistent recovery of the subgraph of probed network nodes, i) despite the presence of unobserved…
Study XRP network, propose Flow Index to analyze transaction frequencies.
problem Analyze transaction frequencies in XRP network.
method Analyze XRP transaction history, propose Flow Index.
result Flow Index reveals bow-tie/walnut structure in XRP network.
Community detection is considered as a fundamental task in analyzing social networks. Even though many techniques have been proposed for community detection, most of them are based exclusively on the connectivity structures. However, there are node features in real networks, such as gender types in social networks, fee…
Graph Neural Networks (graph NNs) are a promising deep learning approach for analyzing graph-structured data. However, it is known that they do not improve (or sometimes worsen) their predictive performance as we pile up many layers and add non-lineality. To tackle this problem, we investigate the expressive power of g…
We study distributed stochastic convex optimization under the delayed gradient model where the server nodes perform parameter updates, while the worker nodes compute stochastic gradients. We discuss, analyze, and experiment with a setup motivated by the behavior of real-world distributed computation networks, where the…
Deep QMC ansatzes improve variational QMC accuracy.
problem Improving variational QMC accuracy with neural network ansatzes.
method Analysis of deep neural network ansatzes PauliNet and FermiNet convergence to fixed-node limit.
result Deep QMC ansatzes can reach fixed-node limit with large network sizes.
Graph Attention Networks (GATs) are the state-of-the-art neural architecture for representation learning with graphs. GATs learn attention functions that assign weights to nodes so that different nodes have different influences in the feature aggregation steps. In practice, however, induced attention functions are pron…
Proposes GNAN model for detecting various network structures.
problem Detecting traditional communities in networks.
method GNAN model combining topology and node-attribute information.
result GNAN detects a broader range of network structures.