Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,629 papers from all fields of science
Search
Sign In
Create Free Account
Random graph
Known as:
Pseudorandom graph
, Random network
, Probabilistic graph theory
Expand
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Algebraic connectivity
Bruce Reed (mathematician)
Chromatic polynomial
Clique problem
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Topology-aware virtual network embedding based on closeness centrality
Zihou Wang
,
Yanni Han
,
Tao Lin
,
Yuemei Xu
,
S. Ci
,
Hui Tang
Frontiers of Computer Science
2013
Corpus ID: 9155464
Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate…
Expand
2009
2009
Reliable Wireless Broadcast with Random Network Coding for Real-Time Applications
Yoshihisa Kondo
,
H. Yomo
,
S. Yamaguchi
,
P. Davis
,
R. Miura
,
S. Obana
IEEE Wireless Communications and Networking…
2009
Corpus ID: 18115988
A multi-player video game via wireless connections using portable devices is one of the most popular applications of ad-hoc…
Expand
2008
2008
Hybrid ARQ-random network coding for wireless media streaming
Dong Nguyen
,
Tuan Tran
,
Thinh P. Q. Nguyen
,
B. Bose
Second International Conference on Communications…
2008
Corpus ID: 2099460
This paper proposes hybrid ARQ-random network coding frameworks for real-time media broadcast over single-hop wireless networks…
Expand
2005
2005
Distributed Systems Diagnosis Using Belief Propagation
I. Rish
2005
Corpus ID: 14641441
In this paper, we focus on diagnosis in distributed computer systems using end-to-end transactions, or probes. Diagnostic problem…
Expand
2004
2004
Cluster-based routing overhead in networks with unreliable nodes
Huaming Wu
,
A. Abouzeid
IEEE Wireless Communications and Networking…
2004
Corpus ID: 11968700
While several cluster based routing algorithms have been proposed for ad hoc networks, there is a lack of formal mathematical…
Expand
2003
2003
Peer-to-peer over ad-hoc networks: (re)configuration algorithms
Fernanda P. Franciscani
,
Marisa A. Vasconcelos
,
Rainer P. Couto
,
A. Loureiro
Proceedings International Parallel and…
2003
Corpus ID: 12267701
A peer-to-peer network over an ad-hoc infrastructure is a powerful combination that provides users with means to access different…
Expand
Review
2003
Review
2003
PROPERTIES OF NONUNIFORM RANDOM GRAPH MODELS
Satu Virtanen
2003
Corpus ID: 116394906
This is a survey on network models designed to produce graphs that resemble natural networks. Unlike artificially generated…
Expand
1998
1998
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
A. Panholzer
,
H. Prodinger
Random Struct. Algorithms
1998
Corpus ID: 120364815
Hoare’s FIND algorithm can be used to select p specified order statistics n Ž . 4 j , . . . , j from a file of n elements…
Expand
1991
1991
Analysis of data fusion methods in certainty grids application to collision danger monitoring
E. A. Puente
,
Luis Moreno
,
M. Salichs
,
D. Gachet
International Conference on Industrial…
1991
Corpus ID: 151645557
The authors focus on the use of the occupancy grid representation to maintain and combine the information acquired from sensors…
Expand
1973
1973
Interpreting electron micrographs of amorphous solids
M. Berry
,
P. A. Doyle
1973
Corpus ID: 122344598
Using the diffraction theory of random wavefunctions, it is argued that recent interference electron microscopy of thin amorphous…
Expand