Results 41 to 50 of about 154 (96)
Length spectrum of large genus random metric maps
Forum of Mathematics, SigmaWe study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichmüller theory approach.
Simon Barazer +2 more
doaj +1 more source
On the validations of the asymptotic matching conjectures
, 2020 In this paper we review the asymptotic matching conjectures for rregular bipartite graphs, and their connections in estimating the monomerdimer entropies in d-dimensional integer lattice and Bethe lattices.
S Friedland +3 more
core
New Ramsey Bounds from Cyclic Graphs of Prime Order
, 1995 1991 Mathematics Subject Classification. 05D10, 05C80.We present new explicit lower bounds for some Ramsey numbers. All the graphs are cyclic, and are on a prime number of vertices.
Tovey, Craig A. +2 more
core
Computational validations of the asymptotic matching conjectures
, 2005 We describe several computational validations of the asymptotic matching conjectures for r-regular bipartite graphs. These validations are based on algorithms for computation of d-dimensional monomerdimer entropies in statistical mechanics and asymptotic
S Friedland +3 more
core
Conflict-free coloring of graphs
, 2013 We study the conflict-free chromatic number χCF of graphs from ex-tremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number an n-vertex graph can have. Our construction is randomized.
Tibor Szabó +2 more
core
q-Series Arising from the Study of Random Graphs
, 1997 . This paper deals with q--series arising from the study of the transitive closure problem in random acyclic digraphs. In particular it presents an identity involving divisor generating functions which allows to determine the asymptotic behavior of ...
George E. Andrews +2 more
core
Fluctuations of the connectivity threshold and largest nearest-neighbour link [PDF]
Subjects: Primary: 60D05 , 60F05. Secondary: 05C80 , 60G70.A preprint version of the article is available at arXiv:2406.00647v3 [math.PR] (https://arxiv.org/abs/2406.00647) under a CC BY license.
Penrose, MD, Yang, X
core +1 more source
Special issue on statistical analysis of networks: Preface by the guest editors. [PDF]
Stat Methods Appt, 2021 Schweinberger M, Stingo FC, Vitale MP.
europepmc +1 more source
, 2005 Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees.
Zsolt Katona
core
Kolmogorov Random Graphs And The Incompressibility Method
, 1997 . We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method.
John Tromp +3 more
core