Internet Mathematics (Project Euclid)

Internet Mathematics, Volume 3, Number 3 (2006)

2008-06-23T15:28:37Z

Contents:

David Gleich, Marzia Polito. Approximating Personalized PageRank with Minimal Use of Web Graph Data. 257--294.

Ying Bao, Guang Feng, Tie-Yan Liu, Zhi-Ming Ma, Ying Wang. Ranking Websites: A Probabilistic View. 295--320.

Pierre Charbit, Alex D. Scott. Infinite Locally Random Graphs. 321--332.

Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danic Vukadinović. Cuts and Disjoint Paths in the Valley-Free Path Model. 333--360.

Alan Frieze, Juan Vera, Soumen Chakrabarti. The Influence of Search Engines on Preferential Attachment. 361--381.

Internet Mathematics, Volume 3, Number 4 (2006)

2008-11-18T16:16:59Z

Contents:

Gianna M. Del Corso, Stefano Leonardi. Special Issue on Algorithmic and Numerical Aspects of Web Search. 383--384.

Roger A. Horn, Stefano Serra-Capizzano. A General Setting for the Parametric Google Matrix. 385--411.

Filippo Geraci, Marco Pellegrini, Marco Maggini, Fabrizio Sebastiani. Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution. 413--443.

Ricardo Baeza-Yates, Paolo Boldi, Carlos Castillo. Generic Damping Functions for Propagating Importance in Link-Based Ranking. 445--478.

Debora Donato, Stefano Leonardi, Panayiotis Tsaparas. Stability and Similarity of Link Analysis Ranking Algorithms. 479--507.

Paola Favati, Grazia Lotti, Ornella Menchi, Francesco Romani. A Stochastic Model for the Link Analysis of the Web. 509--531.

Internet Mathematics, Volume 4, Number 1 (2007)

2009-05-27T13:22:50Z

Contents:

Pawel Prałat, Nicholas Wormald. Growing Protean Graphs. 1--16.

Steve Lumetta, Michael Mitzenmacher. Using the Power of Two Choices to Improve Bloom Filters. 17--34.

Reid Andersen, Fan Chung, Kevin Lang. Using PageRank to Locally Partition a Graph. 35--64.

Jerrold R. Griggs, Xiaohua Teresa Jin. Real Number Labelings for Paths and Cycles. 65--86.

Abraham D. Flaxman, Alan M. Frieze, Juan Vera. A Geometric Preferential Attachment Model of Networks II. 87--112.

Remco van der Hofstad, Gerard Hooghiemstra, Dmitri Znamenski. A Phase Transition for the Diameter of the Configuration Model. 113--128.

Internet Mathematics, Volume 4, Number 2-3 (2007)

2009-05-27T13:23:41Z

Contents:

Abraham D. Flaxman. Expansion and Lack Thereof in Randomly Perturbed Graphs. 131--148.

Ross M. Richardson. On Locality in a Geometric Random Tree Model. 149--174.

N. Litvak, W. R. W. Scheinhardt, Y. Volkovich. In-Degree and PageRank: Why Do They Follow Similar Power Laws?. 175--198.

Anthony Bonato, Jeannette Janssen. Infinite Limits and Adjacency Properties of a Generalized Copying Model. 199--224.

Fan Chung, Paul Horn. The Spectral Gap of a Random Subgraph of a Graph. 225--244.

Santo Fortunato, Mariá Bofuñá, Alessandro Flammini, Filippo Menczer. On Local Estimations of PageRank: A Mean Field Approach. 245--266.

Soumen Chakrabarti. Learning to Rank in Vector Spaces and Social Networks. 267--298.

Internet Mathematics, Volume 4, Number 4 (2007)

2009-05-27T13:26:55Z

Contents:

Chris P. Lee, Gene H. Golub, Stefanos A. Zenios. A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations. 299--328.

N. Fountoulakis. Percolation on Sparse Random Graphs with Given Degree Sequence. 329--356.

F. Bassetti,, M. Cosentino Lagomarsino, S. Mandrà. Exchangeable Random Networks. 357--400.

K. B. Athreya. Preferential Attachment Random Graphs with General Weight Function. 401--418.

