A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A note on random 2-SAT with prescribed literal degrees
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
MGV: A System for Visualizing Massive Multidigraphs
IEEE Transactions on Visualization and Computer Graphics
Some Notes on Random Satisfiability
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Random evolution in massive graphs
Handbook of massive data sets
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Simple Laws for Complex Networks
BT Technology Journal
Combinatorics, Probability and Computing
Bipartite structure of all complex networks
Information Processing Letters
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
Convergence law for random graphs with specified degree sequence
ACM Transactions on Computational Logic (TOCL)
Kauffman networks: analysis and applications
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Preface: A brief overview of network algorithms
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Connectivity in wireless ad-hoc networks with a log-normal radio model
Mobile Networks and Applications
Thresholds for virus spread on networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Relevance of massively distributed explorations of the internet topology: qualitative results
Computer Networks: The International Journal of Computer and Telecommunications Networking
Colouring Random 4-Regular Graphs
Combinatorics, Probability and Computing
The phase transition in inhomogeneous random graphs
Random Structures & Algorithms
The k-orientability thresholds for Gn, p
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Analyzing the vulnerability of superpeer networks against attack
Proceedings of the 14th ACM conference on Computer and communications security
The critical phase for random graphs with a given degree sequence
Combinatorics, Probability and Computing
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Toward formal models of biologically inspired, highly parallel machine cognition
International Journal of Parallel, Emergent and Distributed Systems
A new approach to the giant component problem
Random Structures & Algorithms
A scale-free graph model based on bipartite graphs
Discrete Applied Mathematics
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
Journal of the ACM (JACM)
Graph Theoretic Topological Analysis of Web Service Networks
World Wide Web
Extracting influential nodes for information diffusion on a social network
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Random intersection graphs with tunable degree distribution and clustering
Probability in the Engineering and Informational Sciences
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Extracting influential nodes on a social network for information diffusion
Data Mining and Knowledge Discovery
A Survey of Statistical Network Models
Foundations and Trends® in Machine Learning
Connectedness profiles in protein networks for the analysis of gene expression data
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Effect of dynamicity on peer to peer networks
HiPC'07 Proceedings of the 14th international conference on High performance computing
Random graphs with forbidden vertex degrees
Random Structures & Algorithms
The scaling window for a random graph with a given degree sequence
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Impact of random failures and attacks on Poisson and power-law random networks
ACM Computing Surveys (CSUR)
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence
SIAM Journal on Discrete Mathematics
Immunization strategies for networks with scale-free topology
NOLASC'06 Proceedings of the 5th WSEAS international conference on Non-linear analysis, non-linear systems and chaos
Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks
A theoretical analysis of the structure of HC-128
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Developing analytical framework to measure robustness of peer-to-peer networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Efficient and simple generation of random simple connected graphs with prescribed degree sequence
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Component structure of the vacant set induced by a random walk on a random graph
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The rigidity transition in random graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Cores of random r-partite hypergraphs
Information Processing Letters
An analysis of one-dimensional schelling segregation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Characterize scientific domain and domain context
Proceedings of the 12th ACM/IEEE-CS joint conference on Digital Libraries
The scaling window for a random graph with a given degree sequence
Random Structures & Algorithms
Small worlds and Red Queens in the Global Workspace: An information-theoretic approach
Cognitive Systems Research
Comparative analysis of articulated and behavioural social networks in a social news sharing website
The New Review of Hypermedia and Multimedia - Special issue on Social Linking and Hypermedia
SIR epidemics on random graphs with a fixed degree sequence
Random Structures & Algorithms
Push- and pull-based epidemic spreading in networks: Thresholds and deeper insights
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Identifying influential nodes in complex networks with community structure
Knowledge-Based Systems
Why do simple algorithms for triangle enumeration work in the real world?
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.02 |
Given a sequence of nonnegative real numbers λ0, λ1, … that sum to 1, we consider a random graph having approximately λin vertices of degree i. In [12] the authors essentially show that if ∑i(i−2)λi0 then the graph a.s. has a giant component, while if ∑i(i−2)λi0, λ′1 … such that a.s. the giant component, C, has εn+o(n) vertices, and the structure of the graph remaining after deleting C is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i.