Random Graphs

Cited by (999)

Items 101–200 of 999

1. Distributed Graph Coloring: Fundamentals and Recent Developments
   Leonid Barenboim, Michael Elkin · 2013 · Synthesis lectures on distributed computing theory
2. Vertex centralities in input-output networks reveal the structure of modern economies
   Florian Blöchl, Fabian Joachim Theis, Fernando Vega‐Redondo, Eric O'n. Fisher · 2011 · Physical Review E
3. Connectivity, Coverage and Placement in Wireless Sensor Networks
   Ji Li, Lachlan L. H. Andrew, Chuan Heng Foh · 2009 · Sensors
4. Distributed construction of random expander networks
   C. Law, K.-Y. Siu · 2004
5. Mathematics of Networks
   Mark E. J. Newman · 2008 · The New Palgrave Dictionary of Economics
6. On the performance of percolation graph matching
   Lyudmila V. Yartseva, Matthias Grossglauser · 2013
7. On the relationship between the algebraic connectivity and graph's robustness to node and link failures
   Almerima Jamakovic, Steve Uhlig · 2007 · Next Generation Internet Networks (NGI)
8. A Notion of Robustness in Complex Networks
   Haotian Zhang, Elaheh Fata, Shreyas Sundaram · 2015 · IEEE Transactions on Control of Network Systems
9. Some features of the spread of epidemics and information on a random graph
   Rick Durrett · 2010 · Proceedings of the National Academy of Sciences
10. Bubblestorm
    Wesley W. Terpstra, Jussi Kangasharju, Christof Leng, Alejandro Buchmann · 2007 · ACM SIGCOMM Conference (SIGCOMM)
11. Reliable density estimates for coverage and connectivity in thin strips of finite length
    Paul Balister, Béla Bollobás, Amites Sarkar · 2007
12. Optimal Sybil-resilient node admission control
    Nguyen Hoang Khoi Tran, Jinyang Li, Lakshminarayanan Subramanian, Sherman S. M. Chow · 2011 · IEEE Conference on Computer Communications (INFOCOM)
13. An Introduction to Temporal Graphs: An Algorithmic Perspective
    Othon Michail · 2015 · Lecture notes in computer science
14. Mesoscopic Structure Conditions the Emergence of Cooperation on Social Networks
    Sergi Lozano, Àlex Arenas, Ángel Sánchez · 2008 · PLoS ONE
15. Network Theory--the Emergence of the Creative Enterprise
    Albert-Ĺaszló Barabási · 2005 · Science
16. Budget-optimal crowdsourcing using low-rank matrix approximations
    David R. Karger, Sewoong Oh, Devavrat Shah · 2011 · Allerton Conference on Communication, Control, and Computing
17. Accuracy of mean-field theory for dynamics on real-world networks
    James P. Gleeson, Sergey Melnik, J. Ward · 2012 · Physical Review E
18. On certain connectivity properties of the internet topology
    Milena Mihail, Christos H. Papadimitriou, Amin Saberi · 2005 · Journal of Computer and System Sciences
19. Sparse random graphs: Eigenvalues and eigenvectors
    Linh V. Tran, Van H. Vu, Ke Wang · 2012 · Random Structures and Algorithms
20. Dynamics of conversations
    Ravi Kumar, Mohammad Mahdian, Mary McGlohon · 2010 · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
21. Vertex intrinsic fitness: How to produce arbitrary scale-free networks
    Vito D. P. Servedio, Guido Caldarelli, Paolo Buttà · 2004 · Physical Review E
22. EXTREMAL RESULTS FOR RANDOM DISCRETE STRUCTURES
    Mathias Schacht · 2009
23. Subgraph frequencies
    Johan H. Ugander, Lars Bäckström, Jon Michael Kleinberg · 2013 · International World Wide Web Conference (WWW)
24. Nonergodic Phases in Strongly Disordered Random Regular Graphs
    B. L. Altshuler, Emilio Cuevas, L. B. Ioffe · 2016 · Physical Review Letters
25. Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames
    David I Shuman, Christoph Wiesmeyr, Nicki Holighaus, Pierre Vandergheynst · 2015 · IEEE Transactions on Signal Processing
