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

245489734978 · Jun 202019922001200920172026
48 results for causal network motifs

New PEMs improve network inference from time-series data.

problem Causal inference from time-series data with trade-off between accuracy and feasibility.
method Infer networks via process motifs for lagged correlation in linear stochastic processes.
result Proposed PEMs achieve high accuracy and efficiency in network inference.

CAWs learn temporal network dynamics without node identities or edge attributes.

problem Learning temporal network dynamics without node identities or edge attributes.
method Causal Anonymous Walks (CAWs) using temporal random walks and hitting counts.
result CAW-N outperforms previous methods in predicting links over 6 real temporal networks.

Networks are a fundamental tool for modeling complex systems in a variety of domains including social and communication networks as well as biology and neuroscience. Small subgraph patterns in networks, called network motifs, are crucial to understanding the structure and function of these systems. However, the role of…

2016-12-29abs ↗pdf ↗

odeN efficiently approximates multiple temporal motifs in large networks.

problem Efficiently counting multiple temporal motifs in large temporal networks.
method odeN is a sampling-based algorithm that provides accurate probabilistic approximations of motif counts.
result odeN provides accurate approximations of motif counts in a fraction of the time needed by state-of-the-art methods.

Generative graph models create instances of graphs that mimic the properties of real-world networks. Generative models are successful at retaining pairwise associations in the underlying networks but often fail to capture higher-order connectivity patterns known as network motifs. Different types of graphs contain diff…

2019-11-08abs ↗pdf ↗

Model improves robustness of neural network sequences without transition failures.

problem Learning and generating complex sequences of motor primitives without interference.
method Inspired by thalamocortical circuit, uses specific module for motif transitions.
result Improved robustness of sequence generation with no transition failures.

New approach learns latent motifs in networks for mesoscale structure analysis.

problem Understanding large-scale behavior in complex systems through mesoscale structures.
method Network dictionary learning (NDL) combining network sampling and nonnegative matrix factorization.
result Networks can be approximated using a small set of latent motifs.

Proposes a motif-preserving Graph Neural Network for financial default prediction.

problem Weak connectivity and imbalance in motif patterns in graph-based models.
method MotifGNN with curriculum learning to capture higher-order topology structures.
result Significantly improved financial default prediction accuracy on public and industrial datasets.

KCoreMotif clusters large networks efficiently by exploiting k-core decomposition and motifs.

problem Efficiently clustering large networks for trust evaluation.
method Exploits k-core decomposition and motifs to perform motif-based spectral clustering on k-core subgraphs.
result The proposed algorithm is accurate and efficient for large networks.

A motif-based framework identifies local spillover structures in financial markets.

problem Aggregate risk spillovers obscure local interaction patterns in systemic risk.
method Develops a motif-based framework using multiscale backbones and colored motifs.
result Motif-based portfolios outperform traditional benchmarks on risk-adjusted returns.

When analyzing the genome, researchers have discovered that proteins bind to DNA based on certain patterns of the DNA sequence known as "motifs". However, it is difficult to manually construct motifs due to their complexity. Recently, externally learned memory models have proven to be effective methods for reasoning ov…

2017-02-22abs ↗pdf ↗

Networks are a fundamental model of complex systems throughout the sciences, and network datasets are typically analyzed through lower-order connectivity patterns described at the level of individual nodes and edges. However, higher-order connectivity patterns captured by small subgraphs, also called network motifs, de…

2018-02-19abs ↗pdf ↗

We study trade-based manipulation of stock prices from the perspective of complex trading networks constructed by using detailed information of trades. A stock trading network consists of nodes and directed links, where every trader is a node and a link is formed from one trader to the other if the former sells shares …

2012-12-31abs ↗pdf ↗

Improved scaffold generation for protein motifs using SE(3) flow matching.

problem Lack of structural diversity in generated scaffolds for protein motifs.
method Extended FrameFlow for motif-scaffolding with motif amortization and motif guidance.
result 2.5 times more designable and unique motif-scaffolds compared to state-of-the-art.

