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,695 papers · 148 categories

Trend · papers per month

64129193257 · May 202619922001200920172026
48 results for percolation theory

We present a plausible micro-founded model for the previously postulated power law finite time singular form of the crash hazard rate in the Johansen-Ledoit-Sornette model of rational expectation bubbles. The model is based on a percolation picture of the network of traders and the concept that clusters of connected tr…

2016-01-28abs ↗pdf ↗

First-passage percolation affects graph properties like curvature and geodesics.

problem Effect of first-passage percolation on graph curvature and geodesics.
method Randomly perturbs the metric of a graph by assigning random edge lengths.
result Non-positive curvature and geodesic properties are not preserved by first-passage percolation.

Study reveals how dengue spread patterns vary across different years in Recife, Brazil.

problem Understanding spatial organization of dengue transmission in urban areas.
method Spatial analysis of dengue cases using topological data analysis and Vietoris-Rips filtrations.
result Critical percolation thresholds define distinct geometric regimes of dengue spread.

New dimension concept for groups based on percolation probability.

problem Defining a new dimension for groups using percolation probability.
method Introducing percolation dimension pdim(G)pdim(G) for groups GG using symmetric probability measures.
result The percolation dimension pdim(G)pdim(G) has natural properties like monotonicity and coincides with growth rate exponents for various groups.

There have been several spectral bounds for the percolation transition in networks, using spectrum of matrices associated with the network such as the adjacency matrix and the non-backtracking matrix. However they are far from being tight when the network is sparse and displays clustering or transitivity, which is repr…

2017-10-04abs ↗pdf ↗

The question we address here is of whether phenomena of collective bankruptcies are related to self-organized criticality. In order to answer it we propose a simple model of banking networks based on the random directed percolation. We study effects of one bank failure on the nucleation of contagion phase in a financia…

2001-11-30abs ↗pdf ↗

We develop a novel method for detection of signals and reconstruction of images in the presence of random noise. The method uses results from percolation theory. We specifically address the problem of detection of multiple objects of unknown shapes in the case of nonparametric noise. The noise density is unknown and ca…

2013-10-31abs ↗pdf ↗

The study extends stochastic block models to geometric settings, focusing on community detection and information flow.

problem Generalizing community detection and information flow models to geometric settings.
method Considered a geometric random graph over a homogeneous metric space, defined a geometric counterpart of flow of information on trees.
result Sufficient conditions for recovering locations and for percolation of information in geometric settings.

Proposes using continuum percolation to analyze data manifolds and improve generative models.

problem Disentangling geometric support from probability distributions in high-dimensional data.
method Establishes a correspondence between topological phase transitions of random geometric graphs and data manifolds, using Percolation Shift metric.
result Demonstrates that Percolation Shift metric captures structural pathologies like mode collapse and guides training to prevent manifold shrinkage and improve fidelity.

New method combines gradient optimization with constraint-based techniques for causal discovery.

problem Causal discovery from observational data, especially with small sample sizes.
method Differentiable dd-separation scores using percolation theory and soft logic for gradient-based optimization of conditional independence constraints.
result Empirical evaluations show robust performance in low-sample regimes, surpassing traditional methods.

Machine learning predicts critical points for directed percolation models.

problem Determining critical points for directed percolation models.
method Supervised and unsupervised machine learning algorithms (CNN and DBSCAN) were used.
result Machine learning accurately predicts critical points for both models.

Riemannian first-passage percolation (FPP) is a continuum model, with a distance function arising from a random Riemannian metric in Rd\R^d. Our main result is a shape theorem for this model, which says that large balls under this metric converge to a deterministic shape under rescaling. As a consequence, we show that …

2009-07-13abs ↗pdf ↗

Neural networks predict shapes of first passage percolation sets.

problem Predicting the shape of first passage percolation sets.
method Used a neural network to predict the shape of the set of discovered sites from the distribution of passage times.
result Neural networks can quickly predict the shape of the set of discovered sites from the distribution of passage times.

