Related papers: Nesting statistics in the $O(n)$ loop model on ran…
The study of the dynamics of an holomorphic map near a fixed point is a central topic in complex dynamical systems. In this paper we will consider the corresponding random setting: given a probability measure $\nu$ with compact support on…
We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $\mathbb{X}$ equipped with a continuous function $f: \mathbb{X} \rightarrow \mathbb{R}$. We first give a categorification of the…
Clustering $\unicode{x2013}$ the tendency for neighbors of nodes to be connected $\unicode{x2013}$ quantifies the coupling of a complex network to its latent metric space. In random geometric graphs, clustering undergoes a continuous phase…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
With the recent popularity of graphical clustering methods, there has been an increased focus on the information between samples. We show how learning cluster structure using edge features naturally and simultaneously determines the most…
The standard map, paradigmatic conservative system in the $(x,p)$ phase space, has been recently shown to exhibit interesting statistical behaviors directly related to the value of the standard map parameter $K$. A detailed numerical…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
We obtain an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly expanding rational maps without any smoothness…
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. The topologies of random Boolean networks with one input per…
We study statistical properties of the truncated flat spot map $f_t(x)$. In particular, we investigate whether for large $n$, the deviations $\sum_{i=0}^{n-1} \left(f_t^i(x_0)-\frac 12\right)$ upon rescaling satisfy a $Q$-Gaussian…
We introduce {\it twist unimodal maps} of the interval and describe their structure. Sufficient conditions for the growth of over-rotation interval in families of maps are given.
In this paper, we discuss how to apply GAP to do computations in modular representation theory. Of particular interest is the generating number of a group algebra, which measures the failure of the generating hypothesis in the stable module…
We introduce a random graph model based on k-trees, which can be generated by applying a probabilistic preferential attachment rule, but which also has a simple combinatorial description. We carry out a precise distributional analysis of…
This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…
In this paper we study topological entropy and recurrence properties of non-autonomous dynamical system generated by a family of continuous self maps on a compact space X. Specially, we introduce the pseudo-entropy and…
We consider a variation of $O(N)$-symmetric vector models in which the vector components are Grassmann numbers. We show that these theories generate the same sort of random polymer models as the $O(N)$ vector models and that they lie in the…
We study the information content of summary statistics built from the multi-scale topology of large-scale structures on primordial non-Gaussianity of the local and equilateral type. We use halo catalogs generated from numerical N-body…
The generating functional method is employed to investigate the synchronous dynamics of Boolean networks, providing an exact result for the system dynamics via a set of macroscopic order parameters. The topology of the networks studied and…
We investigate the emergence of random-matrix statistics in the D1D5 CFT by studying second-order lifting matrices in low-energy near-BPS sectors. We compare the $N=3$ finite-$N$ lifting problems with the planar large-$N$ limit at fixed…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…