Random walks and flights over connected graphs and complex networks

DOI10.1016/J.CNSNS.2010.02.016zbMATH Open1221.60069OpenAlexW1989685515MaRDI QIDQ718283FDOQ718283

D. Kharzeev

Publication date: 23 September 2011

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2010.02.016

Recommendations

• Random walks on graphs: ideas, techniques and results
• Random walks and diffusions on graphs and databases. An introduction.
• Markov chain methods for analyzing urban networks
• Random walks and diffusion on networks
• Random walks with long-range steps generated by functions of Laplacian matrices

zbMATH Keywords

graph theoryrandom walkscomplex networkselectrical networks[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=L%EF%BF%BD%EF%BF%BDvy+flights&go=Go L��vy flights]

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81) Combinatorial probability (60C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complex networks: structure and dynamics
• Title not available (Why is that?)
• Collective dynamics of ‘small-world’ networks
• Generalized inverses. Theory and applications.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the notion of recurrence in discrete stochastic processes
• Chip-firing games on graphs
• Eigenfunctions and nodal sets
• Global large time self-similarity of a thermal-diffusive combustion system with critical nonlinearity
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• Renormalization group and asymptotics of solutions of nonlinear parabolic equations
• Title not available (Why is that?)
• Resistance distance and the normalized Laplacian spectrum
• The spectral geometry of a Riemannian manifold
• Laplacians and the Cheeger inequality for directed graphs
• On determining the eigenprojection and components of a matrix
• Pseudo-Inverses in Associative Rings and Semigroups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Chip-firing games on directed graphs
• Renormalization group and the Ginzburg-Landau equation
• High temperature expansions and dynamical systems
• Title not available (Why is that?)
• Construction de laplaciens dont une partie finie du spectre est donnée
• Random walks and the effective resistance of networks
• Applications of the Drazin Inverse to Linear Systems of Differential Equations with Singular Constant Coefficients
• On the bipartition of graphs
• Spatiotemporal analysis of complex signals: Theory and applications
• Collisions Among Random Walks on a Graph
• On the matrix equation \(Ax =\lambda Bx\)
• On the group-inverse of a linear transformation
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Lévy flights and related topics in physics. Proceedings of the international workshop, held at Nice, France, 27-30 June, 1994
• On the hidden beauty of the proper orthogonal decomposition
• The electrical resistance of a graph captures its commute and cover times
• Title not available (Why is that?)
• Contributions to the Theory of Generalized Inverses
• Spatio-temporal symmetries and bifurcations via bi-orthogonal decompositions
• Random construction of Riemann surfaces
• Graph Laplacians, nodal domains, and hyperplane arrangements
• Interlacing for weighted graphs using the normalized Laplacian
• Title not available (Why is that?)
• Markov chain sensitivity measured by mean first passage times
• Combinatorics, Paul Erdős is eighty. Vol. 1
• The number of large graphs with a positive density of triangles
• Nonlinear diffusion through large complex networks containing regular subgraphs
• Title not available (Why is that?)
• More on the Souriau–Frame Algorithm and the Drazin Inverse
• Title not available (Why is that?)
• Universality in Random-Walk Models with Birth and Death
• Title not available (Why is that?)
• Asymptotic series in dynamics of fluid flows: diffusion versus bifurcations

Cited In (16)

• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• Markov chain methods for analyzing urban networks
• First encounters on Bethe lattices and Cayley trees
• Navigation in spatial networks: a survey
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Epidemic spreading on hierarchical geographical networks with mobile agents
• Circuit Theory and Model-Based Inference for Landscape Connectivity
• Representing complex networks without connectivity via spectrum series
• Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
• Knowledge acquisition: a complex networks approach
• Discrete-time random walks and Lévy flights on arbitrary networks: when resetting becomes advantageous?
• Stochastic forms of non-negative matrices and Perron-regularity
• Phase transition and alternation in a model of perceptual bistability in the presence of Lévy noise
• Resistance distances in stretched Cantor product networks
• Random walks on weighted networks: a survey of local and non-local dynamics
• Predator-prey games on complex networks

This page was built for publication: Random walks and flights over connected graphs and complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q718283)