scientific article
From MaRDI portal
zbMath0583.60065arXivmath/0001057MaRDI QIDQ3706275
J. Laurie Snell, Peter G. Doyle
Publication date: 1984
Full work available at URL: https://arxiv.org/abs/math/0001057
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sums of independent random variables; random walks (60G50) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Related Items
A New Method for Computing the Expected Hitting Time between Arbitrary Different Configurations of the Multiple–Urn Ehrenfest Model, Kron Reduction and Effective Resistance of Directed Graphs, Lattice Green/Neumann function for the 2D Laplacian operator defined on square lattice on cylinders, tori and other geometries with some applications, Resistance between two nodes of a ring clique network, Forest formulas of discrete Green's functions, Stability of p‐parabolicity under quasi‐isometries, Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs, On the probabilistic representation of the free effective resistance of infinite graphs, Correction to: ``Exact value of the resistance exponent for four dimensional random walk trace, Unnamed Item, Modeling spatial networks by contact graphs of disk packings, Cosh gradient systems and tilting, A central limit theorem for the mean starting hitting time for a random walk on a random graph, Conditioning continuous-time Markov processes by guiding, 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, Learning system parameters from Turing patterns, Efficiency of transportation on weighted extended Koch networks, Recurrence and transience of symmetric random walks with long-range jumps, Determinant of the finite volume Laplacian, Controlling the spread of infectious diseases by using random walk method to remove many important links, Homogeneous Dirichlet forms on p.c.f. fractals and their spectral asymptotics, Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs, A comfortable graph structure for Grover walk, Crossings states and sets of states in random walks, Hitting times for random walks on tricyclic graphs, La métrica de resistencia efectiva, Geometry and Laplacian on discrete magic carpets, Random walks on dual Sierpinski gaskets, Extremal regime for one-dimensional Mott variable-range hopping, Spanning tree bounds for grid graphs, Unnamed Item, Bandwidth allocation and resource adjustment for stability enhancement in complex networks, A basic model of mutations, Random walk centrality for temporal networks, Integral fluctuation relations for entropy production at stopping times, Analysis of node2vec random walks on networks, Multistate Survival Models as Transient Electrical Networks, The Role of Kemeny's Constant in Properties of Markov Chains, Pathologies of the large-\(N\) limit for \(\mathbb{RP}^{N-1}\), \(\mathbb{CP}^{N-1}\), \(\mathbb{QP}^{N-1}\) and mixed isovector/isotensor \(\sigma\)-models, Passing the Buck and Firing Fibonacci: Adventures with the Stochastic Abacus, Circle packing coordinates for the moduli space of tori, Shuffling biological sequences, Gram matrices of reproducing kernel Hilbert spaces over graphs IV. (Quadratic inequalities for graph Laplacians), A General Framework for Graph Sparsification, Unnamed Item, Random Walks, Electric Networks and The Transience Class problem of Sandpiles, Diffusion processes on small-world networks with distance dependent random links, Calculating effective resistances on underlying networks of association schemes, Discrete analog computing with rotor-routers, The hitting time of random walk on unicyclic graphs, Effective impedance over ordered fields, Determining average path length and average trapping time on generalized dual dendrimer, The problem of deficiency indices for discrete Schrödinger operators on locally finite graphs, Watermelons on the half-plane, Resistance scaling on \(4N\)-carpets, A class of posets with integral Laplacian spectrum, Randomized shortest paths with net flows and capacity constraints, Edge-reinforced random walk on a ladder, On the cover time and mixing time of random geometric graphs, The access time of random walks on trees with given partition, On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain, On the resistance diameter of the Cartesian and lexicographic product of paths, Approximability of identifying codes and locating-dominating codes, The rencontre problem, A discrete random walk on the hypercube, The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network, Effective resistance of random trees, Eigentime identities of flower networks with multiple branches, A linearized circle packing algorithm, Algorithmic techniques for finding resistance distances on structured graphs, Biased random walk on the trace of biased random walk on the trace of \(\dots\), Hitting time quasi-metric and its forest representation, Continuous versus discrete spins in the hyperbolic plane, Recurrence of Markov chain traces, A bag-of-paths framework for network data analysis, Approximate span programs, Computation of resistance distance and Kirchhoff index of the two classes of silicate networks, Beyond good partition shapes: an analysis of diffusive graph partitioning, Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs, On the equivalence of cylinder tilings and planar electric networks, Two-point resistances in the generalized phenylenes, Optimizing node discovery on networks: problem definitions, fast algorithms, and observations, Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph, Statistical inference for disordered sphere packings, Simple random walk on long-range percolation clusters. II: Scaling limits, Scaling in small-world resistor networks, The speed of a biased random walk on a percolation cluster at high density, On the (reverse) cover cost of trees with some given parameters, Diffusion in lattices with anisotropic scatterers., A note on recurrent random walks on graphs., A general framework for nonequilibrium phenomena: The master equation and its formal consequences., On problems related to growth, entropy, and spectrum in group theory, Random walks on graphs and Monte Carlo methods, Random walk in changing environment, A note on circular Markov chains, Effective resistances and spanning trees in the complete bipartite graph plus a matching, On the resistance diameters of graphs and their line graphs, Variational formula of capacity for asymmetric Markov chains, Collisions of several walkers in recurrent random environments, Metastability of hard-core dynamics on bipartite graphs, Spectral theory of infinite quantum graphs, Hubs-biased resistance distances on graphs and networks, Random walk on the high-dimensional IIC, Long term behaviour of a reversible system of interacting random walks, The Dirichlet problem for orthodiagonal maps, On graph parameters guaranteeing fast sandpile diffusion, Minimizing landscape resistance for habitat conservation, A central limit theorem for the effective conductance: linear boundary data and small ellipticity contrasts, The effective resistance of the \(N\)-cycle graph with four nearest neighbors, Coined quantum walks lift the cospectrality of graphs and trees, Hitting times, commute times, and cover times for random walks on random hypergraphs, Supercritical causal maps: geodesics and simple random walk, How does geographical distance translate into genetic distance?, Fixed-size determinantal point processes sampling for species phylogeny, Nonlinear network dynamics with consensus-dissensus bifurcation, Extending transition path theory: periodically driven and finite-time dynamics, The type problem for random walks on trees, Resistances between two nodes of a path network, Symmetry in the Green's function for birth-death chains, Cover time in edge-uniform stochastically-evolving graphs, Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost, Disagreement networks, Sparse randomized shortest paths routing with Tsallis divergence regularization, On the distribution of the hitting time for the \(N\)-urn Ehrenfest model, Laplace and bi-Laplace equations for directed networks and Markov chains, The speed of random walk on Galton-Watson trees with vanishing conductances, Extremal cover cost and reverse cover cost of trees with given segment sequence, Boolean percolation on doubling graphs, The hitting times of random walks on bicyclic graphs, The discrete Laplacian acting on 2-forms and application, Analysis of opinion dynamics under binary exogenous and endogenous signals, Resistance distance in potting networks, On \(p\)-parabolicity of Riemannian manifolds and graphs, A physics perspective on the resistance distance for graphs, The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs, The speed of biased random walk among random conductances, Green's analysis of conducting lattices, On the Kirchhoff index of a graph and the matchings of the subdivision, Effective resistance is more than distance: Laplacians, simplices and the Schur complement, Once reinforced random walk on \(\mathbb{Z}\times\gamma\), Discrete uniformizing metrics on distributional limits of sphere packings, Gossip algorithm for multi-agent systems via random walk, Impatient random walk, Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index, A characterization of effective resistance metrics, Expected hitting times for random walks on the \(k\)-triangle graph and their applications, Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix, Bounds for the global cyclicity index of a general network via weighted majorization, On the Kirchhoff index of graphs with diameter 2, Random walks on discrete point processes, Dumbbell graphs with extremal (reverse) cover cost, Zero-temperature limit of the Kawasaki dynamics for the Ising lattice gas in a large two-dimensional torus, Some two-vertex resistances of nested triangle network, On the effective impedance of finite and infinite networks, Comparison of quenched and annealed invariance principles for random conductance model, Some further results on the maximal hitting times of trees with some given parameters, Birth and death chains on finite trees: computing their stationary distribution and hitting times, Diffusivity in one-dimensional generalized Mott variable-range hopping models, Random infinite squarings of rectangles, Using genetic data to estimate diffusion rates in heterogeneous landscapes, From local averaging to emergent global behaviors: the fundamental role of network interconnections, Random walk on the range of random walk, On constructing rational spanning tree edge densities, A stable marriage of Poisson and Lebesgue, Escape of a uniform random walk from an interval, Maximum likelihood estimator consistency for recurrent random walk in a parametric random environment with finite support, A trace theorem for Dirichlet forms on fractals, Minimal spanning forests, Valleys and the maximum local time for random walk in random environment, Generating functions of waiting times and numbers of visits for random walks on graphs, Metrics of hyperbolic type on bounded fractals, Resistance distance and the normalized Laplacian spectrum, Random walks and the effective resistance sum rules, A discrete Gauss-Green identity for unbounded Laplace operators, and the transience of random walks, On the moments of hitting times for random walks on trees, A Hilbert space approach to effective resistance metric, Non-D-finite excursions in the quarter plane, Parabolic theory of the discrete \(p\)-Laplace operator, Path planning for autonomous mobile robots using the boundary integral equation method, The Gauss-Bonnet operator of an infinite graph, Diffusive limits on the Penrose tiling, Speed of the biased random walk on a Galton-Watson tree, Contour lines of the two-dimensional discrete Gaussian free field, Hyperspherical embedding of graphs and networks in communicability spaces, Image interpretation: mining the visible and syntactic correlation of annotated words, The mean-value property, Scaling limit for a class of gradient fields with nonconvex potentials, Rapid and effective segmentation of 3D models using random walks, Randomized oblivious integral routing for minimizing power cost, A collection of results concerning electric resistance and simple random walk on distance-regular graphs, Random two-component spanning forests, A spectral characterization of the Delaunay triangulation, Random walks on directed covers of graphs, Metric properties of the tropical Abel-Jacobi map, Spectral dimension and random walks on the two dimensional uniform spanning tree, Recent progress on the random conductance model, Cover times, blanket times, and majorizing measures, Rigidity of quasicrystallic and \(Z ^{\gamma }\)-circle patterns, Scaling limit for the random walk on the largest connected component of the critical random graph, Combinatorial bandits, Necessary and sufficient conditions for realizability of point processes, Almost optimal distributed M2M multicasting in wireless mesh networks, Analysing local algorithms in location-aware quasi-unit-disk graphs, Accessibility in complex networks, The cover time of a regular expander is O(n log n), Resistances and currents in infinite electrical networks, Cover time of a random graph with given degree sequence, On limits of graphs sphere packed in Euclidean space and applications, Minimal configurations and sandpile measures, Speed of random walk and resistance, Graph clustering, Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm, Weighted Hardy spaces associated to discrete Laplacians on graphs and applications, Upper bound on the decay of correlations in a general class of \(\mathrm{O}(N)\)-symmetric models, Routing of single-source and multiple-source queries in static sensor networks, 70+ years of the Watson integrals, Random walk on the incipient infinite cluster for oriented percolation in high dimensions, Probabilistic consensus via polling and majority rules, Potential distribution on random electrical networks, Resistance distance-based graph invariants of subdivisions and triangulations of graphs, Myopic models of population dynamics on infinite networks, Submean variance bound for effective resistance of random electric networks, Modularity revisited: a novel dynamics-based concept for decomposing complex networks, Potential induced random teleportation on finite graphs, Effective resistances for supercritical percolation clusters in boxes, Random walks on the lamplighter group, The Eyring-Kramers law for Markovian jump processes with symmetries, Random walks and electrical resistances in products of graphs, Transient random walks in random environment on a Galton-Watson tree, Circle patterns with the combinatorics of the square grid, On the spectrum of a random walk on the discrete Heisenberg group and the norm of Harper's operator, On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum, Phase diagram for once-reinforced random walks on trees with exponential weighting scheme, Minimal subfamilies and the probabilistic interpretation for modulus on graphs, Trigonometrical sums connected with the chiral Potts model, Verlinde dimension formula, two-dimensional resistor network, and number theory, The hitting and cover times of Metropolis walks, Evaluation of effective resistances in pseudo-distance-regular resistor networks, Identities for minors of the Laplacian, resistance and distance matrices, Sum rules for hitting times of Markov chains, Random walks and flights over connected graphs and complex networks, Rapidly growing entire functions with three singular values, Discrete quadratic curvature energies, Biased random walk in a one-dimensional percolation model, Flows in complex networks: theory, algorithms, and application to lennard-Jones cluster rearrangement, Resolvent metric and the heat kernel estimate for random walks, Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\), Transfer current and pattern fields in spanning trees, How likely is Polya's drunkard to stay in \(x\geq y\geq z\)?, Recurrent networks and a theorem of Nash-Williams, Random walks and the effective resistance of networks, Spanning 2-forests and resistance distance in 2-connected graphs, Teichmüller's work on the type problem, On the pseudo-inverse of the Laplacian of a bipartite graph, Weighted norm inequalities for spectral multipliers on graphs, Conformal invariance of domino tiling., Critical exponents for a reversible nearest particle system on the binary tree., Solving Dirichlet and Poisson problems on graphs by means of equilibrium measures, Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent, Further results on the expected hitting time, the cover cost and the related invariants of graphs, Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets, Which values of the volume growth and escape time exponent are possible for a graph?, Quadratic M-convex and L-convex functions, The rapid mixing of random walks defined by an \(n\)-cube, A random walk on \(p\)-adics -- the generator and its spectrum, Broadcasting on trees and the Ising model., Homogenization of a reflecting barrier Brownian motion in a continuum percolation cluster in \(R^ d\), On the range of reversible random walks on \(Z^ 2\) in a random environment, Spectra of graphs and fractal dimensions. II, Schwarz's lemma for circle packings, A fast randomized LOGSPACE algorithm for graph connectivity, Extension of Foster's averaging formula to infinite networks with moderate growth, Hyperbolic and parabolic packings, Random walks on binary strings applied to the somatic hypermutation of B-cells, A spectrum of time-space trade-offs for undirected \(s-t\) connectivity, On the bass note of a Schottky group, Random-cluster measures and uniform spanning trees, The range of random walk on trees and related trapping problem, Potentials on the hexagonal grid, Random walks on graphs, electric networks and fractals, Shorted operators: An application in potential theory, Phase transition for the once-reinforced random walk on \(\mathbb{Z}^{d}\)-like trees, Border aggregation model, Symmetric Markov chains in \({\mathbb{Z}}^ 4:\) How fast can they move?, Generalized bicycles, Spectra of graphs and fractal dimensions. I, Geometry of complex networks and topological centrality, Efficient approximate solution of sparse linear systems, Computing potentials on a periodic bidimensional grid, Random walks on edge transitive graphs, A note on expected hitting times for birth and death chains, The electrical resistance of a graph captures its commute and cover times, Collecting coupons on trees, and the cover time of random walks, Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges, Random walks and diffusion on networks, The resistance perturbation distance: a metric for the analysis of dynamic networks, Fractal dimensions and random walks on random trees., Moran's genetics model via electric networks., A note on using the resistance-distance matrix to solve Hamiltonian cycle problem, The expected hitting times for graphs with cutpoints., Dimensions of random trees., Information flow on trees, Some bounds for the Kirchhoff index of graphs, A proof of the transfer-current theorem in absence of reversibility, Resistance between two vertices of almost complete bipartite graphs, Dual graphs and modified Barlow-Bass resistance estimates for repeated barycentric subdivisions, Electrical networks with prescribed current and applications to random walks on graphs, Canonical measures on metric graphs and a Kazhdan's theorem, The adjacency matrix and the discrete Laplacian acting on forms, Transience and recurrence of random walks on percolation clusters in an ultrametric space, Scaling limits for sub-ballistic biased random walks in random conductances, Growth exponent for loop-erased random walk in three dimensions, Performance of leader-follower multi-agent systems in directed networks, Area growth and Green's function of Riemann surfaces, A bound for the covering time of random walks on graphs, Modulus metrics on networks, Brownian motion on a homogeneous fractal, Quantum walks: a comprehensive review, Singularity analysis, Hadamard products, and tree recurrences, Efficiency test of pseudorandom number generators using random walks, Metastability in reversible diffusion processes. I: Sharp asymptotics for capacities and exit times, The short-cut test, Centrality measure in graphs, The infinite valley for a recurrent random walk in random environment, An introduction to metastability through random walks, Developments in the theory of randomized shortest paths with a comparison of graph node distances, Mean first passage time for random walk on dual structure of dendrimer, Unbounded operators in Hilbert space, duality rules, characteristic projections, and their applications, Unboundedness of adjacency matrices of locally finite graphs, On hitting times of random walks on trees, Conservative and semiconservative random walks: recurrence and transience, The homogenization problem for Vicsek set, Tilings and discrete Dirichlet problems, The combinatorics of effective resistances and resistive inverses, Combinatorial modulus and type of graphs, An introduction to covering problems for random walks on graphs, Local times for Brownian motion on the Sierpinski carpet, Random walks on a finite graph with congestion points, Resistance bounds for first-passage percolation and maximum flow, The Alexander-Orbach conjecture holds in high dimensions, Non-uniform random spanning trees on weighted graphs, Random walk models for top-\(N\) recommendation task, Directional decay of the Green's function for a random nonnegative potential on \(\mathbb{Z}^d\), Proportional fairness and its relationship with multi-class queueing networks, Conditions for recurrence and transience of a Markov chain on \(\mathbb Z^ +\) and estimation of a geometric success probability., More on random walks, electrical networks, and the harmonic \(k\)-server algorithm., Functional central limit theorem for a random walk in a random environment, Unpredictable paths and percolation, Nearest-neighbor walks with low predictability profile and percolation in \(2+\varepsilon\) dimensions, Modelling transport in disordered media via diffusion on fractals., Green function estimates and their applications to the intersections of symmetric random walks, Basic analytic combinatorics of directed lattice paths, Green functions on self-similar graphs and bounds for the spectrum of the Laplacian, Morphisms and currents in infinite nonlinear resistive networks, Resistance dimension, random walk dimension and fractal dimension, Conditional negative association for competing urns, THE SPEED OF RANDOM WALKS ON TREES AND ELECTRIC NETWORKS, Two-point resistances and random walks on stellated regular graphs, Unnamed Item, Estimating entropy production rates with first-passage processes, Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time, Frames and factorization of graph Laplacians, Un théorème limite central local en environnement aléatoire stationnaire de conductances sur Z, An electrical gridlike structure excited at infinity, The Hitting Time of Multiple Random Walks, A stochastic process on a network with connections to Laplacian systems of equations, A mechanically-based proof of the arithmetic mean harmonic mean inequality, Current trends in asymptotics: Some problems and some solutions, Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains, Variance and Covariance of Distributions on Graphs, Circle packings in the approximation of conformal mappings, Resistance distance distribution in large sparse random graphs, The first two cacti with larger multiplicative eccentricity resistance-distance, The magnetic discrete Laplacian inferred from the Gauß-Bonnet operator and application, Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure, An Electric Network for Nonreversible Markov Chains, Heat kernels on infinite graph networks and deformed Sierpinski gaskets, Extremal hitting times of trees with some given parameters, A Markov chain identity and monotonicity of the diffusion constants for a random walk in a heterogeneous environment, Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach, Average Resistance of Toroidal Graphs, Incremental Computation of Pseudo-Inverse of Laplacian, On the Cover Time of the Emerging Giant, Geometric bounds for convergence rates of averaging algorithms, An Extension of Foster's Network Theorem, Metastable Markov chains, Blocking duality for \(p\)-modulus on networks and applications, NON-UNIFORM MIXING OF QUANTUM WALK ON CYCLES, Symmetric Walks on Paths and Cycles, TWO-POINT RESISTANCES IN SAILBOAT FRACTAL NETWORKS, Recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices, Fractional random walk lattice dynamics, Commute times for a directed graph using an asymmetric Laplacian, Tiling by rectangles and alternating current, Unnamed Item, Biased random walk in positive random conductances on \(\mathbb{Z}^{d}\), Percolation in the hyperbolic plane, Simplicial complexes: Spectrum, homology and random walks, Exploiting Cluster-Structure to Predict the Labeling of a Graph, Two-Point Resistance of a Non-Regular Cylindrical Network with a Zero Resistor Axis and Two Arbitrary Boundaries*, A recursion formula for resistance distances and its applications, Topological groups and recurrence of quasi transitive graphs, Global properties of Dirichlet forms on discrete spaces, Limit theorems for random walks under irregular conductance, On a new cyclicity measure of graphs -- the global cyclicity index, A graph counterexample to Davies' conjecture, Loop-erased walks and total positivity, Localization for linearly edge reinforced random walks, Oliver Heaviside: an accidental time traveller, Exact results for the first-passage properties in a class of fractal networks, On hitting times for a simple random walk on dense Erdös-Rényi random graphs, Extrema of the Two-Dimensional Discrete Gaussian Free Field, Bounded outdegree and extremal length on discrete Riemann surfaces, The cover time of random geometric graphs, Density Independent Algorithms for Sparsifying k-Step Random Walks, Existence and uniqueness of diffusions on finitely ramified self-similar fractals, The Cover Time of Cartesian Product Graphs, Sum rules for effective resistances in infinite graphs, The generating functions of hitting times for random walk on trees, Hitting times for random walks on subdivision and triangulation graphs, On circuit chains defined by forward and backward passages, Harmonic Extension on The Point Cloud, Random environment on coloured trees, Component structure of the vacant set induced by a random walk on a random graph, Resistance dimensions of branching processes in varying environments trees, A central limit theorem for biased random walks on Galton-Watson trees, Rough Isometries and Dirichlet Finite Harmonic Functions on Graphs, A probabilistic proof of Thurston's conjecture on circle packings, Metastability under stochastic dynamics, Proof of Aldous’ spectral gap conjecture, On the recurrence of edge-reinforced random walk on \(\mathbb Z \times G\), Negative correlation and log-concavity, Transfinite Graphs and Electrical Networks, Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters, Unnamed Item, Expected Lifetime and Capacity, Combinatorics Encoding Geometry: The Legacy of Bill Thurston in the Story of One Theorem, Boundary partitions in trees and dimers, Untying the Gordian Knot via Experimental Mathematics, On the notion of effective impedance, Unnamed Item, On the perturbation of a uniform tiling with resistors, A New Approach to Laplacian Solvers and Flow Problems, Recursive calculation of effective resistances in distance-regular networks based on Bose–Mesner algebra and Christoffel–Darboux identity, Biased random walks on random graphs, Negative association in uniform forests and connected graphs, Improved approximation of the minimum cover time, A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities, Spectral homogenization of reversible random walks on \(\mathbb Z^d\) in a random environment., Distance matrix and Laplacian of a tree with attached graphs, Remarks on perturbation of infinite networks of identical resistors, Analytic and geometric background of recurrence and non-explosion of the Brownian motion on Riemannian manifolds, A Counterexample to the Conjecture of Woess on Simple Random Walks on Trees, Diffusions on graphs, Poisson problems and spectral geometry, Resistance forms, quasisymmetric maps and heat kernel estimates
