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.

169,051 papers · 148 categories

Trend · papers per month

9182736 · May 202619922001200920182026
48 results for liquidation cascades

The scope of financial systemic risk research encompasses a wide range of interbank channels and effects, including asset correlation shocks, default contagion, illiquidity contagion, and asset fire sales. This paper introduces a financial network model that combines the default and liquidity stress mechanisms into a "…

2013-10-25abs ↗pdf ↗

Crypto crashes show no consistent early warning signal, suggesting they are abrupt shocks rather than critical transitions.

problem Identifying early warning signals for crypto crashes.
method Analysis of seven major BTC liquidation cascades using minute-level price and leverage/order-flow data.
result No variable is event-invariant, and the critical-slowing-down signature is present in only five out of seven events.

A new framework assesses liquidity risk in perpetual futures exchanges.

problem Measuring and predicting liquidation execution risk in perpetual futures markets.
method Slippage-at-Risk (SaR) framework, comprising three metrics: cross-sectional slippage quantile, expected slippage, and aggregate dollar-denominated tail slippage.
result SaR provides a forward-looking assessment of liquidation execution risk, predictive of systemic stress.

This paper explores leverage staking with stETH, revealing high returns but also significant risks.

problem Leverage staking introduces risks through intensified selling pressure and cascading liquidations.
method Formal framework for leverage staking, stress tests under extreme conditions of stETH devaluation.
result Leverage staking amplifies risks, leading to intensified selling pressure and price declines.

On many social networking web sites such as Facebook and Twitter, resharing or reposting functionality allows users to share others' content with their own friends or followers. As content is reshared from user to user, large cascades of reshares can form. While a growing body of research has focused on analyzing and c…

2014-03-18abs ↗pdf ↗

This paper optimizes power grid protection settings to maximize network degradation due to cascading attacks.

problem Cascading attacks on power grids and their undetected nature.
method Constrained Bayesian Optimization applied to transmission line protection settings.
result Even limited misconfiguration of protection settings can cause severe cascading attacks.

New insights into cascade feedback linearization of control systems.

problem Obtaining a cascade feedback linearization for invariant control systems.
method Introducing truncated versions of operators from the calculus of variations to prove new theorems.
result Established new geometry and foundational theorems for future work.

The paper improves theoretical guarantees for Thompson Sampling in cascading bandits.

problem Optimizing online recommender systems with cascading bandits.
method Develops and analyzes new Thompson Sampling algorithms for cascading bandits.
result Establishes the first theoretical guarantees on Thompson Sampling for cascading bandits.

Modeling cascading behavior in complex systems using CTBNs.

problem Understanding which states trigger cascading events in complex systems.
method Continuous-time Bayesian networks (CTBNs) for modeling and identifying likely sentry states.
result Identification of likely sentry states that may lead to cascading behavior.

Complex contagion model explains financial fire sales through continuous asset prices.

problem Modeling financial fire sales with a continuum of asset prices.
method Developed a threshold model of continuous-state cascades using real values for asset prices.
result Discretization approach accurately replicates the distribution of defaulted banks and asset prices.

Study on information cascade fragility under mismatched revealing probabilities.

problem Analyzing the fragility of information cascades in decision-making processes with imperfect knowledge of revealing probabilities.
method Examined sequential decision-making models with players having private information and imitating previous decisions. Studied the effect of a mismatch between players' beliefs and actual revealing probabilities.
result Derived closed-form expressions for optimal learning rates and identified phase transitions in the behavior of asymptotic learning rates.

A search engine usually outputs a list of KK web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user behavior is known as the cascade model. In this paper, we propose cascading bandits, a learning variant of the cascade model where the obje…

2015-02-10abs ↗pdf ↗

Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference in the exponentially-sized output spaces such models require. We formulate and develop the Structured Prediction Cascade architecture: a seque…

2012-08-06abs ↗pdf ↗

Bayesian optimization tackles expensive cascade processes.

problem Optimizing multistage decision-making processes with expensive costs.
method Formulated as Bayesian optimization framework with two types of acquisition functions.
result Demonstrated effectiveness through numerical experiments and a solar cell simulator application.

Model shows financial turbulence similar to turbulence, with wealth cascading from large to small entities.

problem Understanding wealth distribution and dynamics in financial systems.
method Constructed a multiscale model for hierarchical financial structures.
result Found wealth distribution exhibits power law at large scales and Maxwellian at small scales.

Cascades of information-sharing are a primary mechanism by which content reaches its audience on social media, and an active line of research has studied how such cascades, which form as content is reshared from person to person, develop and subside. In this paper, we perform a large-scale analysis of cascades on Faceb…

2016-02-02abs ↗pdf ↗

Modeling social network activity through user and topic interaction.

