Random Graphs

Bollobás, Béla·2001·Cambridge University Press eBooks

Cited by (999)

Items 201–300 of 999

  1. On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
    Derek Leonard, Vivek Rai, Dmitri Loguinov · 2005 · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)
  2. Urban road networks — spatial networks with universal geometric features?
    Sonic H. Y. Chan, Reik V. Donner, Stefan Lämmer · 2011 · The European Physical Journal B
  3. Structural Data De-anonymization
    Shouling Ji, Weiqing Li, Mudhakar Srivatsa · 2014 · ACM SIGSAC Conference on Computer and Communications Security (CCS)
  4. Social goods dilemmas in heterogeneous societies
    McAvoy, Alex, Allen, Benjamin, Nowak, Martin A. · 2020 · Nature Human Behaviour
  5. Sharp thresholds For monotone properties in random geometric graphs
    Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari · 2004 · ACM Symposium on Theory of Computing (STOC)
  6. Resolving Structural Variability in Network Models and the Brain
    Florian Klimm, Danielle S. Bassett, Jean M. Carlson, Peter J. Mucha · 2014 · PLoS Computational Biology
  7. STRESS TESTING THE RESILIENCE OF FINANCIAL NETWORKS
    HAMED AMINI, Rama Cont A, Andreea Minca · 2011 · International Journal of Theoretical and Applied Finance
  8. Networks and Economic Behavior
    Matthew O. Jackson · 2009 · Annual Review of Economics
  9. Network awareness and failure resilience in self-organizing overlay networks
    Laurent Massoulié, Anne-Marie Kermarrec, Ayalvadi J. Ganesh · 2004 · Proceedings/Proceedings - Symposium on Reliable Distributed Systems
  10. Distances in random graphs with finite variance degrees
    Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem · 2005 · Random Structures and Algorithms
  11. Weak percolation on multiplex networks
    G. J. Baxter, Sergey N. Dorogovtsev, José F. F. Mendes, Davide Cellai · 2014 · Physical Review E
  12. Global effects of local food-production crises: a virtual water perspective
    Stefania Tamea, Francesco Laio, Luca Ridolfi · 2016 · Scientific Reports
  13. A Probabilistic Technique for Finding Almost-Periods of Convolutions
    Ernie Croot, Olof Sisask · 2010 · Geometric and Functional Analysis
  14. Complex Systems: A Communication Networks Perspective Towards 6G
    Charalambos Sergiou, Marios Lestas, Pavlos Antoniou, Christos Liaskos, Andreas Pitsillides · 2020 · IEEE Access
  15. Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
    Tom Britton, Svante Janson, Anders Martin‐Löf · 2007 · Advances in Applied Probability
  16. Robustness of centrality measures under uncertainty: Examining the role of network topology
    Terrill L. Frantz, Marcelo Cataldo, Kathleen M. Carley · 2009 · Computational and Mathematical Organization Theory
  17. Structural equation modeling of a winnowed soil microbiome identifies how invasive plants re-structure microbial networks
    Steven D. Mamet, Ellen Redlick, Michelle Brabant, Eric Gordon Lamb, Bobbi L. Helgason, Kevin Gordon Stanley, Steven D. Siciliano · 2019 · The ISME Journal
  18. Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks
    Maksim Kitsak, Shlomo Havlin, Gerald Paul · 2007 · Physical Review E
  19. The fundamental group of random 2-complexes
    Eric K. Babson, Christopher Hoffman, Matthew Kahle · 2010 · Journal of the American Mathematical Society
  20. Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
    Mohsen Bayati, David Gamarnik, Prasad Tetali · 2013 · The Annals of Probability
  21. HodgeRank on Random Graphs for Subjective Video Quality Assessment
    Qianqian Xu, Qingming Huang, Tingting Jiang · 2012 · IEEE Transactions on Multimedia
  22. Conditions that impact the complexity of QoS routing
    Fernando A. Kuipers, P.F.A. Van Mieghem · 2005 · IEEE/ACM Transactions on Networking
  23. Local algorithms for independent sets are half-optimal
    Mustazee Rahman, Bálint Virág · 2017 · The Annals of Probability
  24. Topological phase transitions in functional brain networks
    Fernando A. N. Santos, Ernesto P. Raposo, Mauricio D. Coutinho-Filho, Mauro Copelli, Cornelis Jan Stam, Linda Douw · 2019 · Physical review. E
  25. Percolation on finite graphs and isoperimetric inequalities
    Noga Alon, Itai Benjamini, Alan Stacey · 2004 · The Annals of Probability
  26. On two Hamilton cycle problems in random graphs
    ALAN M. FRIEZE, Michael Krivelevich · 2008 · Israel Journal of Mathematics
  27. Communication over a wireless network with random connections
    Radhika Gowaikar, Bertrand M. Hochwald, Babak Hassibi · 2006 · IEEE Transactions on Information Theory
  28. Robustness of Interdependent Cyber-Physical Systems Against Cascading Failures
    Yingrui Zhang, Osman Yağan · 2019 · IEEE Transactions on Automatic Control
  29. Discovering Hidden Groups in Communication Networks
    Jeff Baumes, Mark Goldberg, Malik Magdon‐Ismail · 2004 · Lecture notes in computer science
  30. Cliques and cycles in distance graphs and graphs of diameters
    Andrei Mikhailovich Raigorodskii · 2014 · Contemporary mathematics - American Mathematical Society
  31. Large graph limit for an SIR process in random network with heterogeneous connectivity
    Laurent Decreusefond, Jean-Stéphane Dhersin, Pascal Moyal · 2012 · The Annals of Applied Probability
  32. Partitioning and modularity of graphs with arbitrary degree distribution
    Jörg Reichardt, Stefan Bornholdt · 2007 · Physical Review E
  33. Continuum percolation with steps in the square or the disc
    Paul Balister, Béla Bollobás, Mark Walters · 2005 · Random Structures and Algorithms
  34. Long Chaotic Transients in Complex Networks
    Alexander Zumdieck, Marc Timme, Theo Geisel, Fred Wolf · 2004 · Physical Review Letters
  35. Large graph limit for an SIR process in random network with heterogeneous connectivity
    Laurent Decreusefond, Pascal Moyal, Viet Chi Tran · 2012
  36. Distances in random graphs with finite variance degrees
    Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem · 2004 · arXiv (Cornell University)
  37. Bootstrap Percolation in High Dimensions
    József Balogh, Béla Bollobás, Robert Morris · 2010 · Combinatorics Probability Computing
  38. Efficient Dynamic Barter Exchange
    Ross Anderson, Itai Ashlagi, David Gamarnik · 2017 · Operations Research
  39. Regional Gossip Routing for Wireless Ad Hoc Networks
    Xiang‐Yang Li, Kousha Moaveninejad, Ophir Frieder · 2004 · Mobile Networks and Applications
  40. The Nonlinear Heat Equation on W-Random Graphs
    Georgi S. Medvedev · 2013 · Archive for Rational Mechanics and Analysis
  41. A supernodal formulation of vertex colouring with applications in course timetabling
    Edmund K. Burke, Jakub Mareček, Andrew J. Parkes · 2010 · Annals of Operations Research
  42. A simple solution to the k‐core problem
    Svante Janson, Malwina Luczak · 2006 · Random Structures and Algorithms
  43. Random matrix analysis of complex networks
    Sarika Jalan, Jayendra N. Bandyopadhyay · 2007 · Physical Review E
  44. Defining the Social Capital of the Board of Directors: An Exploratory Study
    Gavin John Nicholson, Malcolm Alexander, Geoffrey C. Kiel · 2004 · Journal of Management & Organization
  45. Boosting cooperation by involving extortion in spatial prisoner's dilemma games
    Zhi-Xi Wu, Zhihai Rong · 2014 · Physical Review E
  46. Mathematical and computational approaches to epidemic modeling: a comprehensive review
    Wei Duan, Zongchen Fan, Peng Zhang, Gang Guo, Xiaogang Qiu · 2015 · Frontiers of Computer Science
  47. The cover time of sparse random graphs
    Colin Cooper, ALAN M. FRIEZE · 2006 · Random Structures and Algorithms
  48. Mining scale-free networks using geodesic clustering
    Andrew Y. Wu, Michael Garland, Jiawei Han · 2004 · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
  49. Network Formation in the Presence of Contagious Risk
    Lawrence E. Blume, David A. Easley, Jon Michael Kleinberg, Robert Kleinberg, Eva Tardos D · 2013 · ACM Transactions on Economics and Computation
  50. Inducing effect on the percolation transition in complex networks
    Jin-Hua Zhao, Haijun Zhou, Yang‐Yu Liu · 2013 · Nature Communications
  51. An Improvement of the Lovász Local Lemma via Cluster Expansion
    Rodrigo Bissacot, Roberto Fernández, Aldo Procacci · 2011 · Combinatorics Probability Computing
  52. A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
    Ana Paula Couto da Silva, Emilio Leonardi, Marco Mellia · 2008 · International Conference on Peer-to-Peer Computing
  53. Landscape of Solutions in Constraint Satisfaction Problems
    Marc Mézard, Matteo Palassini, Olivier Rivoire · 2005 · Physical Review Letters
  54. Local dominance unveils clusters in networks
    Dingyi Shi, Fan Shang, Bingsheng Chen, Paul Expert, Linyuan Lü, Eugene Stanley, Renaud Lambiotte, Tim Evans, Ruiqi Li · 2024 · Communications Physics
  55. Resting-state functional connectivity abnormalities in first-onset unmedicated depression
    Junjie Chen, Hao Guo, Cheng Chen, Xiaohua Cao, Jie Xiang, Kerang Zhang · 2014 · Neural Regeneration Research
  56. Extremal results for random discrete structures
    Mathias Schacht · 2016 · Annals of Mathematics
  57. Sampling based sensor-network deployment
    V. Ister, S. Kannan, Kostas Daniilidis · 2005 · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
  58. Online crowdsourcing subjective image quality assessment
    Qianqian Xu, Qingming Huang, Yuan Yao · 2012 · ACM International Conference on Multimedia (ACM MM)
  59. Cavity method for quantum spin glasses on the Bethe lattice
    Chris R. Laumann, Antonello Scardicchio, Shivaji L. Sondhi · 2008 · Physical Review B
  60. Social goods dilemmas in heterogeneous societies
    Alex McAvoy, Benjamin Allen, Martin A. Nowak · 2020 · RePEc: Research Papers in Economics
  61. The effects of evolutionary adaptations on spreading processes in complex networks
    Rashad Eletreby, Yong Zhuang, Kathleen M. Carley, Osman Yağan, H. Vincent Poor · 2020 · Proceedings of the National Academy of Sciences
  62. Scalable, efficient epidemiological simulation
    Stephen Eubank · 2002 · ACM Symposium on Applied Computing
  63. Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
    Gagan Goel, Chinmay Karande, Pushkar Tripathi · 2009 · Annual Symposium on Foundations of Computer Science
  64. Convergence of a Class of Multi-Agent Systems In Probabilistic Framework
    Gongguo Tang, Lei Guo · 2007 · Journal of Systems Science and Complexity
  65. On the Feasibility and Efficacy of Protection Routing in IP Networks
    Kin-Wah Kwong, Lixin Gao, Roch A. Guérin · 2011 · IEEE/ACM Transactions on Networking
  66. A likelihood approach to analysis of network data
    Carsten Wiuf, Markus Brameier, Oskar Hagberg, Michael P. H. Stumpf · 2006 · Proceedings of the National Academy of Sciences
  67. Lectures on the Ising and Potts Models on the Hypercubic Lattice
    Hugo Duminil‐Copin · 2019 · Springer proceedings in mathematics & statistics
  68. RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
    Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot · 2008 · ACM Transactions on Computer Systems
  69. Network Structures from Selection Principles
    Vittoria Colizza A, Jayanth R. Banavar, Amos Maritan, Andrea Rinaldo · 2004 · Physical Review Letters
  70. Agreement in presence of noise: pseudogradients on random geometric networks
    Y. Hatano, A.K. Das, Mehran Mesbahi · 2006 · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes
  71. The ontogeny of scale-free syntax networks: phase transitions in early language acquisition
    COROMINAS-MURTRA, BERNAT, VALVERDE, SERGI, SOLÉ, RICARD · 2009 · Advances in Complex Systems
  72. Dynamics of tipping cascades on complex networks
    Jonathan Krönke, Nico Wunderling, Ricarda Winkelmann, Arie Staal, Benedikt Stumpf, Obbe A. Tuinenburg, Jonathan F. Donges · 2020 · Physical review. E
  73. Approximating Longest Directed Paths and Cycles
    Andreas Björklund, Thore Husfeldt, Sanjeev Khanna · 2004 · Lecture notes in computer science
  74. Exclusion processes on networks as models for cytoskeletal transport
    Izaak Neri, Norbert Kern, Andrea Parmeggiani · 2013 · New Journal of Physics
  75. Mean Square Convergence of Consensus Algorithms in Random WSNs
    Silvana Silva Pereira, Alba Pagés-Zamora · 2010 · IEEE Transactions on Signal Processing
  76. THE LARGEST COMPONENT IN A SUBCRITICAL RANDOM GRAPH WITH A POWER LAW DEGREE DISTRIBUTION
    Svante Janson · 2008
  77. On k−coverage in a mostly sleeping sensor network
    Santosh D. Kumar, Ten Hwang Lai, József Balogh · 2006 · Wireless Networks
  78. Taming complexity
    Albert-Ĺaszló Barabási · 2005 · Nature Physics
  79. On the Role of Network Centrality in the Controllability of Complex Networks
    Nicoletta Bof, Giacomo Baggio, Sandro Zampieri · 2016 · IEEE Transactions on Control of Network Systems
  80. Information propagation on modular networks
    Liang Huang, Kwangho Park, Ying‐Cheng Lai · 2006 · Physical Review E
  81. Promotion of cooperation on networks? The myopic best response case
    Carlos P. Roca, J. A. Cuesta, A. Sánchez · 2009 · The European Physical Journal B
  82. Spectral characteristics of network redundancy
    Ben D. MacArthur, Rubén J. Sánchez-García · 2009 · Physical Review E
  83. Dynamical clustering of exchange rates
    Daniel J. Fenn, Mason Alexander Porter, Peter J. Mucha, Mark McDonald, Stacy Williams, Neil F. Johnson, Nick S. Jones · 2012 · Quantitative Finance
  84. The condition number of a randomly perturbed matrix
    Van H. Vu, Terence Tao · 2007 · ACM Symposium on Theory of Computing (STOC)
  85. Evolution of ribosomal protein network architectures
    Youri Timsit, Grégoire Sergeant-Perthuis, Daniel Bennequin · 2021 · Scientific Reports
  86. Matching in hypergraphs of large minimum degree
    Daniela Kühn, Deryk Osthus · 2006 · University of Birmingham Research Portal (University of Birmingham)
  87. Majority Bootstrap Percolation on the Hypercube
    József Balogh, Béla Bollobás, Robert Morris · 2008 · Combinatorics Probability Computing
  88. Fast random graph generation
    Sadegh Nobari, Xuesong Lu, Panagiotis Karras · 2011 · International Conference on Extending Database Technology (EDBT)
  89. Inhomogeneous Financial Networks and Contagious Links
    Hamed Amini, Andreea Minca · 2016 · Operations Research
  90. Data-aware multicast
    Sebastien Baehni, Patrick Th. Eugster, Rachid Guerraoui · 2004 · IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
  91. Percolation framework to describe El Niño conditions
    Jun Meng, Jingfang Fan, Yosef Ashkenazy · 2017 · Chaos An Interdisciplinary Journal of Nonlinear Science
  92. Spectral theory of sparse non-Hermitian random matrices
    Fernando Lucas Metz, Izaak Neri, Tim Rogers · 2019 · Journal of Physics A Mathematical and Theoretical
  93. Threshold values, stability analysis, and high- q asymptotics for the coloring problem on random graphs
    Florent Krząkała, Andrea Pagnani, Martin Weigt · 2004 · Physical Review E
  94. PhaseCode: Fast and Efficient Compressive Phase Retrieval Based on Sparse-Graph Codes
    Ramtin Pedarsani, Dong Yin, Kangwook Lee · 2014 · Allerton Conference on Communication, Control, and Computing
  95. Parsimonious flooding in dynamic graphs
    Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud · 2009 · ACM Symposium on Principles of Distributed Computing (PODC)
  96. Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case
    Pierre-Ugo Tournoux, Jérémie Leguay, Farid Benbadis · 2011 · IEEE Transactions on Mobile Computing
  97. Climate network percolation reveals the expansion and weakening of the tropical component under global warming
    Jingfang Fan, Jun Meng, Yosef Ashkenazy, Shlomo Havlin, Hans Joachim Schellnhuber · 2018 · Proceedings of the National Academy of Sciences
  98. Bootstrap Percolation in Living Neural Networks
    Hamed Amini · 2010 · Journal of Statistical Physics
  99. Random popular matchings
    Mohammad Mahdian · 2006 · ACM Conference on Electronic Commerce (EC)
  100. Asymptotic normality of the k-core in random graphs
    Svante Janson, Malwina Luczak · 2008 · The Annals of Applied Probability