New geometric analysis of PWSPDs balances density and geometry in high-dimensional data.

problem Balancing density and geometry in high-dimensional data.
method Power-weighted shortest-path distances (PWSPDs) and their geometric and computational analyses.
result High probability guarantees on the equivalence of PWSPDs on complete and nearest neighbor graphs.

Study on connectivity and geometry of random Coxeter groups.

problem Connectivity threshold for square percolation on random graphs.
method Probabilistic combinatorics and techniques from geometric group theory.
result Determines connectivity threshold and cubical coarse median structure for random Coxeter groups.

Square percolation determines threshold for group divergence in random graphs.

problem Threshold for quadratic divergence in random right-angled Coxeter groups.
method Square-graph analysis of random graphs to determine connectivity and divergence.
result Threshold probability for quadratic divergence is \( p_c(n) = \sqrt{\sqrt{6}-2}/\sqrt{n} \).

This paper initiates the study of topological arbiters, a concept rooted in Poincare-Lefschetz duality. Given an n-dimensional manifold W, a topological arbiter associates a value 0 or 1 to codimension zero submanifolds of W, subject to natural topological and duality axioms. For example, there is a unique arbiter on $…

2010-02-04abs ↗pdf ↗

We study first passage percolation (FPP) on a Gromov-hyperbolic group GG with boundary G\partial G equipped with the Patterson-Sullivan measure νν. We associate an i.i.d.\ collection of random passage times to each edge of a Cayley graph of GG, and investigate classical questions about the asymptotics of first pass…

2019-09-08abs ↗pdf ↗

Modelling of contagion in interbank networks is discussed. A model taking into account bow-tie structure and dissasortativity of interbank networks is developed. The model is shown to provide a good quantitative description of the Russian interbank market. Detailed arguments favoring the non-percolative nature of conta…

2014-10-01abs ↗pdf ↗

We introduce the notion of connection thickness of spheres in a Cayley graph, related to dead-ends and their retreat depth. It was well-known that connection thickness is bounded for finitely presented one-ended groups. We compute that for natural generating sets of lamplighter groups on a line or on a tree, connection…

2016-06-08abs ↗pdf ↗

A number of papers claim that a Log Periodic Power Law (LPPL) fitted to financial market bubbles that precede large market falls or 'crashes', contain parameters that are confined within certain ranges. The mechanism that has been claimed as underlying the LPPL, is based on influence percolation and a martingale condit…

2010-02-04abs ↗pdf ↗

A self-organized model with social percolation process is proposed to describe the propagations of information for different trading ways across a social system and the automatic formation of various groups within market traders. Based on the market structure of this model, some stylized observations of real market can…

2000-04-18abs ↗pdf ↗

We propose improved methods to identify stock groups using the correlation matrix of stock price changes. By filtering out the marketwide effect and the random noise, we construct the correlation matrix of stock groups in which nontrivial high correlations between stocks are found. Using the filtered correlation matrix…

2005-03-09abs ↗pdf ↗

We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…

2017-10-11abs ↗pdf ↗

In the present work we introduce a stochastic cellular automata model in order to simulate the dynamics of the stock market. A direct percolation method is used to create a hierarchy of clusters of active traders on a two dimensional grid. Active traders are characterised by the decision to buy, (+1), or sell, (-1), a …

2003-11-17abs ↗pdf ↗

The Tobin tax is an often discussed method to tame speculation and get a source of income. The discussion is especially heated when the financial markets are in crisis. In this article we refer to foreign exchange markets. The Tobin tax should be a small international tax affecting all currency transactions and thus co…

2002-05-15abs ↗pdf ↗

The Lightning Network is a so-called second-layer technology built on top of the Bitcoin blockchain to provide "off-chain" fast payment channels between users, which means that not all transactions are settled and stored on the main blockchain. In this paper, we model the emergence of the Lightning Network as a (bond) …

2019-12-07abs ↗pdf ↗