Random walks and flights over connected graphs and complex networks
From MaRDI portal
Publication:718283
DOI10.1016/j.cnsns.2010.02.016zbMath1221.60069OpenAlexW1989685515MaRDI QIDQ718283
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
Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81) Combinatorial probability (60C99)
Related Items
Phase transition and alternation in a model of perceptual bistability in the presence of Lévy noise, Stochastic forms of non-negative matrices and Perron-regularity, Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case, Representing complex networks without connectivity via spectrum series, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Average weighted trapping time of the node- and edge-weighted fractal networks, Predator-prey games on complex networks, First encounters on Bethe lattices and Cayley trees, Navigation in spatial networks: a survey, Epidemic spreading on hierarchical geographical networks with mobile agents, Knowledge acquisition: a complex networks approach, Circuit Theory and Model-Based Inference for Landscape Connectivity
Cites Work
- Chip-firing games on directed graphs
- Asymptotic series in dynamics of fluid flows: diffusion versus bifurcations
- Random walks and the effective resistance of networks
- On the bipartition of graphs
- Chip-firing games on graphs
- On the hidden beauty of the proper orthogonal decomposition
- Resistance distance and the normalized Laplacian spectrum
- Renormalization group and the Ginzburg-Landau equation
- The spectral geometry of a Riemannian manifold
- Eigenfunctions and nodal sets
- Spatiotemporal analysis of complex signals: Theory and applications
- Combinatorics, Paul Erdős is eighty. Vol. 1
- Spatio-temporal symmetries and bifurcations via bi-orthogonal decompositions
- The electrical resistance of a graph captures its commute and cover times
- Markov chain sensitivity measured by mean first passage times
- Laplacians and the Cheeger inequality for directed graphs
- On determining the eigenprojection and components of a matrix
- The number of large graphs with a positive density of triangles
- Generalized inverses. Theory and applications.
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Lévy flights and related topics in physics. Proceedings of the international workshop, held at Nice, France, 27-30 June, 1994
- High temperature expansions and dynamical systems
- Global large time self-similarity of a thermal-diffusive combustion system with critical nonlinearity
- Nonlinear diffusion through large complex networks containing regular subgraphs
- Complex networks: structure and dynamics
- Random construction of Riemann surfaces
- 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
- Collisions Among Random Walks on a Graph
- Pseudo-Inverses in Associative Rings and Semigroups
- Interlacing for weighted graphs using the normalized Laplacian
- Construction de laplaciens dont une partie finie du spectre est donnée
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
- More on the Souriau–Frame Algorithm and the Drazin Inverse
- Applications of the Drazin Inverse to Linear Systems of Differential Equations with Singular Constant Coefficients
- Renormalization group and asymptotics of solutions of nonlinear parabolic equations
- Universality in Random-Walk Models with Birth and Death
- Collective dynamics of ‘small-world’ networks
- Contributions to the Theory of Generalized Inverses
- On the notion of recurrence in discrete stochastic processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
