Related papers: Horizontal Visibility graphs generated by type-I i…
We study the cohomology of the hairy graph complexes which compute the rational homotopy of embedding spaces, generalizing the Vassiliev invariants of knot theory. We provide spectral sequences converging to zero whose first pages contain…
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved successful in explaining scale-free network properties such as…
We consider equilibrium statistics for high Reynolds number isotropic turbulence in an incompressible flow driven by steady forcing at the largest scale. Motivated by shell model observations, we develop a similarity theory for the inertial…
We derive the most basic dynamical properties of random hyperbolic graphs (the distributions of contact and intercontact durations) in the hot regime (network temperature $T > 1$). We show that for sufficiently large networks the contact…
We present the results of a search of log-periodic corrections to scaling in the moments of the energy dissipation rate in experiments at high Reynolds number (2500) of three-dimensional fully developed turbulence. A simple dynamical…
Let $\mathcal{H}$ be a hypergraph with $n$ vertices. Suppose that $d_1,d_2,\ldots,d_n$ are degrees of the vertices of $\mathcal{H}$. The $t$-th graph entropy based on degrees of $\mathcal{H}$ is defined as $$ I_d^t(\mathcal{H})…
In order to test the hypothesis that inverse cascade regions in turbulent flows might exhibit more Gaussian noise-like and less intermittent small-scale statistics compared to the overall statistics, in this work we measure degrees of…
In this paper, we study the entropy of a hard random geometric graph (RGG), a commonly used model for spatial networks, where the connectivity is governed by the distances between the nodes. Formally, given a connection range $r$, a hard…
We introduce the class of interval $H$-graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph $H$ with vertices $a_1,a_2,\dots,a_k$, we say that an input graph $G$ with given partition…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, which are defined by templates that generate structure by way…
This article aims to develop the uniformization and boundary theory of random infinite ideal hyperbolic polyhedra (abbr. IHP) and their dual 1-skeleton, i.e., ideal angled graphs (abbr. IAG) from multiple perspectives, including…
We develop the theoretical foundations of a generalized Gromov-Hausdorff distance between functions on networks that has recently been applied to various subfields of topological data analysis and optimal transport. These functional…
Random neural networks are dynamical descriptions of randomly interconnected neural units. These show a phase transition to chaos as a disorder parameter is increased. The microscopic mechanisms underlying this phase transition are unknown,…
In the last decades, the study of models for large real-world networks has been a very popular and active area of research. A reasonable model should not only replicate all the structural properties that are observed in real world networks…
The present work proposes a theory of isotropic and homogeneous turbulence for incompressible fluids, which assumes that the turbulence is due to the bifurcations associated to the velocity field. The theory is formulated using a…
The theory of pattern formation in reaction-diffusion systems is extended to the case of a directed network. Due to the structure of the network Laplacian of the scrutinised system, the dispersion relation has both real and imaginary parts,…
By tracking the divergence of two initially close trajectories in phase space in an Eulerian approach to forced turbulence, the relation between the maximal Lyapunov exponent $\lambda$, and the Reynolds number $Re$ is measured using direct…
We present a linear stability analysis of stationary states (or fixed points) in large dynamical systems defined on random directed graphs with a prescribed distribution of indegrees and outdegrees. We obtain two remarkable results for such…
In this paper we study the one dimensional random geometric graph when the location of the nodes are independent and exponentially distributed. We derive exact results and the limit theorems for the connectivity and other properties…