Related papers: Large Fluctuations in Amplifying Graphs
The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…
We investigate the predictability problem in dynamical systems with many degrees of freedom and a wide spectrum of temporal scales. In particular, we study the case of $3D$ turbulence at high Reynolds numbers by introducing a finite-size…
Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a…
We model chaotic diffusion, in a symplectic 4D map by using the result of a theorem that was developed for stochastically perturbed integrable Hamiltonian systems. We explicitly consider a map defined by a free rotator (FR) coupled to a…
In problems where the temporal evolution of a nonlinear system cannot be followed, a method for studying the fluctuations of spatial patterns has been developed. That method is applied to well-known problems in deterministic chaos (the…
For piecewise expanding one-dimensional maps without periodic turning points we prove that isolated eigenvalues of small (random) perturbations of these maps are close to isolated eigenvalues of the unperturbed system. (Here ``eigenvalue''…
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…
Dynamics of coupled chaotic oscillators on a network are studied using coupled maps. Within a broad range of parameter values representing the coupling strength or the degree of elements, the system repeats formation and split of coherent…
We report on novel Brownian, yet non-Gaussian diffusion, in which the mean square displacement of the particle grows linearly with time, the probability density for the particle spreading is Gaussian-like, however, the probability density…
For sequences of non-lattice weakly dependent random variables, we obtain asymptotic expansions for Large Deviation Principles. These expansions, commonly referred to as strong large deviation results, are in the spirit of Edgeworth…
Graph states are the backbone of measurement-based continuous-variable quantum computation. However, experimental realisations of these states induce Gaussian measurement statistics for the field quadratures, which poses a barrier to obtain…
We introduce and analyze a class of growing geometric random graphs that are invariant under rescaling of space and time. Directed connections between nodes are drawn according to influence zones that depend on node position in space and…
This work deals with the divisible sandpile model when an initial configuration sampled from a heavy-tailed distribution. Extending results of Levine et al. (2015) and Cipriani et al. (2016) we determine sufficient conditions for…
We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator which generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.
We propose a new method to investigate collective behavior in a network of globally coupled chaotic elements generated by a tent map. In the limit of large system size, the dynamics is described with the nonlinear Frobenius-Perron equation.…
Starting with the large deviation principle (LDP) for the Erd\H{o}s-R\'enyi binomial random graph $\mathcal{G}(n,p)$ (edge indicators are i.i.d.), due to Chatterjee and Varadhan (2011), we derive the LDP for the uniform random graph…
The results of this paper contribute to the study of invariant measures of Borel dynamical systems that can be modeled using generalized Bratteli diagrams. In this context, we study tail invariant measures on the path spaces of generalized…