Related papers: New exponential law for real networks
Finite heat reservoir capacity and temperature fluctuations lead to modification of the well known canonical exponential weight factor. Requiring that the corrections least depend on the one-particle energy, we derive a deformed entropy,…
We derive a renormalization method to calculate the spectral dimension $\bar{d}$ of deterministic self-similar networks with arbitrary base units and branching constants. The generality of the method allows the affect of a multitude of…
A class of cubic networks composed of a regular one-dimensional lattice and a set of long-range links is introduced. Networks parametrized by a positive integer k are constructed by starting from a one-dimensional lattice and iteratively…
The Renyi distribution ensuring the maximum of a Renyi entropy is investigated for a particular case of a power--law Hamiltonian. Both Lagrange parameters, $\alpha$ and $\beta$ can be excluded. It is found that $\beta$ does not depend on a…
In this paper, we utilize the potential offered by multidimensional separable states (MSS) for secure and simultaneous distributions of keys in a layered network. We present protocols for both quantum and semi-quantum key distribution and…
In this paper we consider a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and find that under some natural algebraic conditions of the codes their empirical spectral…
The skew-normal and the skew-$t$ distributions are parametric families which are currently under intense investigation since they provide a more flexible formulation compared to the classical normal and $t$ distributions by introducing a…
The present paper is devoted to the relativistic statistical theory, introduced in Phys. Rev. E {\bf 66} (2002) 056125 and Phys. Rev. E {\bf 72} (2005) 036108, predicting the particle distribution function $p(E)= \exp_{\kappa}…
Scale-free networks are a recently developed approach to model the interactions found in complex natural and man-made systems. Such networks exhibit a power-law distribution of node link (degree) frequencies n(k) in which a small number of…
In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…
In this short note we study uniform approximations to the normal distributions by Jacobi theta functions. We shall show that scaled theta functions approach to a normal distribution exponentially fast.
The availability of large scale streaming network data has reinforced the ubiquity of power-law distributions in observations and enabled precision measurements of the distribution parameters. The increased accuracy of these measurements…
We propose a preferential attachment model for network growth where new entering nodes have a partial information about the state of the network. Our main result is that the presence of bounded information modifies the degree distribution…
Nowadays, exponential random graphs (ERGs) are among the most widely-studied network models. Different analytical and numerical techniques for ERG have been developed that resulted in the well-established theory with true predictive power.…
Network growth as described by the Duplication-Divergence model proposes a simple general idea for the evolution dynamics of natural networks. In particular it is an alternative to the well known Barab\'asi-Albert model when applied to…
The distribution of entanglement is a crucial task for quantum communication towards realizing a globe-spanning quantum internet. Recently a protocol for deterministic long-distance distribution of macroscopic entanglement over a network of…
We consider parametric exponential families of dimension $K$ on the real line. We study a variant of \textit{boundary crossing probabilities} coming from the multi-armed bandit literature, in the case when the real-valued distributions form…
The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert--Barabasi) and classical random ones (Erdos--Renyi) are evaluated. The graph spectra for dense graph…
Higher order clustering coefficients $C(x)$ are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours of a certain vertex $i$ equals $x$, when one neglects all…
We advance scale-invariance arguments for systems that are governed (or approximated) by a $q-$Gaussian distribution, i.e., a power law distribution with exponent $Q=1/(1-q); q \in \mathbb{R}$. The ensuing line of reasoning is then compared…