scientific article; zbMATH DE number 3163289

Cited in

(only showing first 100 items - show all)

The Alexander-Orbach conjecture holds in high dimensions
Random walks on graphs, electric networks and fractals
Spectra of graphs and fractal dimensions. I
On multiple circuit chains with a countable infinity of states
Classification of infinite networks and its application
Morphisms and currents in infinite nonlinear resistive networks
Random walk on the infinite cluster of the percolation model
Spectra of graphs and fractal dimensions. II
Subharmonic functions on graphs
Fractal dimensions and random walks on random trees.
Dimensions of random trees.
Random walks on trees and the law of iterated logarithm
Further results on the expected hitting time, the cover cost and the related invariants of graphs
Monopoles, dipoles, and harmonic functions on Bratteli diagrams
Transience and recurrence of random walks on percolation clusters in an ultrametric space
Metastability in reversible diffusion processes. I: Sharp asymptotics for capacities and exit times
Strong isoperimetric inequality for the edge graph of a tiling of the plane
Conditions for recurrence and transience of a Markov chain on \(\mathbb Z^ +\) and estimation of a geometric success probability.
Green functions on self-similar graphs and bounds for the spectrum of the Laplacian
Extension of Foster's averaging formula to infinite networks with moderate growth
Circuit duality for recurrent Markov processes
A note on recurrent random walks on graphs.
Induced graphs of uniform spanning forests
Effective resistance is more than distance: Laplacians, simplices and the Schur complement
Dumbbell graphs with extremal (reverse) cover cost
Some two-vertex resistances of nested triangle network
The local limit of uniform spanning trees
Book review of: L. Lovász, Graphs and geometry
A discrete random walk on the hypercube
Recurrence of Markov chain traces
Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
Tuned communicability metrics in networks. The case of alternative routes for urban traffic
Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
On the (reverse) cover cost of trees with some given parameters
On the resistance diameters of graphs and their line graphs
On graph parameters guaranteeing fast sandpile diffusion
The type problem for random walks on trees
Resistances between two nodes of a path network
Expected hitting times for random walks on the \(k\)-triangle graph and their applications
Recurrence of random walk traces
Harmonic means
A recursion formula for resistance distances and its applications
Resistance dimensions of branching processes in varying environments trees
Extensions of amenable groups by recurrent groupoids
Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach
Hitting time, resistance distance and Kirchhoff index of Cayley graphs over dicyclic and semi-dihedral groups
On transience of card shuffling
A compositional framework for Markov processes
Extrema of the two-dimensional discrete Gaussian free field
Random walk on the Speiser graph of a Riemann surface
Combinatorics encoding geometry: the legacy of Bill Thurston in the story of one theorem
Frames and factorization of graph Laplacians
On the growth function of circuit processes
Some potential-theoretic techniques in non-reversible Markov chains
A discrete Gauss-Green identity for unbounded Laplace operators, and the transience of random walks
Harmonic functions on infinite graphs
A Counterexample to the Conjecture of Woess on Simple Random Walks on Trees
Transfinite Graphs and Electrical Networks
An Electric Network for Nonreversible Markov Chains
Amenability of groups and G-sets
Hitting times for random walks on subdivision and triangulation graphs
Expected hitting times for random walks on quadrilateral graphs and their applications
Potential distribution on random electrical networks
Resistance distance-based graph invariants of subdivisions and triangulations of graphs
Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
Some criteria for circle packing types and combinatorial Gauss-Bonnet theorem
Non-homogeneous random walks with stochastic resetting: an application to the Gillis model
Extremal hitting times of trees with some given parameters
Some results and problems for anisotropic random walks on the plane
Random walks, electric networks and the transience class problem of sandpiles
Exploring the Gillis model: a discrete approach to diffusion in logarithmic potentials
BIHARMONIC GREEN FUNCTION AND BISUPERMEDIAN ON INFINITE NETWORKS
Lattice Green/Neumann function for the 2D Laplacian operator defined on square lattice on cylinders, tori and other geometries with some applications
Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron
A Hilbert space approach to effective resistance metric
Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix
Computation of resistance distance with Kirchhoff index of body centered cubic structure
Recurrence and transience of symmetric random walks with long-range jumps
Delta-functions on recurrent random walks
A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
Spectral dimension and random walks on the two dimensional uniform spanning tree
Amenability of bounded automata groups on infinite alphabets
Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
Laplacian operator and its square lattice discretization: Green function vs. lattice Green function for the flat 2-torus and other related 2D manifolds
Computation of resistance distances in a sub-divided cyclic silicate network and applications
Resistance distance in generalized core-satellite graphs
Random walks on the lamplighter group
Maximal polyomino chains with respect to the Kirchhoff index
Mathematical analysis of resistance distance with Kirchhoff index in chain octahedron structure
On the resistance distance and Kirchhoff index of K_n-chain(ring) network
Capacity of infinite graphs over non-Archimedean ordered fields
Strongly subharmonic functions, graphs, and their asymptotic growth
Number of spanning trees in a wheel graph with two identified vertices via hitting times
Recurrent networks and a theorem of Nash-Williams
Harmonic analysis invariants for infinite graphs via operators and algorithms
On the average hitting times of the squares of cycles
Some further results on the maximal hitting times of trees with some given parameters
Resistances and currents in infinite electrical networks
On transience of circuit processes
Critical random graphs: Diameter and mixing time

This page was built for publication:

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