Anthony Bonato, Paweł Prałat, Changping Wang. Pursuit-Evasion in Models of Complex Networks. 419--436.

Internet Mathematics, Volume 5, Number 3 (2008)

2009-11-24T20:46:38Z

Contents:

Chen Avin. Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs. 195--210.

Hovhannes A. Harutyunyan. An Efficient Vertex Addition Method for Broadcast Networks. 211--225.

J. Zich, Y. Kohayakawa, V. Rödl, V. Sunderam. JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks. 227--250.

Ilkka Norros, Hannu Reittu. Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance Region. 251--266.

Persi Diaconis, Susan Holmes, Svante Janson. Threshold Graph Limits and Random Threshold Graphs. 267--320.

Internet Mathematics, Volume 5, Number 1-2 (2008)

2009-11-25T14:17:12Z

Contents:

Reid Andersen, Fan Chung, Kevin Lang. Local Partitioning for Directed Graphs Using PageRank. 3--22.

Reid Andersen, Christian Borgs, Jennifer Chayes, John Hopcroft, Vahab Mirrokni, Shang-Hua Teng. Local Computation of PageRank Contributions. 23--44.

Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham. A Singular Perturbation Approach for Choosing the PageRank Damping Factor. 47--70.

John Hopcroft, Daniel Sheldon. Manipulation-Resistant Reputations Using Hitting Time. 71--90.

Stephan J. Young, Edward Scheinerman. Directed Random Dot Product Graphs. 91--112.

Milan Brandojić, Aric Hagberg, Allon G. Percus. The Structure of Geographical Threshold Graphs. 113--140.

Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu. Deterministic Decentralized Search in Random Graphs. 141--154.

Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert E. Tarjan. Finding Strongly Knit Clusters in Social Networks. 155--174.

W. Aiello, A. Bonato, C. Cooper, J. Janssen, P. Prałat. A Spatial Web Graph Model with Local Influence Regions. 175--193.

Internet Mathematics, Volume 5, Number 4 (2008)

2010-02-01T14:06:35Z

Contents:

Heiner Ackermann, Alexander Skopalik. Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. 323--342.

Dimitris Fotakis, Paul G. Spirakis. Cost-Balancing Tolls for Atomic Network Congestion Games. 343--364.

Haralampos Tsaknakis, Paul G. Spirakis. An Optimization Approach for Approximate Nash Equilibria. 365--382.

Qizhi Fang, Liang Kong, Jia Zhao. Core Stability of Vertex Cover Games. 383--394.

Alexander Hall, Evdokia Nikolova, Christos Papadimitriou. Incentive-Compatible Interdomain Routing with Linear Utilities. 395--410.

Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti. Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. 411--438.

Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking. A Unified Approach to Congestion Games and Two-Sided Markets. 439--458.

Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking. Who Should Pay for Forwarding Packets?. 459--476.

Kyle W. Burke, Shang-Hua Teng. Atropos: A PSPACE-Complete Sperner Triangle Game. 477--492.

David J. Abraham, Ariel Levavi, David F. Manlove, Gregg O'Malley. The Stable Roommates Problem with Globally Ranked Pairs. 493--515.

Internet Mathematics, Volume 6, Number 1 (2009)

2010-09-08T19:15:51Z

Contents:

Anthony Bonato, Fan Chung Graham. Open Letter to the Internet Mathematics Community. 1--2.

Dana Richards, Zhenlei Jia. The Structure of PEC Networks. 3--17.

Ian Abramson, Arthur Berg. An Occupancy Problem Arising in Power Law Fitting. 19--28.

Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. 29--123.

Internet Mathematics, Volume 6, Number 2 (2009)

2010-09-24T14:37:59Z

Contents:

Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer. The Price of Malice: A Game-Theoretic Framework for Malicious Behavior. 125--156.

Steve Osborne, Jorge Rebaza, Elizabeth Wiggins. On Accelerating the PageRank Computation. 157--172.

Yusuke Ide, Norio Konno, Nobuaki Obata. Spectral Properties of the Threshold Network Model. 173--188.

Paul G. Constantine, David F. Gleich. Random Alpha PageRank. 189--236.