problem Understanding complex dynamics of opinion formation in social networks.
method Mixture of Interacting Cascades (MIC) model of marked multidimensional Hawkes processes.
result MIC achieves superior performance in modeling information cascade spread.

The paper addresses the kk-tangle enumeration problem. We introduce a notion of cascade diagram for kk-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating …

2007-12-22abs ↗pdf ↗

Algorithm recommends trades based on crypto asset prices and market conditions.

problem Optimizing trades in volatile crypto markets to minimize gas fees and slippage.
method Cascading Waterfall Round Robin Mechanism considering gas fees and slippage.
result Algorithmic approach reduces market noise and ensures sound trade execution.

We consider the problem of finding the graph on which an epidemic cascade spreads, given only the times when each node gets infected. While this is a problem of importance in several contexts -- offline and online social networks, e-commerce, epidemiology, vulnerabilities in infrastructure networks -- there has been ve…

2012-02-08abs ↗pdf ↗

Unified approach for influence maximization using diffusion cascade representations.

problem Influence maximization on networks with diffusion cascades.
method Multi-task neural network learning influencer and susceptible vectors; greedy algorithm for influence maximization.
result IMINFECTOR outperforms other methods in efficiency and seed set quality.

Improves information cascade models using contrastive training and DSTs.

problem Improving models of information cascades using limited labeled data.
method Proposes a contrastive training procedure for models of information cascades as directed spanning trees (DSTs).
result Unsupervised training with additional content features achieves significantly better results, reaching half the accuracy of a fully supervised model.

We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (e.g., …

2016-10-13abs ↗pdf ↗

In this paper, we present a general, multistage framework for graphical model approximation using a cascade of models such as trees. In particular, we look at the problem of covariance matrix approximation for Gaussian distributions as linear transformations of tree models. This is a new way to decompose the covariance…

2018-08-10abs ↗pdf ↗

Cascading flows improve variational inference in structured programs.

problem Challenges in variational inference for complex probabilistic programs.
method Integrates normalizing flows and ASVI to create cascading flows, which embed the forward-pass of probabilistic programs.
result Cascading flows outperform normalizing flows and ASVI in structured inference problems.

In agreement with the recent research findings in the econophysics, we propose that the nonlinear dynamic chaos can be generated by the turbulent capital flows in both the quantitative easing transmission channels and the transaction networks channels, when there are the laminar turbulent capital flows transitions in t…

2013-05-24abs ↗pdf ↗

Study online ranking in non-stationary environments with abrupt preference changes.

problem Online learning to rank in a non-stationary cascade model where user preferences change abruptly.
method Cascading non-stationary bandits, proposing CascadeDUCB and CascadeSWUCB algorithms.
result Upper and lower bounds on regret for cascading non-stationary bandits algorithms.

Algorithm estimates clock in network cascades to improve performance.

problem Temporal distortion in cascade observation leads to performance degradation.
method Formulated clock estimation problem, developed FastClock algorithm.
result FastClock algorithm outperforms state-of-the-art in terms of accuracy and speed.

A probabilistic framework is introduced that represents stylized banking networks and aims to predict the size of contagion events. In contrast to previous work on random financial networks, which assumes independent connections between banks, the possibility of disassortative edge probabilities (an above average tende…

2011-10-19abs ↗pdf ↗

In the Network Inference problem, one seeks to recover the edges of an unknown graph from the observations of cascades propagating over this graph. In this paper, we approach this problem from the sparse recovery perspective. We introduce a general model of cascades, including the voter model and the independent cascad…

2015-05-21abs ↗pdf ↗

We introduce a new sequential Monte Carlo algorithm we call the particle cascade. The particle cascade is an asynchronous, anytime alternative to traditional particle filtering algorithms. It uses no barrier synchronizations which leads to improved particle throughput and memory efficiency. It is an anytime algorithm i…

2014-07-10abs ↗pdf ↗

This work proposes an efficient autoregressive model for text generation.

problem The challenge of generating high-quality text with autoregressive models.
method Introduces a cascaded decoding approach using Markov transformers to achieve sub-linear parallel time generation.
result Shows competitive accuracy/speed tradeoff compared to existing methods on five machine translation datasets.

Adaptive cascade submodular maximization tackles sequential selection under uncertainty.

problem Maximizing expected utility from a set of items with unknown states and continuation probabilities.
method Proposed adaptive cascade submodular functions and a 0.12 approximation algorithm.
result Identified a class of functions (adaptive cascade submodular) that many practical applications satisfy.

We analyze cascades of defaults in an interbank loan market. The novel feature of this study is that the network structure and the size distribution of banks are derived from empirical data. We find that the ability of a defaulted institution to start a cascade depends on an interplay of shock size and connectivity. Fu…

2013-10-06abs ↗pdf ↗