Network Essence: PageRank Completion and Centrality-Conforming Markov Chains

Jiři Matousek (1963–2015) had many breakthrough contributions in mathematics and algorithm design. His milestone results are not only profound but also elegant. By going beyond the original objects—such as Euclidean spaces or linear programs—Jirka found the essence of the challenging mathematical/algorithmic problems as well as beautiful solutions that were natural to him, but were surprising discoveries to the field.

[1]  David Eppstein,et al.  Approximating center points with iterated radon points , 1993, SCG '93.

[2]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[3]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[4]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[5]  D. Spielman,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[6]  Edoardo M. Airoldi,et al.  Stochastic blockmodel approximation of a graphon: Theory and consistent estimation , 2013, NIPS.

[7]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[8]  Shang-Hua Teng,et al.  Scalable Algorithms for Data and Network Analysis , 2016, Found. Trends Theor. Comput. Sci..

[9]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[10]  Gary L. Miller,et al.  Separators for sphere-packings and nearest neighbor graphs , 1997, JACM.

[11]  K. Arrow,et al.  Social Choice and Individual Values , 1951 .

[12]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[13]  Jirí Matousek,et al.  Approximations and optimal geometric divide-and-conquer , 1991, STOC '91.

[14]  Emmanuel Abbe,et al.  Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters , 2015, NIPS.

[15]  Katherine Faust.  Centrality in affiliation networks , 1997 .

[16]  Gary L. Miller,et al.  A Nearly-m log n Time Solver for SDD Linear Systems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[17]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[18]  Shang-Hua Teng,et al.  Spectral Sparsification of Graphs , 2008, SIAM J. Comput..

[19]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[20]  Zeyuan Allen Zhu,et al.  A simple, combinatorial algorithm for solving SDD systems in nearly-linear time , 2013, STOC '13.

[21]  S. Vavasis,et al.  Geometric Separators for Finite-Element Meshes , 1998, SIAM J. Sci. Comput..

[22]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[23]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[24]  M. Chial,et al.  in simple , 2003 .

[25]  David Eppstein,et al.  Regression Depth and Center Points , 1998, Discret. Comput. Geom..

[26]  S. Borgatti,et al.  The centrality of groups and classes , 1999 .

[27]  Michael L. Littman,et al.  Graphical Models for Game Theory , 2001, UAI.

[28]  Paul W. Goldberg,et al.  The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..

[29]  Nir Friedman,et al.  Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning , 2009 .

[30]  M. Prokopenko,et al.  Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks , 2013, PloS one.

[31]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[32]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[33]  Steven J. Brams,et al.  Dynamic models of coalition formation: fallback vs. build-up , 2003, TARK '03.

[34]  Shang-Hua Teng,et al.  A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning , 2008, SIAM J. Comput..

[35]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[36]  L. Shapley.  Cores of convex games , 1971 .

[37]  Michael Langberg,et al.  A unified framework for approximating and clustering data , 2011, STOC.

[38]  Kristina Lerman,et al.  The interplay between dynamics and networks: centrality, communities, and cheeger inequality , 2014, KDD.

[39]  Moshe Tennenholtz,et al.  An axiomatic approach to personalized ranking systems , 2007, JACM.

[40]  Leto Peel,et al.  The ground truth about metadata and community detection in networks , 2016, Science Advances.

[41]  Jennifer Rexford,et al.  BGP routing policies in ISP networks , 2005, IEEE Network.

[42]  Wei Chen,et al.  Interplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality , 2016, WWW.

[43]  Kristina Lerman,et al.  Network Composition from Multi-layer Data , 2016, ArXiv.

[44]  H. Tverberg.  A Generalization of Radon's Theorem , 1966 .

[45]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[46]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[47]  Mark Braverman,et al.  Finding Endogenously Formed Communities , 2012, SODA.

[48]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[49]  Gary L. Miller,et al.  Geometric Mesh Partitioning: Implementation and Experiments , 1998, SIAM J. Sci. Comput..

[50]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[51]  H. Eulau,et al.  The Columbia Studies of Personal Influence , 1980, Social Science History.

[52]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[53]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[54]  Kasturi R. Varadarajan,et al.  Geometric Approximation via Coresets , 2007 .

[55]  Subhadeep Paul,et al.  Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel , 2015, 1506.02699.

[56]  Richard Peng,et al.  Approximate Undirected Maximum Flows in O(mpolylog(n)) Time , 2014, SODA.

[57]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[58]  Yin Tat Lee,et al.  An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.

[59]  Phillip Bonacich,et al.  Simultaneous group and individual centralities , 1991 .

[60]  Jure Leskovec,et al.  The Network Completion Problem: Inferring Missing Nodes and Edges in Networks , 2011, SDM.

[61]  L. S. Shapley,et al.  17. A Value for n-Person Games , 1953 .

[62]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[63]  H. P. Young,et al.  An axiomatization of Borda's rule , 1974 .

[64]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[65]  Shang-Hua Teng,et al.  An Axiomatic Approach to Community Detection , 2016, ITCS.

[66]  A. Roth.  The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[67]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[68]  V. Klee,et al.  Helly's theorem and its relatives , 1963 .

[69]  Jonah Sherman,et al.  Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[70]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[71]  J. Cheeger.  A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

[72]  Nicholas R. Jennings,et al.  Efficient Computation of the Shapley Value for Centrality in Networks , 2010, WINE.

[73]  Vahab S. Mirrokni,et al.  Local Computation of PageRank Contributions , 2007, Internet Math..

[74]  Anderson Y. Zhang,et al.  Minimax Rates of Community Detection in Stochastic Block Models , 2015, ArXiv.

[75]  Fan Chung Graham,et al.  Using PageRank to Locally Partition a Graph , 2007, Internet Math..

[76]  László Lovász,et al.  Graph limits and parameter testing , 2006, STOC '06.

[77]  Mia Hubert,et al.  The Catline for Deep Regression , 1998 .

[78]  Taher H. Haveliwala.  Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search , 2003, IEEE Trans. Knowl. Data Eng..

[79]  S. Teng.  Points, spheres, and separators: a unified geometric approach to graph partitioning , 1992 .

[80]  Noga Alon,et al.  Multi-Node Graphs: A Framework for Multiplexed Biological Assays , 2006, J. Comput. Biol..

[81]  Nicholas R. Jennings,et al.  Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality , 2014, J. Artif. Intell. Res..

[82]  Christian Borgs,et al.  Private Graphon Estimation for Sparse Graphs , 2015, NIPS.

[83]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[84]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[85]  Yu Cheng,et al.  Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification , 2015, COLT.

[86]  Edoardo M. Airoldi,et al.  Consistent estimation of dynamic and multi-layer block models , 2014, ICML.

[87]  Shang-Hua Teng,et al.  Spectral sparsification of graphs: theory and algorithms , 2013, CACM.

[88]  Xiaotie Deng,et al.  Settling the complexity of computing two-player Nash equilibria , 2007, JACM.

[89]  M. A. Muñoz,et al.  Entangled networks, synchronization, and optimal network topology. , 2005, Physical review letters.

[90]  Vladimir Vapnik,et al.  The Nature of Statistical Learning , 1995 .

[91]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[92]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[93]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[94]  Hayder Radha,et al.  Network completion with node similarity: A matrix completion approach with provable guarantees , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[95]  Eric P. Xing,et al.  Network Completion and Survey Sampling , 2009, AISTATS.