相关论文: A bijection between Tamari intervals and extended …
We develop simple diffusion-advection models to estimate the average time it takes fish to reach one of the boundaries of an enclosure and the population distribution over time moving in the enclosure (such as a lake or slough). We start…
We revisit here a fundamental result on planar triangulations, namely that the flip distance between two triangulations is upper-bounded by the number of proper intersections between their straight-segment edges. We provide a complete and…
The Fisher Information Matrix formalism is extended to cases where the data is divided into two parts (X,Y), where the expectation value of Y depends on X according to some theoretical model, and X and Y both have errors with arbitrary…
Fisher matrices play an important role in experimental design and in data analysis. Their primary role is to make predictions for the inference of model parameters - both their errors and covariances. In this short review, I outline a…
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the…
Adversarial robustness has become a topic of growing interest in machine learning since it was observed that neural networks tend to be brittle. We propose an information-geometric formulation of adversarial defense and introduce FIRE, a…
This paper applies a regularization procedure called increasing rearrangement to monotonize Edgeworth and Cornish-Fisher expansions and any other related approximations of distribution and quantile functions of sample statistics. Besides…
Consider the barycentric subdivision which cuts a given triangle along its medians to produce six new triangles. Uniformly choosing one of them and iterating this procedure gives rise to a Markov chain. We show that almost surely, the…
In recent decades, much attention has been focused on the topic of optimal paths in weighted networks due to its broad scientific interest and technological applications. In this work we revisit the problem of the optimal path between two…
We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…
We consider an individual-based two-dimensional spatial model with nearest-neighbor preemptive competition to study front propagation between an invader and a resident species. In particular, we investigate the asymptotic front velocity and…
A recent work (arXiv:2104.14481) has found a statistically significant transition in the Baryonic Tully-Fisher relation (BTFR) using low redshift data ($z<0.1$), with the transitions occurring at about 9 and 17 Mpc. Motivated by this…
Due to its great efficiency and maneuverability, undulatory swimming is the predominant form of locomotion in aquatic vertebrates. A myriad of animals of different species and sizes oscillate their bodies to propel themselves in aquatic…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
We develop a general method to study the Fisher information distance in central limit theorem for nonlinear statistics. We first construct completely new representations for the score function. We then use these representations to derive…
We calculate the large deviation function of the end-to-end distance and the corresponding extension-versus-force relation for (isotropic) random walks, on and off-lattice, with and without persistence, and in any spatial dimension. For…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…
We examine isotropic and anisotropic random walks which begin on the surface of linear ($N$), square ($N \times N$), or cubic ($N \times N \times N$) lattices and end upon encountering the surface again. The mean length of walks is equal to…
We introduce a hierachy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions $\phi\colon (0,\infty)\to(0,\infty)$. Two separated nets are called $\phi$-displacement…