Network Essence: PageRank Completion and Centrality-Conforming Markov Chains

DOI10.1007/978-3-319-44479-6_31zbMath1423.68062arXiv1708.07906MaRDI QIDQ4604398

Shang-Hua Teng

Publication date: 26 February 2018

Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.07906

Mathematics Subject Classification ID

01A70: Biographies, obituaries, personalia, bibliographies

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

68-03: History of computer science

68M11: Internet topics

Related Items

Unnamed Item

Uses Software

• MESHPART

Cites Work

• 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
• Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel
• Spectral partitioning works: planar graphs and finite element meshes
• The catline for deep regression
• The geometry of graphs and some of its algorithmic applications
• A subexponential bound for linear programming
• Regression depth and center points.
• The centrality index of a graph
• Cores of convex games
• Non-cooperative games
• A new status index derived from sociometric analysis
• An Axiomatic Approach to Community Detection
• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
• Graph limits and parameter testing
• Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
• Spectral Sparsification of Graphs
• Settling the complexity of computing two-player Nash equilibria
• An axiomatic approach to personalized ranking systems
• Using PageRank to Locally Partition a Graph
• Geometric Mesh Partitioning: Implementation and Experiments
• The centrality of groups and classes
• Random walks in a convex body and an improved volume algorithm
• Separators for sphere-packings and nearest neighbor graphs
• Geometric Separators for Finite-Element Meshes
• Approximate Undirected Maximum Flows in O(mpolylog(n)) Time
• Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality
• The Complexity of Computing a Nash Equilibrium
• A Generalization of Radon's Theorem
• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
• A unified framework for approximating and clustering data
• Local Computation of PageRank Contributions
• A Nearly-m log n Time Solver for SDD Linear Systems
• A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
• Synchronization in Network Structures: Entangled Topology as Optimal Architecture for Network Design
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Scalable Algorithms for Data and Network Analysis
• Finding Endogenously Formed Communities
• Equilibrium points in n -person games
• Networks
• College Admissions and the Stability of Marriage