Results 51 to 60 of about 154 (96)
Almost All Graphs With 2.522n Edges Are Not 3-Colorable
, 1999 We prove that for c 2:522 a random graph with n vertices and m = cn edges is not 3-colorable with probability 1 \Gamma o(1). Similar bounds for non-k-colorability are given for k ? 3.
Achlioptas, D. +3 more
core
Systemic cascades on inhomogeneous random financial networks. [PDF]
Math Financ Econ, 2023 Hurd TR.
europepmc +1 more source
Solving the migration-recombination equation from a genealogical point of view. [PDF]
J Math Biol, 2021 Alberti F +3 more
europepmc +1 more source
Sidorenko hypergraphs and random Turán numbers
Let \(\mathrm{ex}(G_{n,p}^r,F)\) denote the maximum number of edges in an \(F\)-free subgraph of the random \(r\)-uniform hypergraph \(G_{n,p}^r\), and let \[s(F):=\sup\{s: \exists H, t_F(H)=t_{K_r^r}(H)^{s+e(F)}›0\}.\] Following recent work of Conlon ...
Spiro, Sam, Nie, Jiaxi
core +1 more source
A Semiparametric Bayesian Approach to Epidemics, with Application to the Spread of the Coronavirus MERS in South Korea in 2015. [PDF]
J Nonparametr Stat, 2022 Schweinberger M, Bomiriya RP, Babkin S.
europepmc +1 more source
Eigenvalues of random power law graphs
, 2003 AMS Subject Classification: 05C80 Abstract. Many graphs arising in various information networks exhibit the “power law ” behavior — the number of vertices of degree k is proportional to k−β for some positive β.
Van Vu, Linyuan Lu, Fan Chung
core
Ramsey-Type Results for Oriented Trees
, 2007 . For a graph G and a digraph ~ H, we write G! ~ H (respectively, G a ! ~ H) if every orientation (respectively, acyclic orientation) of the edges of G results in an induced copy of ~ H. In this note we study how small the graphs G such that G!
Vojtech Rödl +2 more
core
Threshold functions for asymmetric Ramsey properties involving cycles
Random Struct. Algorithms, 1997 Y. Kohayakawa, Bernd Kreuter
semanticscholar +1 more source
A Greedy Algorithm Estimating The Height Of Random Trees
, 2007 . The behaviour of a greedy algorithm which estimates the height of a random labelled rooted tree is studied. A self-similarity argument is used to characterize the limit distribution of the length H of the path found by such an algorithm in a random ...
Tomasz Luczaky
core
Non-hyperbolicity in random regular graphs and their traffic characteristics
Open Mathematics, 2013 Tucci Gabriel
doaj +1 more source