Results 11 to 20 of about 267,735 (315)
Logconcave random graphs [PDF]
Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008 We propose the following model of a random graph on $n$ vertices. Let $F$ be a distribution in $R_+^{n(n-1)/2}$ with a coordinate for every pair $ij$ with $1 \le i,j \le n$. Then $G_{F,p}$ is the distribution on graphs with $n$ vertices obtained by picking a random point $X$ from $F$ and defining a graph on $n$ vertices whose edges are pairs $ij$ for ...
Frieze, Alan +2 more
openaire +4 more sources
Random Walk Graph Auto-Encoders With Ensemble Networks in Graph Embedding
IEEE Access, 2023 Recently graph auto-encoders have received increasingly widespread attention as one of the important models in the field of deep learning. Existing graph auto-encoder models only use graph convolutional neural networks (GCNs) as encoders to learn the ...
Chengxin Xie +3 more
doaj +1 more source
Combinatorica, 1988 We introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular family of graphs possesses some property in this class.
Chung, F. R. K. +2 more
openaire +3 more sources
Random Graph Isomorphism [PDF]
SIAM Journal on Computing, 1980 Summary: A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i.e. all but \(O(2^{\binom n2})\) of the \(2^{\binom n2})\) graphs on \(n\) vertices). Hence, for almost all graphs \(X\), and graph \(Y\) can be easily tested for isomorphism to \(X\) by an extremly naive linear time algorithm.
Babai, Laszlo +2 more
openaire +2 more sources
Random matrices and random graphs
ESAIM: Proceedings and Surveys, 2023 We collect recent results on random matrices and random graphs. The topics covered are: fluctuations of the empirical measure of random matrices, finite-size effects of algorithms involving random matrices, characteristic polynomial of sparse matrices and Voronoi tesselations of split trees.
Capitaine, Mireille +4 more
openaire +3 more sources
The Electronic Journal of Combinatorics, 2009 We study a random even subgraph of a finite graph $G$ with a general edge-weight $p\in(0,1)$. We demonstrate how it may be obtained from a certain random-cluster measure on $G$, and we propose a sampling algorithm based on coupling from the past. A random even subgraph of a planar lattice undergoes a phase transition at the parameter-value ${1\over2 ...
Grimmett, Geoffrey, Janson, Svante
openaire +3 more sources
Data Collection Based on Opportunistic Node Connections in Wireless Sensor Networks
Sensors, 2018 The working⁻sleeping cycle strategy used for sensor nodes with limited power supply in wireless sensor networks can effectively save their energy, but also causes opportunistic node connections due to the intermittent communication mode, which can ...
Guisong Yang, Zhiwei Peng, Xingyu He
doaj +1 more source
A Continuous-Time Network Evolution Model Describing 2- and 3-Interactions
Mathematics, 2021 A continuous-time network evolution model is considered. The evolution of the network is based on 2- and 3-interactions. 2-interactions are described by edges, and 3-interactions are described by triangles.
István Fazekas, Attila Barta
doaj +1 more source
The Electronic Journal of Combinatorics, 2009 We introduce a pair of natural, equivalent models for random threshold graphs and use these models to deduce a variety of properties of random threshold graphs. Specifically, a random threshold graph $G$ is generated by choosing $n$ IID values $x_1,\ldots,x_n$ uniformly in $[0,1]$; distinct vertices $i,j$ of $G$ are adjacent exactly when $x_i + x_j \ge
Reilly, Elizabeth Perez +1 more
openaire +2 more sources