Related papers: Levy geometric graphs
We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large-deviation…
We investigate the impact of external periodic potentials on superdiffusive random walks known as Levy flights and show that even strongly superdiffusive transport is substantially affected by the external field. Unlike ordinary random…
Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…
Combinatorial Levy processes evolve on general state spaces of countable combinatorial structures. In this setting, the usual Levy process properties of stationary, independent increments are defined in an unconventional way in terms of the…
(abridged) The large-scale distribution of galaxies is generally analyzed using the two-point correlation function. However, this statistic does not capture the topology of the distribution, and it is necessary to resort to higher order…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…
We present a study of the scaling properties of cluster-cluster aggregation with a source of monomers in the stationary state when the spatial transport of particles occurs by Levy flights. We show that the transition from mean-field…
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…
Given a set of graphs from some unknown family, we want to generate new graphs from that family. Recent methods use diffusion on either graph embeddings or the discrete space of nodes and edges. However, simple changes to embeddings (say,…
Recent experiments on the propagation of light over a distance L through a random packing of spheres with a power law distribution of radii (a socalled L\'evy glass) have found that the transmission probability T \propto 1/L^{\gamma} scales…
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 -…
We consider two stochastic processes, the Gribov process and the general epidemic process, that describe the spreading of an infectious disease. In contrast to the usually assumed case of short-range infections that lead, at the critical…
Token graphs, or symmetric powers of graphs, see \cite{alavi2002survey} and \cite{Fabila-Monroy2012}, are defined on the $k$-combinations of the vertex set of some graph $L$, where edges exist between two such combinations, if their…
We study the statistics of encounters of L\'evy flights by introducing the concept of vicious L\'evy flights - distinct groups of walkers performing independent L\'evy flights with the process terminating upon the first encounter between…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
Many growth processes lead to intriguing stochastic patterns and complex fractal structures which exhibit local scale invariance properties. Such structures can often be described effectively by space-time trajectories of interacting…
A Levy walk is a non-Markovian stochastic process in which the elementary steps of the walker consist of motion with constant speed in randomly chosen directions and for a random period of time. The time of flight is chosen from a…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…