Results 81 to 90 of about 5,903,622 (201)
Non symmetric random walk on infinite graph [PDF]
Opuscula Mathematica, 2011 We investigate properties of a non symmetric Markov's chain on an infinite graph. We show the connection with matrix valued random walk polynomials which satisfy the orthogonality formula with respect to non a symmetric matrix valued measure.
Marcin J. Zygmunt
doaj +1 more source
, 1997 Revised chapter for new edition of book "The Mathematics of Paul Erd\H{o}s"
openaire +2 more sources
Random Regular Graph States Are Complex at Almost Any Depth
PRX QuantumGraph states are fundamental objects in the theory of quantum information due to their simple classical description and rich entanglement structure. They are also intimately related to instantaneous quantum polynomial-time (IQP) circuits, which have ...
Soumik Ghosh +2 more
doaj +1 more source
On the Edge-Connectivity of an Uncertain Random Graph
IEEE Access, 2020 Connectivity is one of the most important concepts in graph theory. When graph theory is applied to complex systems with indeterminate factors, uncertainty and randomness are two basic types of indeterminacy.
Hao Li, Hui Zhang
doaj +1 more source
Subgraphs of random graphs [PDF]
Transactions of the American Mathematical Society, 1985 Let Δ ⊆ [ ω ] 2 \Delta \subseteq {[\omega ]^2} be an undirected graph on ω \omega , and let u ∈ [ 0 , 1 ] u \in [0,\,1] . Following P. Erdös and A.
Fremlin, David H., Talagrand, Michel
openaire +1 more source
Heterogeneous Graph Neural Network
Knowledge Discovery and Data Mining, 2019 Representation learning in heterogeneous graphs aims to pursue a meaningful vector representation for each node so as to facilitate downstream applications such as link prediction, personalized recommendation, node classification, etc. This task, however,
Chuxu Zhang +4 more
semanticscholar +1 more source
Network Motifs: Mean and Variance for the Count
Revstat Statistical Journal, 2006 Network motifs are at the core of modern studies on biological networks, trying to encompass global features such as small-world or scale-free properties. Detection of significant motifs may be based on two different approaches: either a comparison with
C. Matias +4 more
doaj +1 more source
Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs
Discrete Applied Mathematics, 2012 We prove that the treewidth of an Erd s-R nyi random graph $\rg{n, m}$ is, with high probability, greater than $ n$ for some constant $ > 0$ if the edge/vertex ratio $\frac{m}{n}$ is greater than 1.073. Our lower bound $\frac{m}{n} > 1.073$ improves the only previously-known lower bound.
openaire +2 more sources
Special Generation of Random Graphs and Statistical Study of Some of Their Invariants
MathematicsIn this paper, we generate random graphs for a specific area, namely, models of real communication networks. We propose a method that determines the “best” invariant; the corresponding basic algorithm is as follows.
Boris Melnikov, Bowen Liu
doaj +1 more source
Toward Reliability of Long Wireless Sensor Networks
IEEE AccessWireless sensor networks have become pervasive in various applications, including environmental monitoring, smart cities, precision agriculture, and healthcare.
Vladimir V. Shakhov +4 more
doaj +1 more source