Related papers: Horizontal Visibility graphs generated by type-I i…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
In this note we define and study graph invariants generalizing to higher dimension the maximum degree of a vertex and the vertex-connectivity (our $0$-dimensional cases). These are known to coincide almost surely in any regime for…
We study a graph-theoretic approach to the $\mathcal{H}_{\infty}$ performance of leader following consensus dynamics on directed and undirected graphs. We first provide graph-theoretic bounds on the system $\mathcal{H}_{\infty}$ norm of the…
We derive properties of Latent Variable Models for networks, a broad class of models that includes the widely-used Latent Position Models. These include the average degree distribution, clustering coefficient, average path length and degree…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
This article investigates the intrinsic link between skewness and statistical intermittency in velocity and temperature increments within homogeneous isotropic turbulence. The theoretical framework builds upon the author's previously…
We study Turing bifurcations on one-dimensional random ring networks where the probability of a connection between two nodes depends on the distance between the two nodes. Our approach uses the theory of graphons to approximate the graph…
By a classical result of Kathleen Alligood and James Yorke we know that as we isotopically deform a map $f:ABCD\to\mathbb{R}^2$ to a Smale horseshoe map we should often expect the dynamical complexity to increase via a period--doubling…
We consider regular lattices of coupled chaotic maps. Depending on lattice size, there may exist a window in parameter space where complete synchronization is eventually attained after a transient regime. Close outside this window, an…
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…
The Vapnik-Chervonenkis dimension (in short, VC-dimension) of a graph is defined as the VC-dimension of the set system induced by the neighborhoods of its vertices. We show that every $n$-vertex graph with bounded VC-dimension contains a…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large-deviation…
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…
Given a collection $\mathcal{G}=(G_1,\dots, G_h)$ of graphs on the same vertex set $V$ of size $n$, an $h$-edge graph $H$ on the vertex set $V$ is a $\mathcal{G}$-transversal if there exists a bijection $\lambda : E(H) \rightarrow [h]$ such…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
The Lyapunov exponent characterizes an exponential growth rate of the difference of nearby orbits. A positive Lyapunov exponent is a manifestation of chaos. Here, we propose the Lyapunov pair, which is based on the generalized Lyapunov…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
Laminar-turbulent pattern formation is a distinctive feature of the intermittency regime in subcritical plane shear flows. By performing extensive numerical simulations of the plane channel flow, we show that the pattern emerges from a…
Reliability evaluation and fault tolerance of an interconnection network of some parallel and distributed systems are discussed separately under various link-faulty hypotheses in terms of different $\mathcal{P}$-conditional…