Tail Index Estimation of PageRanks in Evolving Random Graphs by Natalia Markovich, Maksim Ryzhov, Marijus Vaičiulis

Subjects: “…random graph…”
Get full text

The probability of planarity of a random graph near the critical point by Marc Noy, Vlady Ravelomanana, Juanjo Rué

Subjects: “…random graphs…”
Get full text

Global Random Graph Convolution Network for Hyperspectral Image Classification by Chaozi Zhang, Jianli Wang, Kainan Yao

“…To address this problem, we propose a supervised framework called the Global Random Graph Convolution Network (GR-GCN). A novel method of constructing the graph is adopted for the network, where the graph is built by randomly sampling from the labeled data of each class. …”
Get full text

Using an Exponential Random Graph Model to Recommend Academic Collaborators by Hailah Al-Ballaa, Hmood Al-Dossari, Azeddine Chikh

Subjects: Get full text

Construction and Analysis of Queuing and Reliability Models Using Random Graphs by Gurami Tsitsiashvili

Get full text

Two critical localization lengths in the Anderson transition on random graphs by I. García-Mata, J. Martin, R. Dubertrand, O. Giraud, B. Georgeot, G. Lemarié

“…We present a full description of the nonergodic properties of wave functions on random graphs without boundary in the localized and critical regimes of the Anderson transition. …”
Get full text

Upper bounds on the non- 3-colourability threshold of random graphs by Nikolaos Fountoulakis, Colin McDiarmid

“…We present a full analysis of the expected number of `rigid' 3-colourings of a sparse random graph. This shows that, if the average degree is at least 4.99, then as n → ∞ the expected number of such colourings tends to 0 and so the probability that the graph is 3-colourable tends to 0. …”
Get full text

On the use of random graphs in analysing resource utilization in urban systems by Hadi Arbabi, Giuliano Punzo, Gregory Meyers, Ling Min Tan, Qianqian Li, Danielle Densley Tingley, Martin Mayfield

Subjects: Get full text

A survey on exponential random graph models: an application perspective by Saeid Ghafouri, Seyed Hossein Khasteh

Subjects: “…Exponential random graph models survey…”
Get full text

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing. by Fabrizio Altarelli, Alfredo Braunstein, Luca Dall'Asta, Caterina De Bacco, Silvio Franz

“…We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. …”
Get full text

Estrada and L-Estrada Indices of Edge-Independent Random Graphs by Yilun Shang

Subjects: Get full text

Logical properties of random graphs from small addable classes by Anuj Dawar, Eryk Kopczyński

Get full text

Upper bounds on the non-3-colourability threshold of random graphs by Nikolaos Fountoulakis, Colin McDiarmid

Subjects: Get full text

Differential Privacy for Binary Functions via Randomized Graph Colorings by D'Oliveira, Rafael GL, Medard, Muriel, Sadeghi, Parastoo

Get full text

HodgeRank on random graphs for subjective video quality assessment by Lin, Weisi, Xu, Qianqian., Huang, Qingming., Jiang, Tingting., Yan, Bowei., Yao, Yuan.

“…Two types of random graph models are studied, i.e., Erdös-Rényi random graphs and random regular graphs. …”
Get full text
Get full text

Fast mixing via polymers for random graphs with unbounded degree by Galanis, A, Goldberg, L, Stewart, J

“…For example, sparse random graphs typically have bounded average degree and good expansion properties, but they include vertices with unbounded degree, and therefore are excluded from the current polymer-model framework.…”

Some problems related to the Karp-Sipser algorithm on random graphs by Kreacic, E

Subjects: “…Random graphs…”

Random cliques in random graphs and sharp thresholds for F-factors by Riordan, O

“…<p>We show that for each r &ge; 4, in a density range extending up to, and slightly beyond, the threshold for a Kr-factor, the copies of Kr in the random graph G(n, p) are randomly distributed, in the (one-sided) sense that the hypergraph that they form contains a copy of a binomial random hypergraph with almost exactly the right density. …”

Fast mixing via polymers for random graphs with unbounded degree by Galanis, A, Goldberg, L, Stewart, J

“…For example, sparse random graphs typically have bounded average degree and good expansion properties, but they include vertices with unbounded degree, and therefore are excluded from the current polymer-model framework. …”

How does the chromatic number of a random graph vary? by Heckel, A, Riordan, O