scientific article; zbMATH DE number 878897

No author found.

Publication date: 13 January 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Applications of graph theory (05C90) Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (98)

Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph ⋮ A comparative analysis of knowledge acquisition performance in complex networks ⋮ Well-mixing vertices and almost expanders ⋮ Bayesian nonparametric clustering as a community detection problem ⋮ Eigenvalue location in graphs of small clique-width ⋮ Propagation kernels: efficient graph kernels from propagated information ⋮ Graph simplification and matching using commute times ⋮ On the cover time and mixing time of random geometric graphs ⋮ Stochastic strategies for patrolling a terrain with a synchronized multi-robot system ⋮ The access time of random walks on trees with given partition ⋮ Finding hitting times in various graphs ⋮ Tight inequalities among set hitting times in Markov chains ⋮ Variance and Covariance of Distributions on Graphs ⋮ Exact mixing times for random walks on trees ⋮ Sandwich theorem of cover times ⋮ Fault-tolerant aggregation: flow-updating meets mass-distribution ⋮ Quantum walk and its application domains: a systematic review ⋮ The cover times of random walks on random uniform hypergraphs ⋮ A Perron-Frobenius type of theorem for quantum operations ⋮ Spanders: distributed spanning expanders ⋮ A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network ⋮ Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs ⋮ Bounds on the diameter of Cayley graphs of the symmetric group ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ On the mixing time of geographical threshold graphs ⋮ Strategies for parallel unaware cleaners ⋮ Quantum walks for the determination of commutativity of finite dimensional algebras ⋮ The Quantum Complexity of Markov Chain Monte Carlo ⋮ Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions ⋮ Entropic Optimal Transport on Random Graphs ⋮ Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs ⋮ Hitting times for random walks on tricyclic graphs ⋮ Unnamed Item ⋮ An expressive dissimilarity measure for relational clustering using neighbourhood trees ⋮ Offline reinforcement learning with task hierarchies ⋮ On logarithmic asymptotics for the number of restricted partitions in the exponential case ⋮ ADM-CLE Approach for Detecting Slow Variables in Continuous Time Markov Chains and Dynamic Data ⋮ Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties ⋮ The normalized Laplacian spectrum of n -polygon graphs and applications ⋮ Tiling by rectangles and alternating current ⋮ Optimizing node discovery on networks: problem definitions, fast algorithms, and observations ⋮ Cover times, blanket times, and majorizing measures ⋮ Sharp benefit-to-cost rules for the evolution of cooperation on regular graphs ⋮ A Hitting Time Formula for the Discrete Green's Function ⋮ Commute times of random walks on trees ⋮ Static and expanding grid coverage with ant robots: complexity results ⋮ Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph ⋮ Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains ⋮ Scaling in small-world resistor networks ⋮ Connecting polygonizations via stretches and twangs ⋮ Graph clustering ⋮ On the diameter of permutation groups. ⋮ Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees ⋮ Drawing Big Graphs Using Spectral Sparsification ⋮ Random generators of the symmetric group: diameter, mixing time and spectral gap. ⋮ Comparison of multiple random walks strategies for searching networks ⋮ Derandomizing random walks in undirected graphs using locally fair exploration strategies ⋮ Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks ⋮ Deterministic extractors for small-space sources ⋮ Modularity revisited: a novel dynamics-based concept for decomposing complex networks ⋮ On the cover time of \(\lambda\)-biased walk on supercritical Galton-Watson trees ⋮ Density Independent Algorithms for Sparsifying k-Step Random Walks ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ Flips in planar graphs ⋮ Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs ⋮ Analysis of node2vec random walks on networks ⋮ One-dimensional quantum walks with absorbing boundaries ⋮ Fast Low-Cost Estimation of Network Properties Using Random Walks ⋮ On graph parameters guaranteeing fast sandpile diffusion ⋮ The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs ⋮ Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk ⋮ New bounds for randomized busing ⋮ Graph characteristics from the heat kernel trace ⋮ Cutoff phenomena for random walks on random regular graphs ⋮ Random walks between leaves of random networks ⋮ A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem ⋮ Uniform Sampling of Digraphs with a Fixed Degree Sequence ⋮ Edge-disjoint spanning trees and forests of graphs ⋮ Graph Similarity through Entropic Manifold Alignment ⋮ The accessibility of convex bodies and derandomization of the hit and run algorithm ⋮ Exponential Random Graphs as Models of Overlay Networks ⋮ Random walks with long-range steps generated by functions of Laplacian matrices ⋮ Transfer current and pattern fields in spanning trees ⋮ The hitting times of random walks on bicyclic graphs ⋮ On resistance-distance and Kirchhoff index ⋮ The Kusuoka measure and the energy Laplacian on level-\(k\) Sierpiński gaskets ⋮ A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence ⋮ Network navigation with non-Lèvy superdiffusive random walks ⋮ Random Walks, Electric Networks and The Transience Class problem of Sandpiles ⋮ From Ramanujan graphs to Ramanujan complexes ⋮ Spanning 2-forests and resistance distance in 2-connected graphs ⋮ Probing the geometry of data with diffusion Fréchet functions ⋮ Out-of-equilibrium random walks ⋮ Trapping efficiency of random walks on weighted scale-free trees ⋮ Growth in groups: ideas and perspectives ⋮ A polynomial time approximation scheme for computing the supremum of Gaussian processes ⋮ Viral processes by random walks on random regular graphs ⋮ A note on the PageRank of undirected graphs

This page was built for publication: