Source author record

Jonathan Jaquette

Jonathan Jaquette appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

4works
5topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

Topological Data Analysis combined with Machine Learning for Predicting Permeability of Porous Media

Flow in porous media is difficult to address using standard analytical or numerical methods due to its complexity. However, since synthetic representations of porous media are easy to produce and data from physical experiments are becoming more widely available, the problem is well-suited to studies that include machine learning (ML) techniques. We discuss a number of features that can be extracted from such data, and their utility as input variables into a standard ML algorithm. These features include structural measures describing the geometry of the porous media, topological measures describing the connectivity, and network measures obtained by modeling the porous media as simplified pore networks. These features enable the prediction of the permeability of the considered (synthetic) porous materials using ML techniques that also leverage the separately computed exact permeability (ground truth). Comparing results obtained using different input variables helps develop a better understanding of the utility of various measures for predicting permeability based on the porous media structure. We show, in particular, that topological data analysis (TDA) provides a useful set of features that can be easily combined with ML to yield meaningful results.

preprint2021arXiv

Singularities and heteroclinic connections in complex-valued evolutionary equations with a quadratic nonlinearity

In this paper, we consider the dynamics of solutions to complex-valued evolutionary partial differential equations (PDEs) and show existence of heteroclinic orbits from nontrivial equilibria to zero via computer-assisted proofs. We also show that the existence of unbounded solutions along unstable manifolds at the equilibrium follows from the existence of heteroclinic orbits. Our computer-assisted proof consists of three separate techniques of rigorous numerics: an enclosure of a local unstable manifold at the equilibria, a rigorous integration of PDEs, and a constructive validation of a trapping region around the zero equilibrium.

preprint2019arXiv

Fractal Dimension Estimation with Persistent Homology: A Comparative Study

We propose that the recently defined persistent homology dimensions are a practical tool for fractal dimension estimation of point samples. We implement an algorithm to estimate the persistent homology dimension, and compare its performance to classical methods to compute the correlation and box-counting dimensions in examples of self-similar fractals, chaotic attractors, and an empirical dataset. The performance of the $0$-dimensional persistent homology dimension is comparable to that of the correlation dimension, and better than box-counting.

preprint2016arXiv

On $\varepsilon$ Approximations of Persistence Diagrams

Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently observed in nature. In this paper a theoretical framework for the algorithmic computation of an arbitrarily good approximation of the persistent homology is developed. We study the filtrations generated by sub-level sets of a function $f : X \to \mathbb{R}$, where $X$ is a CW-complex. In the special case $X = [0,1]^N$, $N \in \mathbb{N}$ we discuss implementation of the proposed algorithms. We also investigate a priori and a posteriori bounds of the approximation error introduced by our method.