26. On percolation in random graphs with given vertex degrees
    Svante Janson · 2009 · Electronic Journal of Probability
27. Random biochemical networks: the probability of self-sustaining autocatalysis
    Elchanan Mossel, Mike Steel · 2004 · Journal of Theoretical Biology
28. On strong structural controllability of networked systems: A constrained matching approach
    Airlie Chapman, Mehran Mesbahi · 2013 · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference
29. Coloring Distance Graphs and Graphs of Diameters
    Andrei Mikhailovich Raigorodskii · 2012 · Springer eBooks
30. Significant Scales in Community Structure
    Vincent Traag, Gautier Krings, Paul M. Van Dooren · 2013 · Scientific Reports
31. The Economic Consequences of Social Network Structure
    Matthew O. Jackson, Brian W. Rogers, Yves Zénou · 2015 · SSRN Electronic Journal
32. Bootstrap percolation on the hypercube
    József Balogh, Béla Bollobás · 2005 · Probability Theory and Related Fields
33. Thresholds for virus spread on networks
    Moez Draief, Ayalvadi J. Ganesh, Laurent Massoulié · 2008 · The Annals of Applied Probability
34. Biological impacts and context of network theory
    Eivind Almaas · 2007 · Journal of Experimental Biology
35. Resilience of networks with community structure behaves as if under an external field
    Gaogao Dong, Jingfang Fan, Louis Shekhtman, Saray Shai, Ruijin Du, Lixin Tian, Xiaosong Chen, Eugene Stanley, Shlomo Havlin · 2018 · Proceedings of the National Academy of Sciences
36. Validation of Twitter opinion trends with national polling aggregates: Hillary Clinton vs Donald Trump
    Alexandre Bovet, Flaviano Morone, Hernán A. Makse · 2018 · Scientific Reports
37. On the scaling of the chemical distance in long-range percolation models
    Marek Biskup · 2004 · The Annals of Probability
38. Maxwell Construction: The Hidden Bridge Between Iterative and Maximuma PosterioriDecoding
    Cyril Méasson, Andrea Montanari A, Rudiger L. Urbanke · 2008 · IEEE Transactions on Information Theory
39. Network formation in the presence of contagious risk
    Larry Blume, David A. Easley, Jon Michael Kleinberg, Robert Kleinberg, Eva Tardos D · 2011 · ACM Conference on Electronic Commerce (EC)
40. NON-BACKTRACKING RANDOM WALKS MIX FASTER
    NOGA ALON, ITAI BENJAMINI, EYAL LUBETZKY · 2007 · Communications in Contemporary Mathematics
41. Trees, networks, and hydrology
    Andrea Rinaldo, Jayanth R. Banavar, Amos Maritan · 2006 · Water Resources Research
42. Computational complexity and information asymmetry in financial products
    Sanjeev Arora, Boaz Barak, Markus Konrad Brunnermeier, Rong Ge · 2011 · Communications of the ACM
43. PATRIC
    Shaikh Arifuzzaman, Maleq Khan, MADHAV V. MARATHE · 2013 · ACM International Conference on Information and Knowledge Management (CIKM)
44. Dependent random choice
    Jacob Fox, Benny Sudakov · 2010 · Random Structures and Algorithms
45. Communication dynamics in twitter during political campaigns: The case of the 2011 Spanish national election
    Aragón, Pablo, Kappler, Karolin Eva, Kaltenbrunner, Andreas, Laniado, David, Volkovich, Yana · 2013 · Policy & Internet
46. Subgraph Robustness of Complex Networks Under Attacks
    Yilun Shang · 2017 · IEEE Transactions on Systems Man and Cybernetics Systems
47. Eradicating catastrophic collapse in interdependent networks via reinforced nodes
    Xin Yuan, Yanqing Hu, Harry Eugene Stanley · 2017 · Proceedings of the National Academy of Sciences
48. Flooding time in edge-Markovian dynamic graphs
    Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri · 2008 · ACM Symposium on Principles of Distributed Computing (PODC)
49. The Road to Deterministic Matrices with the Restricted Isometry Property
    Afonso S. Bandeira, Matthew C. Fickus, Dustin G. Mixon · 2013 · Journal of Fourier Analysis and Applications
