Random Graphs
Bollobás, Béla·2001·Cambridge University Press eBooks
Cited by (999)
Items 201–300 of 999
- On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networksDerek Leonard, Vivek Rai, Dmitri Loguinov · 2005 · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)
- 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
- Structural Data De-anonymizationShouling Ji, Weiqing Li, Mudhakar Srivatsa · 2014 · ACM SIGSAC Conference on Computer and Communications Security (CCS)
- Social goods dilemmas in heterogeneous societiesMcAvoy, Alex, Allen, Benjamin, Nowak, Martin A. · 2020 · Nature Human Behaviour
- Sharp thresholds For monotone properties in random geometric graphsAshish Goel, Sanatan Rai, Bhaskar Krishnamachari · 2004 · ACM Symposium on Theory of Computing (STOC)
- Resolving Structural Variability in Network Models and the BrainFlorian Klimm, Danielle S. Bassett, Jean M. Carlson, Peter J. Mucha · 2014 · PLoS Computational Biology
- STRESS TESTING THE RESILIENCE OF FINANCIAL NETWORKSHAMED AMINI, Rama Cont A, Andreea Minca · 2011 · International Journal of Theoretical and Applied Finance
- Networks and Economic BehaviorMatthew O. Jackson · 2009 · Annual Review of Economics
- Network awareness and failure resilience in self-organizing overlay networksLaurent Massoulié, Anne-Marie Kermarrec, Ayalvadi J. Ganesh · 2004 · Proceedings/Proceedings - Symposium on Reliable Distributed Systems
- Distances in random graphs with finite variance degreesRemco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem · 2005 · Random Structures and Algorithms
- Weak percolation on multiplex networksG. J. Baxter, Sergey N. Dorogovtsev, José F. F. Mendes, Davide Cellai · 2014 · Physical Review E
- Global effects of local food-production crises: a virtual water perspectiveStefania Tamea, Francesco Laio, Luca Ridolfi · 2016 · Scientific Reports
- A Probabilistic Technique for Finding Almost-Periods of ConvolutionsErnie Croot, Olof Sisask · 2010 · Geometric and Functional Analysis
- Complex Systems: A Communication Networks Perspective Towards 6GCharalambos Sergiou, Marios Lestas, Pavlos Antoniou, Christos Liaskos, Andreas Pitsillides · 2020 · IEEE Access
- Graphs with specified degree distributions, simple epidemics, and local vaccination strategiesTom Britton, Svante Janson, Anders Martin‐Löf · 2007 · Advances in Applied Probability
- Robustness of centrality measures under uncertainty: Examining the role of network topologyTerrill L. Frantz, Marcelo Cataldo, Kathleen M. Carley · 2009 · Computational and Mathematical Organization Theory
- Structural equation modeling of a winnowed soil microbiome identifies how invasive plants re-structure microbial networksSteven D. Mamet, Ellen Redlick, Michelle Brabant, Eric Gordon Lamb, Bobbi L. Helgason, Kevin Gordon Stanley, Steven D. Siciliano · 2019 · The ISME Journal
- Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networksMaksim Kitsak, Shlomo Havlin, Gerald Paul · 2007 · Physical Review E
- The fundamental group of random 2-complexesEric K. Babson, Christopher Hoffman, Matthew Kahle · 2010 · Journal of the American Mathematical Society
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphsMohsen Bayati, David Gamarnik, Prasad Tetali · 2013 · The Annals of Probability
- HodgeRank on Random Graphs for Subjective Video Quality AssessmentQianqian Xu, Qingming Huang, Tingting Jiang · 2012 · IEEE Transactions on Multimedia
- Conditions that impact the complexity of QoS routingFernando A. Kuipers, P.F.A. Van Mieghem · 2005 · IEEE/ACM Transactions on Networking
- Local algorithms for independent sets are half-optimalMustazee Rahman, Bálint Virág · 2017 · The Annals of Probability
- Topological phase transitions in functional brain networksFernando A. N. Santos, Ernesto P. Raposo, Mauricio D. Coutinho-Filho, Mauro Copelli, Cornelis Jan Stam, Linda Douw · 2019 · Physical review. E
- Percolation on finite graphs and isoperimetric inequalitiesNoga Alon, Itai Benjamini, Alan Stacey · 2004 · The Annals of Probability
- On two Hamilton cycle problems in random graphsALAN M. FRIEZE, Michael Krivelevich · 2008 · Israel Journal of Mathematics
- Communication over a wireless network with random connectionsRadhika Gowaikar, Bertrand M. Hochwald, Babak Hassibi · 2006 · IEEE Transactions on Information Theory
- Robustness of Interdependent Cyber-Physical Systems Against Cascading FailuresYingrui Zhang, Osman Yağan · 2019 · IEEE Transactions on Automatic Control
- Discovering Hidden Groups in Communication NetworksJeff Baumes, Mark Goldberg, Malik Magdon‐Ismail · 2004 · Lecture notes in computer science
- Cliques and cycles in distance graphs and graphs of diametersAndrei Mikhailovich Raigorodskii · 2014 · Contemporary mathematics - American Mathematical Society
- Large graph limit for an SIR process in random network with heterogeneous connectivityLaurent Decreusefond, Jean-Stéphane Dhersin, Pascal Moyal · 2012 · The Annals of Applied Probability
- Partitioning and modularity of graphs with arbitrary degree distributionJörg Reichardt, Stefan Bornholdt · 2007 · Physical Review E
- Continuum percolation with steps in the square or the discPaul Balister, Béla Bollobás, Mark Walters · 2005 · Random Structures and Algorithms
- Long Chaotic Transients in Complex NetworksAlexander Zumdieck, Marc Timme, Theo Geisel, Fred Wolf · 2004 · Physical Review Letters
- Large graph limit for an SIR process in random network with heterogeneous connectivityLaurent Decreusefond, Pascal Moyal, Viet Chi Tran · 2012
- Distances in random graphs with finite variance degreesRemco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem · 2004 · arXiv (Cornell University)
- Bootstrap Percolation in High DimensionsJózsef Balogh, Béla Bollobás, Robert Morris · 2010 · Combinatorics Probability Computing
- Efficient Dynamic Barter ExchangeRoss Anderson, Itai Ashlagi, David Gamarnik · 2017 · Operations Research
- Regional Gossip Routing for Wireless Ad Hoc NetworksXiang‐Yang Li, Kousha Moaveninejad, Ophir Frieder · 2004 · Mobile Networks and Applications
- The Nonlinear Heat Equation on W-Random GraphsGeorgi S. Medvedev · 2013 · Archive for Rational Mechanics and Analysis
- A supernodal formulation of vertex colouring with applications in course timetablingEdmund K. Burke, Jakub Mareček, Andrew J. Parkes · 2010 · Annals of Operations Research
- A simple solution to the k‐core problemSvante Janson, Malwina Luczak · 2006 · Random Structures and Algorithms
- Random matrix analysis of complex networksSarika Jalan, Jayendra N. Bandyopadhyay · 2007 · Physical Review E
- Defining the Social Capital of the Board of Directors: An Exploratory StudyGavin John Nicholson, Malcolm Alexander, Geoffrey C. Kiel · 2004 · Journal of Management & Organization
- Boosting cooperation by involving extortion in spatial prisoner's dilemma gamesZhi-Xi Wu, Zhihai Rong · 2014 · Physical Review E
- Mathematical and computational approaches to epidemic modeling: a comprehensive reviewWei Duan, Zongchen Fan, Peng Zhang, Gang Guo, Xiaogang Qiu · 2015 · Frontiers of Computer Science
- The cover time of sparse random graphsColin Cooper, ALAN M. FRIEZE · 2006 · Random Structures and Algorithms
- Mining scale-free networks using geodesic clusteringAndrew Y. Wu, Michael Garland, Jiawei Han · 2004 · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
- Network Formation in the Presence of Contagious RiskLawrence E. Blume, David A. Easley, Jon Michael Kleinberg, Robert Kleinberg, Eva Tardos D · 2013 · ACM Transactions on Economics and Computation
- Inducing effect on the percolation transition in complex networksJin-Hua Zhao, Haijun Zhou, Yang‐Yu Liu · 2013 · Nature Communications
- An Improvement of the Lovász Local Lemma via Cluster ExpansionRodrigo Bissacot, Roberto Fernández, Aldo Procacci · 2011 · Combinatorics Probability Computing
- A Bandwidth-Aware Scheduling Strategy for P2P-TV SystemsAna Paula Couto da Silva, Emilio Leonardi, Marco Mellia · 2008 · International Conference on Peer-to-Peer Computing
- Landscape of Solutions in Constraint Satisfaction ProblemsMarc Mézard, Matteo Palassini, Olivier Rivoire · 2005 · Physical Review Letters
- Local dominance unveils clusters in networksDingyi Shi, Fan Shang, Bingsheng Chen, Paul Expert, Linyuan Lü, Eugene Stanley, Renaud Lambiotte, Tim Evans, Ruiqi Li · 2024 · Communications Physics
- Resting-state functional connectivity abnormalities in first-onset unmedicated depressionJunjie Chen, Hao Guo, Cheng Chen, Xiaohua Cao, Jie Xiang, Kerang Zhang · 2014 · Neural Regeneration Research
- Extremal results for random discrete structuresMathias Schacht · 2016 · Annals of Mathematics
- Sampling based sensor-network deploymentV. Ister, S. Kannan, Kostas Daniilidis · 2005 · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
- Online crowdsourcing subjective image quality assessmentQianqian Xu, Qingming Huang, Yuan Yao · 2012 · ACM International Conference on Multimedia (ACM MM)
- Cavity method for quantum spin glasses on the Bethe latticeChris R. Laumann, Antonello Scardicchio, Shivaji L. Sondhi · 2008 · Physical Review B
- Social goods dilemmas in heterogeneous societiesAlex McAvoy, Benjamin Allen, Martin A. Nowak · 2020 · RePEc: Research Papers in Economics
- The effects of evolutionary adaptations on spreading processes in complex networksRashad Eletreby, Yong Zhuang, Kathleen M. Carley, Osman Yağan, H. Vincent Poor · 2020 · Proceedings of the National Academy of Sciences
- Scalable, efficient epidemiological simulationStephen Eubank · 2002 · ACM Symposium on Applied Computing
- Approximability of Combinatorial Problems with Multi-agent Submodular Cost FunctionsGagan Goel, Chinmay Karande, Pushkar Tripathi · 2009 · Annual Symposium on Foundations of Computer Science
- Convergence of a Class of Multi-Agent Systems In Probabilistic FrameworkGongguo Tang, Lei Guo · 2007 · Journal of Systems Science and Complexity
- On the Feasibility and Efficacy of Protection Routing in IP NetworksKin-Wah Kwong, Lixin Gao, Roch A. Guérin · 2011 · IEEE/ACM Transactions on Networking
- A likelihood approach to analysis of network dataCarsten Wiuf, Markus Brameier, Oskar Hagberg, Michael P. H. Stumpf · 2006 · Proceedings of the National Academy of Sciences
- Lectures on the Ising and Potts Models on the Hypercubic LatticeHugo Duminil‐Copin · 2019 · Springer proceedings in mathematics & statistics
- RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc NetworksZiv Bar-Yossef, Roy Friedman, Gabriel Kliot · 2008 · ACM Transactions on Computer Systems
- Network Structures from Selection PrinciplesVittoria Colizza A, Jayanth R. Banavar, Amos Maritan, Andrea Rinaldo · 2004 · Physical Review Letters
- Agreement in presence of noise: pseudogradients on random geometric networksY. Hatano, A.K. Das, Mehran Mesbahi · 2006 · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes
- The ontogeny of scale-free syntax networks: phase transitions in early language acquisitionCOROMINAS-MURTRA, BERNAT, VALVERDE, SERGI, SOLÉ, RICARD · 2009 · Advances in Complex Systems
- Dynamics of tipping cascades on complex networksJonathan Krönke, Nico Wunderling, Ricarda Winkelmann, Arie Staal, Benedikt Stumpf, Obbe A. Tuinenburg, Jonathan F. Donges · 2020 · Physical review. E
- Approximating Longest Directed Paths and CyclesAndreas Björklund, Thore Husfeldt, Sanjeev Khanna · 2004 · Lecture notes in computer science
- Exclusion processes on networks as models for cytoskeletal transportIzaak Neri, Norbert Kern, Andrea Parmeggiani · 2013 · New Journal of Physics
- Mean Square Convergence of Consensus Algorithms in Random WSNsSilvana Silva Pereira, Alba Pagés-Zamora · 2010 · IEEE Transactions on Signal Processing
- THE LARGEST COMPONENT IN A SUBCRITICAL RANDOM GRAPH WITH A POWER LAW DEGREE DISTRIBUTIONSvante Janson · 2008
- On k−coverage in a mostly sleeping sensor networkSantosh D. Kumar, Ten Hwang Lai, József Balogh · 2006 · Wireless Networks
- Taming complexityAlbert-Ĺaszló Barabási · 2005 · Nature Physics
- On the Role of Network Centrality in the Controllability of Complex NetworksNicoletta Bof, Giacomo Baggio, Sandro Zampieri · 2016 · IEEE Transactions on Control of Network Systems
- Information propagation on modular networksLiang Huang, Kwangho Park, Ying‐Cheng Lai · 2006 · Physical Review E
- Promotion of cooperation on networks? The myopic best response caseCarlos P. Roca, J. A. Cuesta, A. Sánchez · 2009 · The European Physical Journal B
- Spectral characteristics of network redundancyBen D. MacArthur, Rubén J. Sánchez-García · 2009 · Physical Review E
- Dynamical clustering of exchange ratesDaniel J. Fenn, Mason Alexander Porter, Peter J. Mucha, Mark McDonald, Stacy Williams, Neil F. Johnson, Nick S. Jones · 2012 · Quantitative Finance
- The condition number of a randomly perturbed matrixVan H. Vu, Terence Tao · 2007 · ACM Symposium on Theory of Computing (STOC)
- Evolution of ribosomal protein network architecturesYouri Timsit, Grégoire Sergeant-Perthuis, Daniel Bennequin · 2021 · Scientific Reports
- Matching in hypergraphs of large minimum degreeDaniela Kühn, Deryk Osthus · 2006 · University of Birmingham Research Portal (University of Birmingham)
- Majority Bootstrap Percolation on the HypercubeJózsef Balogh, Béla Bollobás, Robert Morris · 2008 · Combinatorics Probability Computing
- Fast random graph generationSadegh Nobari, Xuesong Lu, Panagiotis Karras · 2011 · International Conference on Extending Database Technology (EDBT)
- Inhomogeneous Financial Networks and Contagious LinksHamed Amini, Andreea Minca · 2016 · Operations Research
- Data-aware multicastSebastien Baehni, Patrick Th. Eugster, Rachid Guerraoui · 2004 · IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
- Percolation framework to describe El Niño conditionsJun Meng, Jingfang Fan, Yosef Ashkenazy · 2017 · Chaos An Interdisciplinary Journal of Nonlinear Science
- Spectral theory of sparse non-Hermitian random matricesFernando Lucas Metz, Izaak Neri, Tim Rogers · 2019 · Journal of Physics A Mathematical and Theoretical
- Threshold values, stability analysis, and high- q asymptotics for the coloring problem on random graphsFlorent Krząkała, Andrea Pagnani, Martin Weigt · 2004 · Physical Review E
- PhaseCode: Fast and Efficient Compressive Phase Retrieval Based on Sparse-Graph CodesRamtin Pedarsani, Dong Yin, Kangwook Lee · 2014 · Allerton Conference on Communication, Control, and Computing
- Parsimonious flooding in dynamic graphsHervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud · 2009 · ACM Symposium on Principles of Distributed Computing (PODC)
- Density-Aware Routing in Highly Dynamic DTNs: The RollerNet CasePierre-Ugo Tournoux, Jérémie Leguay, Farid Benbadis · 2011 · IEEE Transactions on Mobile Computing
- Climate network percolation reveals the expansion and weakening of the tropical component under global warmingJingfang Fan, Jun Meng, Yosef Ashkenazy, Shlomo Havlin, Hans Joachim Schellnhuber · 2018 · Proceedings of the National Academy of Sciences
- Bootstrap Percolation in Living Neural NetworksHamed Amini · 2010 · Journal of Statistical Physics
- Random popular matchingsMohammad Mahdian · 2006 · ACM Conference on Electronic Commerce (EC)
- Asymptotic normality of the k-core in random graphsSvante Janson, Malwina Luczak · 2008 · The Annals of Applied Probability