Related papers: Nesting statistics in the $O(n)$ loop model on ran…
The Nielsen number $N(f)$ is a lower bound for the minimal number of fixed points among maps homotopic to $f$. When these numbers are equal, the map is called Wecken. A recent paper by Brimley, Griisser, Miller, and the second author…
We extend our earlier work on the massive $O(N)$ nonlinear sigma model to other observables. We derive expressions at leading order in the large $N$ expansion at all orders in the loop expansion for the decay constant, vacuum expectation…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
An important problem in computational topology is to calculate the homology of a space from samples. In this work, we develop a statistical approach to this problem by calculating the expected rank of an induced map on homology from a…
This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the…
We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by…
We investigate the notion of Gaussian domination for the spin $O(N)$ model on general finite graphs. We begin by proving a general inequality for spin correlations under the assumption of Gaussian domination, which directly implies…
We apply tools from topological data analysis to two mathematical models inspired by biological aggregations such as bird flocks, fish schools, and insect swarms. Our data consists of numerical simulation output from the models of Vicsek…
We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short range correlations in the level spacings of the…
Three-dimensional random tensor models are a natural generalization of the celebrated matrix models. The associated tensor graphs, or 3D maps, can be classified with respect to a particular integer or half-integer, the degree of the…
We discuss the study of topological characteristics of random fields that are used for numerical simulation of oil and gas reservoirs and numerical algorithms (see arXiv:1302.3669), for computing such characteristics, for which we…
Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…
We consider some classes of piecewise expanding maps in finite dimensional spaces having invariant probability measures which are absolutely continuous with respect to Lebesgue measure. We derive an entropy formula for such measures and,…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We simulate CMB maps including non-Gaussianity arising from cubic order perturbations of the primordial gravitational potential, characterized by the non-linearity parameter $g_{NL}$. The maps are used to study the characteristic nature of…
We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…
In this work we investigate the topological information captured by the Euler obstruction of a map, $f:(X,0)\to (\mathbb{C}^{2},0)$, with $(X,0)$ a germ of a complex $d$-equidimensional singular space, with $d > 2$, and its relation with…
Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…
On a stack of stable maps, the psi classes are modified by subtracting certain boundary divisors. These modified psi classes are compatible with forgetful morphisms, and are well-suited to enumerative geometry: tangency conditions allow…
In this paper, we study the Galton-Watson process in the random environment for the particular case when the number of the offsprings in each generation has the fractional linear generation function with random parameters. In this case, the…