Fan Chung, Paul Horn, Alexander Tsiatas. Distributing Antidote Using PageRank Vectors. 237--254.

Internet Mathematics, Volume 6, Number 3 (2009)

2011-10-10T17:58:20Z

Contents:

Paolo Boldi, Massimo Santini, Sebastiano Vigna. Permuting Web and Social Graphs. 257--283.

Anthony Bonato, Noor Hadi, Paul Horn, Paweł Prałat, Changping Wang. Models of Online Social Networks. 285--313.

Fan Chung. A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank. 315--330.

Fan Chung, Paul Horn, Linyuan Lu. Percolation in General Graphs. 331--347.

Mira Gonen, Yuval Shavitt. Approximating the Number of Network Motifs. 349--372.

Chinmay Karande, Kumar Chellapilla, Reid Andersen. Speeding Up Algorithms on Compressed Web Graphs. 373--398.

Hyun Chul Lee, Allan Borodin. Criteria for Cluster-Based Personalized Search. 399--435.

Internet Mathematics, Volume 6, Number 4 (2010)

2011-10-13T14:01:57Z

Contents:

P. Favati, G. Lotti, O. Menchi, F. Romani. A Coupled Model for the Indegree and Outdegree Analysis of the Web. 437--459.

Tomas Hruz, Ueli Peter. Nongrowing Preferential Attachment Random Graphs. 461--487.

Joseph Blitzstein, Persi Diaconis. A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees. 489--522.

Internet Mathematics, Volume 7, Number 1 (2011)

2011-10-13T14:02:42Z

Contents:

Edmond Edmond, Mingji Lou, Francis Bonahon, Yuliy Baryshnikov. Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks. 1--27.

Evgeni Krimer, Mattan Erez. The Power of 1 + α for Memory-Efficient Bloom Filters. 28--44.

J. Ignacio Alvarez-Hamelin, Mariano G. Beiró, Jorge R. Busch. Understanding Edge Connectivity in the Internet through Core Decomposition. 45--66.

Joshua Cooper, Linyuan Lu. Graphs with Asymptotically Invariant Degree Sequences under Restriction. 67--80.

Internet Mathematics, Volume 7, Number 2 (2011)

2011-10-13T14:08:13Z

Contents:

Angsheng Li, Pan Peng. Community Structures in Classical Network Models. 81--106.

Simla Ceyhan, Mohammad Mousavi, Amin Saberi. Social Influence and Evolution of Market Share. 107--134.

Internet Mathematics, Volume 7, Number 3 (2011)

2011-10-13T14:08:21Z

Contents:

Edmond Jonckheere, Poonsuk Lohsoonthorn, Fariba Ariaei. Scaled Gromov Four-Point Condition for Network Graph Curvature Computation. 137--177.

Joshua R. Davis, Zachary Goldman, Elizabeth N. Koch, Jacob Hilty, David Liben-Nowell, Alexa Sharp, Tom Wexler, Emma Zhou. Equilibria and Efficiency Loss in Games on Networks. 178--205.

Internet Mathematics, Volume 7, Number 4 (2011)

2011-12-08T18:01:19Z

Contents:

Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan. On the Approximability of Reachability-Preserving Network Orientations. 209--232.

Jonathan J. Crofts, Desmond J. Higham. Googling the Brain: Discovering Hierarchical and Asymmetric Network Structures, with Applications in Neuroscience. 233--254.

Tobias Wittkop, Sven Rahmann, Richard Röttger, Sebastian Böcker, Jan Baumbach. Extension and Robustness of Transitivity Clustering for Protein–Protein Interaction Network Analysis. 255--273.

Limsoon Wong. Using Biological Networks in Protein Function Prediction and Gene Expression Analysis. 274--298.

Nicolas Alcaraz, Hande Kücük, Jochen Weile, Anil Wipat, Jan Baumbach. KeyPathwayMiner: Detecting Case-Specific Biological Pathways Using Expression Data. 299--313.

Amira Djebbari, Muhammad Ali, David Otasek, Max Kotlyar, Kristen Fortney, Serene Wong, Anthony Hrvojic, Igor Jurisica. NAViGaTOR: Large Scalable and Interactive Navigation and Analysis of Large Graphs. 314--347.