Results 31 to 40 of about 1,157 (63)

Extremal, enumerative and probabilistic results on ordered hypergraph matchings

Forum of Mathematics, Sigma
An ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos, Zhihan Jin, Matthew Kwan, Benny Sudakov   +3 more
doaj   +1 more source

An example of graph limits of growing sequences of random graphs

, 2013
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary distribution ...
Janson, Svante, Severini, Simone
core   +3 more sources

Degree-penalized contact processes

Forum of Mathematics, Sigma
In this paper we study degree-penalized contact processes on Galton-Watson (GW) trees and the configuration model. The model we consider is a modification of the usual contact process on a graph.
Zsolt Bartha, Júlia Komjáthy, Daniel Valesin   +2 more
doaj   +1 more source

High-Precision Entropy Values for Spanning Trees in Lattices

, 2003
Shrock and Wu have given numerical values for the exponential growth rate of the number of spanning trees in Euclidean lattices. We give a new technique for numerical evaluation that gives much more precise values, together with rigorous bounds on the ...
Ball K, Burton R M, Jessica L Felker, Kirchhoff G, Lyons R, Lyons R, Montroll E, Pemantle R, Russell Lyons, Shrock R, Sokal A D, Spitzer F   +11 more
core   +1 more source

Length spectrum of large genus random metric maps

Forum of Mathematics, Sigma
We 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, Alessandro Giacchetto, Mingkun Liu   +2 more
doaj   +1 more source

Distinguishing Chromatic Number of Random Cayley graphs

, 2016
The \textit{Distinguishing Chromatic Number} of a graph $G$, denoted $\chi_D(G)$, was first defined in \cite{collins} as the minimum number of colors needed to properly color $G$ such that no non-trivial automorphism $\phi$ of the graph $G$ fixes each ...
Balachandran, Niranjan, Padinhatteeri, Sajith   +1 more
core   +1 more source

Mantel's Theorem for random graphs [PDF]

, 2012
For a graph $G$, denote by $t(G)$ (resp. $b(G)$) the maximum size of a triangle-free (resp. bipartite) subgraph of $G$. Of course $t(G) \geq b(G)$ for any $G$, and a classic result of Mantel from 1907 (the first case of Tur\'an's Theorem) says that ...
DeMarco, Bobby, Kahn, Jeff
core  

Respondent driven sampling and sparse graph convergence

, 2017
We consider a particular respondent-driven sampling procedure governed by a graphon. By a specific clumping procedure of the sampled vertices we construct a sequence of sparse graphs.
Athreya, Siva, Röllin, Adrian
core   +1 more source

Making multigraphs simple by a sequence of double edge swaps

, 2021
We show that any loopy multigraph with a graphical degree sequence can be transformed into a simple graph by a finite sequence of double edge swaps with each swap involving at least one loop or multiple edge.
Sjöstrand, Jonas
core  

Phase transitions in exponential random graphs

, 2013
We derive the full phase diagram for a large family of two-parameter exponential random graph models, each containing a first order transition curve ending in a critical point.Comment: Published in at http://dx.doi.org/10.1214/12-AAP907 the Annals of ...
Radin, Charles, Yin, Mei
core   +1 more source