Related papers: Emergent correlations in the selected link-times a…
We show central limit theorems (CLT) for the Stieltjes transforms or more general analytic functions of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of $\alpha$-stable laws and…
In several real-world networks like the Internet, WWW etc., the number of links grow in time in a non-linear fashion. We consider growing networks in which the number of outgoing links is a non-linear function of time but new links between…
We introduce and study a new model consisting of a single classical random walker undergoing continuous monitoring at rate $\gamma$ on a discrete lattice. Although such a continuous measurement cannot affect physical observables, it has a…
Sampling a random permutation with restricted positions, or equivalently approximating the permanent of a 0-1 matrix, is a fundamental problem in computer science, with several notable results achieved over the years. However, existing…
We consider the optimal transmission of distributed correlated discrete memoryless sources across a network with capacity constraints. We present several previously undiscussed structural properties of the set of feasible rates and…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
In the probability theory limit distributions (or probability measures) are often characterized by some convolution equations (factorization properties) rather than by Fourier transforms (the characteristic functionals). In fact, usually…
We investigate dynamical aspects of the discrete nonlinear Schr\"{o}dinger equation (DNLS) in finite lattices. Starting from a periodic chain with nearest neighbor interactions, we insert randomly links connecting distant pairs of sites…
We illustrate, through a series of prototypical examples, that linear parity-time (PT) symmetric lattices with extended gain/loss profiles are generically unstable, for any non-zero value of the gain/loss coefficient. Our examples include a…
We study random spatial permutations on Z^3 where each jump x -> \pi(x) is penalized by a factor exp(-T ||x-\pi(x)||^2). The system is known to exhibit a phase transition for low enough T where macroscopic cycles appear. We observe that the…
Since quantum spatial searches on complex networks have a strong network dependence, the question arises whether the universal perspective exists in this quantum algorithm for complex networks. Here, we uncover the universal scaling laws of…
Power-law (PL) time dependent infection growth has been reported in many COVID-19 statistics. In simple SIR models the number of infections grows at the outbreak as $I(t) \propto t^{d-1}$ on $d$-dimensional Euclidean lattices in the endemic…
We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social…
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…
Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect,…
We study a synchronization mechanism, based on one-way coupling of all-or-nothing type, applied to coupled map lattices with several different local rules. By analyzing the metric and the topological distance between the two systems, we…
We study a generalization of site percolation on a simple cubic lattice, where not only single sites are removed randomly, but also entire parallel columns of sites. We show that typical clusters near the percolation transition are very…
We consider first-passage percolation on $\mathbb Z^2$ with independent and identically distributed weights whose common distribution is absolutely continuous with a finite exponential moment. Under the assumption that the limit shape has…
An important aspect of a Euclidean network is its link length distribution, studied in a few real networks so far. We compute the distribution of the link lengths between collaborators whose papers appear in the PhysicalReview Letters (PRL)…
In the subcritical regime Erd\H{o}s-R\'enyi (ER) networks consist of finite tree components, which are non-extensive in the network size. The distribution of shortest path lengths (DSPL) of subcritical ER networks was recently calculated…