Related papers: Levy geometric graphs
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…
We discuss a category of graphs, recursive clique trees, which have small-world and scale-free properties and allow a fine tuning of the clustering and the power-law exponent of their discrete degree distribution. We determine relevant…
We generalize the technique of linked cluster expansions on hypercubic lattices to actions that couple fields at lattice sites which are not nearest neighbours. We show that in this case the graphical expansion can be arranged in such a way…
L\'evy walks (LWs) are spatiotemporally coupled random-walk processes describing superdiffusive heat conduction in solids, propagation of light in disordered optical materials, motion of molecular motors in living cells, or motion of…
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…
Structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically.…
Many real-world networks were found to be highly clustered, and contain a large amount of small cliques. We here investigate the number of cliques of any size k contained in a geometric inhomogeneous random graph: a scale-free network model…
We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways in which diffusion in scale-free graphs is special. Most…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
The study of self-propelled particles is a fast-growing research topic where biologically inspired movement is increasingly becoming of much interest. A relevant example is the collective motion of social insects, whose variety and…
We consider random walks on several classes of graphs and explore the likely structure of the vacant set, i.e. the set of unvisited vertices. Let \Gamma(t) be the subgraph induced by the vacant set of the walk at step t. We show that for…
We study scale free simple graphs with an exponent of the degree distribution $\gamma$ less than two. Generically one expects such extremely skewed networks -- which occur very frequently in systems of virtually or logically connected units…
The diffusion of a walk in the presence of traps is investigated. Different diffusion regimes are obtained considering the magnitude of the fluctuations in waiting times and jump distances. A constant velocity during the jump motion is…
We consider a particle performing a stochastic motion on a one-dimensional lattice with jump widths distributed according to a power-law with exponent $\mu + 1$. Assuming that the walker moves in the presence of a distribution $a(x)$ of…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
Edwards et al question aspects of the methods used in two of our published papers that report results showing Levy walk like and Levy flight movement patterns of marine predators.The criticisms are focused on the applicability of some…
The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective…
The ordinary Levy motion is a random process whose stationary independent increments are statistically self-affine and distributed with a stable probability law characterized by the Levy index alpha, 0 < alpha < 2. The divergence of…
We introduce a formalism of fractional diffusion on networks based on a fractional Laplacian matrix that can be constructed directly from the eigenvalues and eigenvectors of the Laplacian matrix. This fractional approach allows random walks…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…