50. Zero–One Laws for Connectivity in Random Key Graphs
    Osman Yağan, Armand M. Makowski · 2012 · IEEE Transactions on Information Theory
51. Conductance and congestion in power law graphs
    Christos Gkantsidis, Milena Mihail, Amin Saberi · 2003 · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)
52. Graph-Constrained Group Testing
    Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer · 2012 · IEEE Transactions on Information Theory
53. On the Characterization of the Structural Robustness of Data Center Networks
    Kashif Bilal, Marc Manzano, Samee U. Khan, Eusebi Calle, Keqin Li, Albert Y. Zomaya · 2013 · IEEE Transactions on Cloud Computing
54. On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks
    Derek Leonard, Zhongmei Yao, Vivek Rai · 2007 · IEEE/ACM Transactions on Networking
55. The Impact of Channel Randomness on Coverage and Connectivity of Ad Hoc and Sensor Networks
    Daniele Miorandi, Eitan Altman, G. Alfano · 2008 · IEEE Transactions on Wireless Communications
56. Topology of molecular interaction networks
    Wynand Winterbach, Piet Van Mieghem, Marcel J. T. Reinders, Huijuan Wang, Dick de Ridder · 2013 · BMC Systems Biology
57. Percolation on finite graphs and isoperimetric inequalities
    Noga Alon, Itaï Benjamini, Alan M. Stacey · 2002
58. On the Robustness of Complex Networks by Using the Algebraic Connectivity
    Almerima Jamakovic, Piet Van Mieghem · 2008 · Lecture notes in computer science
59. The phase transition in random graphs: A simple proof
    Michael Krivelevich, Benny Sudakov · 2012 · Random Structures and Algorithms
60. Solution for the properties of a clustered network
    Juyong M. Park, Mark E. J. Newman · 2005 · Physical Review E
61. Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks, and Computation
    Nikolaos M. Freris, Hemant Kowshik, P. R. Kumar · 2010 · Proceedings of the IEEE
62. Diameters in Preferential Attachment Models
    Sander Dommers, Remco van der Hofstad, Gerard Hooghiemstra · 2010 · Journal of Statistical Physics
63. Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks
    Seyit Ahmet Camtepe, Bulent Yener, Moti M. Yung · 2006 · International Conference on Communications
64. Distances in Random Graphs with Finite Mean and Infinite Variance Degrees
    Remco van der Hofstad, Gerard Hooghiemstra, Dmitri Znamenski · 2007 · Electronic Journal of Probability
65. Sparse graphs: Metrics and random models
    Béla Bollobás, Oliver M. Riordan · 2010 · Random Structures and Algorithms
66. Differential Cryptanalysis for Multivariate Schemes
    Pierre-Alain Fouque, Louis Granboulan, Jacques Stern · 2005 · Lecture notes in computer science
67. Experimental Evaluation of Classical Automata Constructions
    Deian Tabakov, Moshe Y. Vardi · 2005 · Lecture notes in computer science
68. Sampling properties of random graphs: The degree distribution
    Michael P. H. Stumpf, Carsten Wiuf · 2005 · Physical Review E
69. Non-backtracking random walks mix faster
    Noga Alon, Itaï Benjamini, Eyal Lubetzky · 2006
70. Taxon abundance, diversity, co-occurrence and network analysis of the ruminal microbiota in response to dietary changes in dairy cows
    Ilma Tapio, Daniel Fischer, Lucia Blasco, Miika Tapio, R. John Wallace, A.R. Bayat, Laura Ventto, Minna M. Kahala, Enyew Negussie, Kevin J. Shingfield et al. · 2017 · PLoS ONE
71. Which Networks are Least Susceptible to Cascading Failures?
    Lawrence E. Blume, David A. Easley, Jon Michael Kleinberg, Robert Kleinberg, Eva Tardos D · 2011 · Annual Symposium on Foundations of Computer Science
72. Cortical Oscillations in Health and Disease
    Roger D. Traub, Miles A. Whittington · 2010
73. Law of large numbers for the SIR epidemic on a random graph with given degrees
    Svante Janson, Malwina Luczak, Peter Windridge · 2014 · Random Structures and Algorithms
74. Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
    Yongwook Choi, Wojciech Szpankowski A · 2012 · IEEE Transactions on Information Theory
75. Complex Networks: from Graph Theory to Biology
    Annick Lesne · 2006 · Letters in Mathematical Physics
76. Community Structure in Graphs
    Santo Fortunato, Claudio Castellano · 2009 · Encyclopedia of Complexity and Systems Science
77. An Approximate Version of Sidorenko’s Conjecture
    David Conlon, Jacob Fox, Benny Sudakov · 2010 · Geometric and Functional Analysis
78. Infinite Systems of Interacting Chains with Memory of Variable Length—A Stochastic Model for Biological Neural Nets
    Antonio Galves, E. Löcherbach · 2013 · Journal of Statistical Physics
79. Sharp vanishing thresholds for cohomology of random flag complexes
    Matthew Kahle · 2014 · Annals of Mathematics
80. Community Structure in Graphs
    Santo Fortunato, Claudio Castellano B · 2011 · SpringerReference
81. Stress testing the resilience of financial networks
    Rama Cont A, Amini, H., Andreea Minca · 2012 · HAL (Le Centre pour la Communication Scientifique Directe)
82. Connectivity of random k-nearest-neighbour graphs
    Paul Balister, Béla Bollobás, Amites Sarkar · 2005 · Advances in Applied Probability
83. Efficient crowdsourcing for multi-class labeling
    David R. Karger, Sewoong Oh, Devavrat Shah · 2013 · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)
84. Totally Asymmetric Simple Exclusion Process on Networks
    Izaak Neri, Norbert Kern, Andrea Parmeggiani · 2011 · Physical Review Letters
85. Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes
    Alexandros G. Dimakis, Vinod M. Prabhakaran, Kannan Ramchandran · 2005 · International Symposium on Information Processing in Sensor Networks (IPSN)
86. On the Dynamics of the Glass Transition on Bethe Lattices
    Andrea Montanari A, Guilhem Semerjian · 2006 · Journal of Statistical Physics
87. On the Smallest Eigenvalue of Grounded Laplacian Matrices
    Mohammad Pirani, Shreyas Sundaram · 2015 · IEEE Transactions on Automatic Control
88. Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation
    Nikolaos M. Freris, Hemant Kowshik, P. R. Kumar · 2009
89. Mathematics of networks
    Mark E. J. Newman · 2018 · Networks
90. Trust Evaluation in Anarchy: A Case Study on Autonomous Networks
    Tao Jiang, John S. Baras · 2006
91. Routing networks for distributed hash tables
    Gurmeet Singh Manku · 2003
92. From Technological Networks to Social Networks
    Kwang‐Cheng Chen, Mung Chiang, H. Vincent Poor · 2013 · IEEE Journal on Selected Areas in Communications
93. Recovery of Low-Rank Plus Compressed Sparse Matrices With Application to Unveiling Traffic Anomalies
    Morteza Mardani, Gonzalo Mateos, Georgios B. Giannakis · 2013 · IEEE Transactions on Information Theory
94. Random subgraphs of finite graphs. II. The lace expansion and the triangle condition
    Christian Borgs, Jennifer Chayes, Gordon Slade · 2005 · The Annals of Probability
95. Clustering Large Probabilistic Graphs
    George Kollios D, Michalis Potamias, Evimaria Terzi · 2011 · IEEE Transactions on Knowledge and Data Engineering
96. A new approach to the giant component problem
    Svante Janson, Malwina Luczak · 2008 · Random Structures and Algorithms
97. Synchronization in power-law networks
    Ljupčo Kocarev, Paolo Amato · 2005 · Chaos An Interdisciplinary Journal of Nonlinear Science
98. Information Propagation in Clustered Multilayer Networks
    Yong Zhuang, Osman Yağan · 2016 · IEEE Transactions on Network Science and Engineering
99. The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
    Michael Krivelevich · 2010 · Journal of the American Mathematical Society
100. Uncovering disassortativity in large scale-free networks
     Nelly Litvak, Remco van der Hofstad · 2013 · Physical Review E