The following pages link to (Q4878667):
Displaying 46 items.
- Graph simplification and matching using commute times (Q2373488) (← links)
- On the cover time and mixing time of random geometric graphs (Q2373731) (← links)
- Fault-tolerant aggregation: flow-updating meets mass-distribution (Q2401680) (← links)
- Quantum walks for the determination of commutativity of finite dimensional algebras (Q2423567) (← links)
- Tiling by rectangles and alternating current (Q2431255) (← links)
- On the diameter of permutation groups. (Q2445317) (← links)
- Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees (Q2447331) (← links)
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem (Q2503284) (← links)
- Finding hitting times in various graphs (Q2637378) (← links)
- Quantum walk and its application domains: a systematic review (Q2668386) (← links)
- Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph (Q2699793) (← links)
- ADM-CLE Approach for Detecting Slow Variables in Continuous Time Markov Chains and Dynamic Data (Q2964446) (← links)
- Uniform Sampling of Digraphs with a Fixed Degree Sequence (Q3057627) (← links)
- Tight inequalities among set hitting times in Markov chains (Q3190216) (← links)
- A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network (Q3497747) (← links)
- The Quantum Complexity of Markov Chain Monte Carlo (Q3507468) (← links)
- Exponential Random Graphs as Models of Overlay Networks (Q3621156) (← links)
- Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties (Q4602783) (← links)
- The accessibility of convex bodies and derandomization of the hit and run algorithm (Q4604053) (← links)
- Drawing Big Graphs Using Spectral Sparsification (Q4625115) (← links)
- Graph Similarity through Entropic Manifold Alignment (Q4689636) (← links)
- Random walks with long-range steps generated by functions of Laplacian matrices (Q4964566) (← links)
- A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence (Q4985352) (← links)
- From Ramanujan graphs to Ramanujan complexes (Q4993492) (← links)
- Density Independent Algorithms for Sparsifying k-Step Random Walks (Q5002617) (← links)
- Out-of-equilibrium random walks (Q5005034) (← links)
- Trapping efficiency of random walks on weighted scale-free trees (Q5006965) (← links)
- Well-mixing vertices and almost expanders (Q5039232) (← links)
- Variance and Covariance of Distributions on Graphs (Q5075836) (← links)
- Analysis of node2vec random walks on networks (Q5161172) (← links)
- Growth in groups: ideas and perspectives (Q5254458) (← links)
- A Hitting Time Formula for the Discrete Green's Function (Q5366895) (← links)
- Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks (Q5391132) (← links)
- Random Walks, Electric Networks and The Transience Class problem of Sandpiles (Q5743503) (← links)
- Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk (Q5743552) (← links)
- Fast Low-Cost Estimation of Network Properties Using Random Walks (Q5856437) (← links)
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
- (Q5875523) (← links)
- Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph (Q5880205) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs (Q6055380) (← links)
- Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Entropic Optimal Transport on Random Graphs (Q6148350) (← links)
- Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs (Q6157968) (← links)
- On logarithmic asymptotics for the number of restricted partitions in the exponential case (Q6188082) (← links)