Researchers create exact minimal surfaces with helical motifs in biological structures.

problem Analyzing helical motifs in minimal surfaces of biological structures.
method Developed a method to construct exact minimal surfaces with arbitrary helical motifs.
result Exact minimal surfaces with helical motifs can be created and analyzed.

Behaviors of several laboratory animals can be modeled as sequences of stereotyped behaviors, or behavioral motifs. However, identifying such motifs is a challenging problem. Behaviors have a multi-scale structure: the animal can be simultaneously performing a small-scale motif and a large-scale one (e.g. \textit{chewi…

2017-07-11abs ↗pdf ↗

Temporal networks representing a stream of timestamped edges are seemingly ubiquitous in the real-world. However, the massive size and continuous nature of these networks make them fundamentally challenging to analyze and leverage for descriptive and predictive modeling tasks. In this work, we propose a general framewo…

2019-10-18abs ↗pdf ↗

In self-organizing networks, topology and dynamics coevolve in a continuous feedback, without exogenous driving. The World Trade Network (WTN) is one of the few empirically well documented examples of self-organizing networks: its topology strongly depends on the GDP of world countries, which in turn depends on the str…

2012-01-05abs ↗pdf ↗

Complex systems, such as airplanes, cars, or financial markets, produce multivariate time series data consisting of a large number of system measurements over a period of time. Such data can be interpreted as a sequence of states, where each state represents a prototype of system behavior. An important problem in this …

2018-09-06abs ↗pdf ↗

PGEL learns embeddings to diversify protein motifs while maintaining biological function.

problem Generating diverse protein structures while preserving biological function.
method Embedding learning framework that enhances motif diversity in a diffusion model's frozen denoiser.
result PGEL achieves greater structural diversity, better designability, and improved self-consistency compared to partial diffusion.

Driving behaviour has a great impact on road safety. A popular way of analysing driving behaviour is to move the focus to the manoeuvres as they give useful information about the driver who is performing them. In this paper, we investigate a new way of identifying manoeuvres from vehicle telematics data, through motif …

2020-02-10abs ↗pdf ↗

New method uses diffusion models to generate proteins with specific motifs.

problem Generating proteins with specific functional substructures (motifs) using diffusion models.
method Adapting SMC-aided diffusion posterior samplers to zero-shot scaffolding tasks.
result Proposed potentials and samplers improve performance in generating proteins with desired motifs.

New method discovers time series motifs under DTW, significantly reducing computations.

problem Discovering time series motifs under DTW is computationally challenging.
method Exact scalable method using novel lower bounds hierarchy.
result Prunes up to 99.99% of DTW computations under realistic settings.

A framework infers causal direction from symbolic sequences using compression measures.

problem Inferring causal direction from two observed discrete symbolic sequences.
method Lossless compressors for inferring context-free grammars (CFGs) and quantifying compression extent.
result Grammar inferred from one sequence better compresses the other sequence, indicating causal direction.

Paper constructs motifs from planar tilings for DP weaves and polycatenanes.

problem Creating complex entangled structures from periodic tilings.
method Combinatorial methodology using polygonal link transformations.
result Predicting the type of motif from a given tiling and polygonal link method.

The discovery of time series motifs has emerged as one of the most useful primitives in time series data mining. Researchers have shown its utility for exploratory data mining, summarization, visualization, segmentation, classification, clustering, and rule discovery. Although there has been more than a decade of exten…

2018-02-15abs ↗pdf ↗

Graph generation techniques are increasingly being adopted for drug discovery. Previous graph generation approaches have utilized relatively small molecular building blocks such as atoms or simple cycles, limiting their effectiveness to smaller molecules. Indeed, as we demonstrate, their performance degrades significan…

2020-02-08abs ↗pdf ↗

Machine learning models of music typically break up the task of composition into a chronological process, composing a piece of music in a single pass from beginning to end. On the contrary, human composers write music in a nonlinear fashion, scribbling motifs here and there, often revisiting choices previously made. In…

2019-03-18abs ↗pdf ↗