The distribution of path lengths of self avoiding walks on Erdős–Rényi networks

@article{Tishby2016TheDO,
  title={The distribution of path lengths of self avoiding walks on Erdős–R{\'e}nyi networks},
  author={Ido Tishby and Ofer Biham and Eytan Katzav},
  journal={Journal of Physics A},
  year={2016},
  volume={49},
  pages={285002}
}
We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning the network. The walkers hop between neighboring nodes, until they reach a dead-end node from which they cannot proceed. Focusing on Erdős–Renyi networks we show that the pruned networks maintain a Poisson degree distribution, , with an average degree, , that… Expand
The distribution of first hitting times of random walks on directed Erdős–Rényi networks
We present analytical results for the distribution of first hitting times of random walkers (RWs) on directed Erdős-Renyi (ER) networks. Starting from a random initial node, a random walker hopsExpand
The distribution of first hitting times of randomwalks on Erdős–Rényi networks
Analytical results for the distribution of first hitting times of random walks on Erd\H{o}s-R\'enyi networks are presented. Starting from a random initial node, a random walker hops between adjacentExpand
The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks
We present analytical results for the distribution of first hitting times of non-backtracking random walks on finite Erd\H{o}s-R\'enyi networks of $N$ nodes.The walkers hop randomly between adjacentExpand
Self-avoiding walks and connective constants in clustered scale-free networks.
TLDR
Self-avoiding walks (SAWs) in clustered scale-free networks, characterized by a degree distribution of the form P(k)∼k^{-γ} for large k, are studied, finding that the average number of SAWs a_{n} is larger for clustered networks than for unclustered ones with the same degree distribution. Expand
Self-avoiding pruning random walk on signed network
TLDR
This work proposes a Self-Avoiding Pruning Pruning (SAP) random walk on a signed network to model e.g. a user's purchase activity on asigned products network to inspire the design of recommender systems regarding how recommendations and competitions may influence consumers' purchases and products' popularity. Expand
Distribution of shortest path lengths in subcritical Erdős-Rényi networks.
TLDR
A topological expansion is used to perform a systematic analysis of the degree distribution and the distribution of shortest path lengths (DSPL) on components of given sizes and topologies in subcritical Erdős-Rényi (ER) networks and obtains an exact analytical expression for the DSPL of the entire subcritical network, in the asymptotic limit. Expand
A new method for quantifying network cyclic structure to improve community detection
TLDR
This paper introduces renewal non-backtracking random walks (RNBRW) as a way of quantifying this structure and gives simulation results showing that pre-weighting edges through RNBRW may substantially improve the performance of common community detection algorithms. Expand
Revealing the microstructure of the giant component in random graph ensembles.
TLDR
By using the degree distribution on the giant component one obtains high quality results for these properties, which can be further improved by taking the degree-degree correlations into account, which suggests that many existing methods, currently used for the analysis of the whole network, can be adapted in a straightforward fashion to yield results conditioned on the Giant component. Expand
Unsolved Lattice Path Problems in Computational Science II
Lattice path enumeration and its applications have been studied by researchers in many areas such as computer science, mathematics, biology, physics, chemistry and statistics. They are related toExpand
Enhancing Path Reliability against Sybil Attack by Improved Multi-Path-Trees in SDN
TLDR
An improved Multi-Path-Trees (iMPT) algorithm is proposed which performs a review of Sybil nodes by calculating node reliability and uses a partial re-routing method to avoid incorrect deletion of routing paths on the multi-path tree. Expand
...
1
2
...

References

SHOWING 1-10 OF 47 REFERENCES
Analytical results for the distribution of shortest path lengths in random networks
We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdos-R\'enyi networks, based on recursion equations for the shells around a referenceExpand
Self-avoiding walks on scale-free networks.
  • C. Herrero
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
TLDR
Long-range properties of random SAW's on scale-free networks, characterized by a degree distribution P(k) approximately k(-gamma), and the dependence of alpha on the minimum allowed degree in the network are discussed. Expand
Self-avoiding walks and connective constants in small-world networks.
TLDR
This work considers networks generated by rewiring links in one- and two-dimensional regular lattices by means of self-avoiding walks and derives results agreeing with each other for small p and differ for p close to 1, because of the different connectivity distributions resulting in both cases. Expand
A model of self-avoiding random walks for searching complex networks
TLDR
An analytical model is proposed to estimate the average search length of a SAW when used to locate a resource in a network, which is a mean-field model, whose applicability to real networks is validated by simulation. Expand
Kinetic growth walks on complex networks
Kinetically grown self-avoiding walks on various types of generalized random networks have been studied. Networks with short- and long-tailed degree distributions P(k) were considered (k, degree orExpand
First-passage properties of the Erdos Renyi random graph
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdős–Renyi random graph. We develop an effective medium approximation that predicts that the meanExpand
Kinetic-growth self-avoiding walks on small-world networks
Abstract.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 isExpand
Exploring complex networks through random walks.
  • L. D. Costa, G. Travieso
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
TLDR
This article considers random, Barabási-Albert (BA), and geographical network models with varying connectivity explored by three types of random walks: traditional, preferential to untracked edges, and preferential to unvisited nodes to derive results on node and edge coverage efficiency. Expand
Effective number of accessed nodes in complex networks.
TLDR
Results are reported regarding the properties of accessibility, including its relationship with the average minimal time to visit all nodes reachable after h steps along a random walk starting from a source, as well as the number of nodes that are visited after a finite period of time. Expand
Self-avoiding walk enumeration via the lace expansion
We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an algorithmic improvement, called the two-step method, for self-avoiding walkExpand
...
1
2
3
4
5
...