Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.13280

Extracting Illicit-Rich Subgraph from Transaction Networks via Feed-Guided Shortest Paths

Doniyor Koshimbetov·E. Şule Yazıcı·Asha Rao
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study investigative subgraph extraction for Anti-Money Laundering (AML) transaction graphs using the Shortest Paths Network Search Algorithm (SPNSA), which aggregates shortest paths among a small input feed of entities. Since SPNSA is highly sensitive to the feed choice, we evaluate several graph-only feed selection strategies and propose a motif-based coherent feed selection method. Experiments on the IBM-AML benchmark (HI-Small, LI-Small, HI-Medium) and the Elliptic Bitcoin transaction graph show that the proposed strategy yields markedly higher illicit ratios in the extracted subgraph than random and degree-based heuristics on Elliptic and the IBM-AML HI variants, while keeping the output compact.

Explore related subjects

cs.SIcs.CEcs.CY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Doniyor Koshimbetov, E. Şule Yazıcı, Asha Rao. 2026-10-09. Extracting Illicit-Rich Subgraph from Transaction Networks via Feed-Guided Shortest Paths. https://arxiv.org/abs/2610.13280

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Les Misérables Dialogue: A film-based network representation of social communication

In this work, we revisit the classic Les Misérables benchmark network from the perspective of social communication. Using the 1998 film adaptation of the novel, we construct the publicly available Les Misérables Dialogue temporal text network, which explicitly distinguishes speakers, addressees, and other recipients of each utterance, along with its content and timing. Using the ten social dimensions model, we also derive multilayer network representations of the network, in which layers correspond to distinct relational dimensions. Beyond the network dataset, this work offers a general methodology for building similarly rich communication datasets from similar narrative sources.

cs.SI↗
arXiv2026

Polarization Dynamics under Algorithmic Recommendations in LLM-based Online Social Networks

How do recommendation algorithms contribute to the formation of polarized opinions in online social networks? This question has been studied through empirical analyses of real platforms and mathematical models of opinion dynamics. Empirical studies capture user behavior but are often limited by noisy, incomplete, or inaccessible platform data, while mathematical models offer control and interpretability but usually rely on simplified opinion update rules. More recently, large language model (LLM)-based social simulations have provided an alternative for studying recommendation and opinion dynamics through natural-language interactions. However, how different ways of applying recommendations shape opinion dynamics remains underexplored. In this work, we provide a controlled comparison of two different recommendation mechanisms in an LLM-based online social network simulation. Edge Recommendation (ER) introduces new connections in the network, while Content-Exposure Recommendation (CR) exposes additional users to individual posts without modifying the underlying graph. Our framework represents users as LLM-based agents who interact in natural language while maintaining evolving opinion states. We measure polarization as opinion dispersion, extremization as the average distance of opinions from the neutral midpoint, and reinforcement as interactions that amplify already aligned opinions. Our results show higher mean polarization and extremization across recommendation conditions compared with the no-recommendation baseline, with absolute differences of up to $0.12$ in our main experiments.

cs.SI↗
arXiv2026

A Multi-Dimensional Score for Detecting Lesser-Known Points of Interest in Mountain Regions

Overtourism concentrates visitor demand on few iconic sites, while other points of interest (POIs) in the same area often remain known only to a narrower public. This imbalance is especially critical in mountain environments, where limited infrastructure amplifies environmental pressures. Discovering lesser-known POIs is relevant for redistributing tourism demand spatially, valuing underrepresented heritage, and temporally, easing high seasonality pressures on popular POIs. Across the literature, definitions of lesser-known POIs or hidden gems remain scattered, and existing scoring approaches remain incomplete, relying on narrow indicators (e.g., number of photos, reviews, likes) which fail to characterize mountain POIs holistically. These approaches are further constrained by their reliance on commercial proprietary sources, or by questionnaires that are subject to memory bias. To address these gaps, we introduce a novel multi-dimensional metric, the Obscurity Score, that groups fragmented literature into four key dimensions (International Awareness, Attractiveness, Promotion, and Accessibility) to systematically detect and characterize lesser-known POIs and enable their promotion as a first step toward mitigating overtourism. To operationalize this score, we develop a generic pipeline mapping open data sources onto these four dimensions. Preliminary results from a web-based prototype demonstrate the practical relevance of the proposed approach.

cs.SI↗