New method tightens spectral bounds for percolation in clustered networks.
problem Tight spectral bounds for percolation in sparse networks with clustering.
method Message passing algorithm on triangle-non-backtracking matrix.
result Method gives tighter lower-bound to percolation transition.
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 on dropout in neural networks using percolation theory.
problem Understanding dropout's effect on neural network training.
method Investigates percolation models mimicking dropout in neural networks.
result Dropout can cause a breakdown in neural networks.
Percolation study in non-hyperbolic groups proves non-uniqueness phase.
problem Percolation in acylindrically hyperbolic groups.
method Analyzing Bernoulli bond percolation on Cayley graphs of groups.
result Non-uniqueness phase in percolation on Cayley graphs of acylindrically hyperbolic groups.
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) for groups G using symmetric probability measures. result The percolation dimension pdim(G) has natural properties like monotonicity and coincides with growth rate exponents for various groups. FPP preserves sublinear Morse boundaries in geodesic graphs.
problem Preserving sublinear Morse boundaries in FPP.
method First passage percolation on geodesic graphs with i.i.d. passage times.
result Sublinear Morse boundaries are invariant under FPP.
New matrix ensembles better match deep neural network spectral densities.
problem Theoretical spectral density models for deep networks do not match empirical observations.
method Introduced new matrix ensemble classes to better fit observed spectral densities.
result Theoretical models for deep networks are significantly flawed.
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.
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…
Percolation on complex networks has been used to study computer viruses, epidemics, and other casual processes. Here, we present conditions for the existence of a network specific, observation dependent, phase transition in the updated posterior of node states resulting from actively monitoring the network. Since tradi…
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.
Study of first passage percolation on hyperbolic groups, showing velocity and coalescence.
problem Understanding the geometry and dynamics of first passage percolation on hyperbolic groups.
method Investigation of first passage times on Cayley graphs of Gromov-hyperbolic groups with i.i.d. random passage times.
result Existence and almost sure constancy of velocity in almost every direction on the boundary of the group.
Riemannian first-passage percolation (FPP) is a continuum model, with a distance function arising from a random Riemannian metric in Rd. 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 …
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.
We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algorithm that allows to detect objects of unknown shapes in the presence of random noise. The algorithm has linear complexity and exponential accuracy and …
We present a set of models of the main stylized facts of market price fluctuations. These models comprise dynamical evolution with threshold dynamics and Langevin price equation with multiplicative noise, percolation models to describe the interaction between traders and hierarchical cascade models to unravel the possi…
Random trees emerge from geodesics in hyperbolic groups.
problem Understanding geodesics in hyperbolic groups.
method Surveying known properties and constructing random trees.
result Rich random geometry of emerging trees.
This paper proposes a percolation-based model of new-product diffusion in the spirit of Solomon et al. (2000) and Goldenberg et al. (2000). A consumer buys the new product if she has formed her individual valuation of the product (reservation price) and if this valuation is greater or equal than the price of the produc…
Improved gossip algorithm for networks of given dimension using Jacobi polynomial iterations.
problem Efficiently estimating the average of values in a network of agents.
method A gossip algorithm that depends only on the spectral dimension of the network, using Jacobi polynomial iterations.
result Significantly faster convergence compared to previous methods in the non-asymptotic regime.
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.
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.
Study geodesics on graphs with random lengths, proving bi-infinite paths exist.
problem Existence of bi-infinite geodesic paths on graphs with random edge lengths.
method Sublinear Morse geodesics and first passage percolation analysis.
result Proves the existence of bi-infinite geodesic paths in graphs with specific properties.
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} \).
We develop an unsupervised, nonparametric, and scalable statistical learning method for detection of unknown objects in noisy images. The method uses results from percolation theory and random graph theory. We present an algorithm that allows to detect objects of unknown shapes and sizes in the presence of nonparametri…
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…
We analyze convergence of Fermat distances and their application in clustering.
problem Understanding convergence properties of Fermat distances on Riemannian manifolds.
method Geometric and statistical arguments in percolation theory, leveraging novel arguments for non-uniform densities and curved domains.
result Discrete, sample-based Fermat distances converge to their continuum analogues with a precise rate dependent on intrinsic dimensionality.
Modeling Bitcoin Lightning Network emergence as percolation process.
problem Feasibility of the Lightning Network's emergence.
method Fitness-dependent network model based on percolation theory.
result Phase transition delineating sustainable vs. unsustainable Lightning Network states.
We introduce community trees to summarize network structures.
problem Stability of community structures in networks.
method Clique percolation method (CPM) and persistent diagrams.
result Total star number (TSN) provides an upper bound on community tree changes.
New framework captures non-autonomous IFS limit set topology.
problem Understanding topological properties of non-autonomous IFS limit sets.
method Homological framework applied to fractal square.
result Provides insights into fractal topology, answering Mandelbrot's percolation problem.
The paper uses critical percolation to analyze deep networks and maze data.
problem Understanding and analyzing the training of deep networks and graph structured data.
method Topological classification of reachability in planar graphs (Mazes) and a suitable architecture for processing.
result The cost function around the global minimum does not depend on maze size in the large maze limit.
The percolation model of stock market speculation allows an asymmetry (in the return distribution) leading to fast downward crashes and slow upward recovery. We see more small upturns and more intermediate downturns.
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…
The ungrammatical sentence "The key to the cabinets are on the table" is known to lead to an illusion of grammaticality. As discussed in the meta-analysis by Jaeger et al., 2017, faster reading times are observed at the verb are in the agreement-attraction sentence above compared to the equally ungrammatical sentence "…
Machine learning detects underwater gas leaks.
problem Early detection of gas leaks in underwater reservoirs.
method Machine learning and Passive Acoustic Monitoring (PAM).
result Classification algorithms achieve good performance in detecting leaks.
Model shows advantageous position in trade networks leads to success.
problem Characterizing the importance of nodes in trade networks during globalization.
method Mapped trade network evolution to percolation problem and analyzed topological features.
result Advantageous position at different scales determines node success.
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 d-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.
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…
Paper tackles learning complex propagation models using MI approach.
problem Learning propagation in pretopology formalism.
method Logical combination of neighborhoods, Multiple Instance learning.
result MI approach more efficient for propagation model recognition.
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.
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…
Curriculum learning improves deep generative models for noisy data.
problem Training deep generative models with noisy data is challenging.
method Proposes a curriculum learning algorithm based on data point centrality.
result The algorithm learns optimal generative models for noisy data.
Proposes a probabilistic framework for smart contract risk quantification.
problem Quantifying financial risk of smart contract cyber attacks and failures.
method Probabilistic graph-theoretical framework using bond percolation models.
result Analytical results and numerical examples for aggregate loss distribution.
We study analytically and numerically Minsky instability as a combination of top-down, bottom-up and peer-to-peer positive feedback loops. The peer-to-peer interactions are represented by the links of a network formed by the connections between firms, contagion leading to avalanches and percolation phase transitions pr…
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 $…
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…
We describe, at the microscopic level, the dynamics of N interacting components where the probability is very small when N is large that a given component interact more than once, directly or indirectly, up to time t, with any other component. Due to this fact, we can consider, at the macroscopic level, the quadratic s…
Modeling financial networks to predict systemic crises.
problem Predicting systemic financial crises in complex networks.
method Developed inhomogeneous random financial networks (IRFNs) to model bank interactions.
result Found a condition for a locally tree-like independence (LTI) property, leading to fixed point equations for system equilibrium.