Related papers: Nesting statistics in the $O(n)$ loop model on ran…
We show that for a rather generic set of regular spectral curves, the Topological-Recursion invariants F_g grow at most like $O((\beta g)! r^{-g}) $ with some $r>0$ and $\beta\leq 5$.
We develop a renormalization theory of non-perturbative dissipative H\'enon-like maps with combinatorics of bounded type. The main novelty of our approach is the incorporation of Pesin theoretic ideas to the renormalization method, which…
Topological triangulations of orientable and non-orientable surfaces with arbitrary genus have important applications in quantum geometry, graph theory and statistical physics. However, until now only the asymptotics for 2-spheres are known…
It can be difficult to tell whether a trained generative model has learned to generate novel examples or has simply memorized a specific set of outputs. In published work, it is common to attempt to address this visually, for example by…
Under a map T, a point x recurs at rate given by a sequence {r_n} near a point x_0 if d(T^n(x),x_0)< r_n infinitely often. Let us fix x_0, and consider the set of those x's. In this paper, we study the size of this set for expanding maps…
We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require are: tail triviality, positive association (FKG) and that…
To study large-scale effects on the Internet various mod- els have been introduced to generate Internet-like autono- mous system (AS) topologies. The models for large-scale AS topologies have been focused on replicating structural graph…
Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum…
We study a problem motivated by a question related to quantum-error-correcting codes. Combinatorially, it involves the following graph parameter: $$f(G)=\min\set{|A|+|\{x\in V\setminus A : d_A(x)\text{is odd}\}| : A\neq\emptyset},$$ where…
We describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult…
Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field.…
A family of discontinuous symplectic maps on the cylinder is considered. This family arises naturally in the study of nonsmooth Hamiltonian dynamics and in switched Hamiltonian systems. The transformation depends on two parameters and is a…
We show that coarse graining arguments invented for the analysis of multi-spin systems on a randomly triangulated surface apply also to the O(n) model on a random lattice. These arguments imply that if the model has a critical point with…
The appearance of numbers enumerating alternating sign matrices in stationary states of certain stochastic processes is reviewed. New conjectures concerning nest distribution functions are presented as well as a bijection between certain…
In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes. In latent space random graphs, nodes are associated to unknown latent variables. One may then seek to compute distances directly in the…
We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…
This work deals with a special case of family of birational maps f : C2 -> C2 dynamically classified in [9]. In this work we study the zero entropy sub families of f. The sequence of degrees dn associated to the iterates of f is found to…
Random feature maps are ubiquitous in modern statistical machine learning, where they generalize random projections by means of powerful, yet often difficult to analyze nonlinear operators. In this paper, we leverage the "concentration"…
A topological group $G$ is topologically normally generated if there exists $g \in G$ such that the normal closure of $g$ is dense in $G$. Let $S$ be a tame, infinite type surface whose mapping class group $\mathrm{Map}(S)$ is generated by…
Numerical computations of bifurcation maps for one dimensional maps show patterns (regular jumps in point density) in the zones of chaotic behaviour. In this work, empiric formulas are given for these patterns for an entire class of maps.