Related papers: Levy geometric graphs
A generalized Fourier analysis on arbitrary graphs calls for a detailed knowledge of the eigenvectors of the graph Laplacian. Using the symmetries of the Cayley tree, we recursively construct the family of eigenvectors with exponentially…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…
Can one hear the 'sound' of a growing network? We address the problem of recognizing the topology of evolving biological or social networks. Starting from percolation theory, we analytically prove a linear inverse relationship between two…
L\'{e}vy walk is a practical model and has wide applications in various fields. Here we focus on the effect of an external constant force on the L\'{e}vy walk with the exponent of the power-law distributed flight time $\alpha\in(0,2)$. We…
Anomalous diffusion processes, in particular superdiffusive ones, are known to be efficient strategies for searching and navigation by animals and also in human mobility. One way to create such regimes are L\'evy flights, where the walkers…
The pseudo-inverse of a graph Laplacian matrix, denoted as $L^\dagger$, finds extensive application in various graph analysis tasks. Notable examples include the calculation of electrical closeness centrality, determination of Kemeny's…
Scaled relative graphs were recently introduced to analyze the convergence of optimization algorithms using two dimensional Euclidean geometry. In this paper, we connect scaled relative graphs to the classical theory of input/output…
We report on the emergence of scaling laws in the temporal evolution of the daily closing values of the S\&P 500 index prices and its modeling based on the L\'evy flights in two dimensions (2D). The efficacy of our proposed model is…
We characterise the convergence of a certain class of discrete time Markov processes toward locally Feller processes in terms of convergence of associated operators. The theory of locally Feller processes is applied to L\'evy-type processes…
Local convergence techniques have become a key methodology to study sparse random graphs. However, convergence of many random graph properties does not directly follow from local convergence. A notable, and important, such random graph…
Properties of random and fluctuating systems are often studied through the use of Gaussian distributions. However, in a number of situations, rare events have drastic consequences, which can not be explained by Gaussian statistics.…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
Every quantum Levy process with a bounded stochastic generator is shown to arise as a strong limit of a family of suitably scaled quantum random walks.
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…
We consider a one dimensional asymmetric random walk whose jumps are identical, independent and drawn from a distribution \phi(\eta) displaying asymmetric power law tails (i.e. \phi(\eta) \sim c/\eta^{\alpha +1} for large positive jumps and…
We are interested in modeling Darwinian evolution resulting from the interplay of phenotypic variation and natural selection through ecological interactions. The population is modeled as a stochastic point process whose generator captures…
Large graphs can be found in a wide array of scientific fields ranging from sociology and biology to scientometrics and computer science. Their analysis is by no means a trivial task due to their sheer size and complex structure. Such…
The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition. At the gelation point, this…
We consider stochastic systems involving general -- non-Gaussian and asymmetric -- stable processes. The random quantities, either a stochastic force or a waiting time in a random walk process, explicitly depend on the position. A…
The Slicer Map is a one-dimensional non-chaotic dynamical system that shows sub-, super-, and normal diffusion as a function of its control parameter. In a recent paper [Salari et al., CHAOS 25, 073113 (2015)] it was found that the moments…