Sharp threshold for the appearance of certain spanning trees in random graphs Dan Hefetz ∗

Source URL: page.mi.fu-berlin.de

Coupled Sparse Codes on Graphs

Source URL: tce.webee.eedev.technion.ac.il

Sampling Techniques for Large, Dynamic Graphs Daniel Stutzbach, Reza Rejaie University of Oregon {agthorr,reza}@cs.uoregon.edu Nick Duffield, Subhabrata Sen, Walter Willinger

Source URL: mirage.cs.uoregon.edu

Edge-exchangeable graphs and sparsity Tamara Broderick Department of EECS Massachusetts Institute of Technology

Source URL: stanford.edu

Cascading Failures in Bi-partite Graphs: Model for Systemic Risk Propagation SUBJECT AREAS: APPLIED PHYSICS SCIENTIFIC DATA STATISTICS

Source URL: havlin.biu.ac.il

EXTREMAL CUTS OF SPARSE RANDOM GRAPHS AMIR DEMBO∗ , ANDREA MONTANARI† , AND SUBHABRATA SEN Abstract. For Erd˝ os-R´enyi random graphs with average degree γ, and uniformly random γ-regular graph on n vertices,pwe

Source URL: web.stanford.edu

Analysis of a forwarding game without payments George Karakostas McMaster University Abstract—We consider a forwarding game on directed graphs

Source URL: www.cas.mcmaster.ca

• Graph theory
• Mathematics
• Discrete mathematics
• Network flow
• Flow network
• Operations research
• Directed graph
• Nash equilibrium
• Routing
• Networks
• Wireless ad hoc network
• Maximum flow problem

FACTORIE: Efficient Probabilistic Programming for Relational Factor Graphs via Imperative Declarations of Structure, Inference and Learning Andrew McCallum, Khashayar Rohanemanesh, Michael Wick, Karl Schultz, Sameer Sing

Source URL: ciir-publications.cs.umass.edu

Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities Adrien Todeschini and Fran¸ cois Caron arXiv:1602.02114v1 [stat.ME] 5 Feb 2016

Source URL: arxiv.org