Results 41 to 50 of about 1,253 (97)

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

The rank of random regular digraphs of constant degree

, 2018
Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with probability going to
Litvak, Alexander, Lytova, Anna, Tikhomirov, Konstantin, Tomczak-Jaegermann, Nicole, Youssef, Pierre   +4 more
core   +2 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

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

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

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  

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  

Rainbow $k$-connectivity of random bipartite graphs [PDF]

, 2012
A path in an edge-colored graph $G$ is called a rainbow path if no two edges of the path are colored the same. The minimum number of colors required to color the edges of $G$ such that every pair of vertices are connected by at least $k$ internally ...
Chen, Xiaolin, Li, Xueliang, Lian, Huishu   +2 more
core  

Optimal Berry-Esseen bounds on the Poisson space [PDF]

, 2015
We establish new lower bounds for the normal approximation in the Wasserstein distance of random variables that are functionals of a Poisson measure.
Azmoodeh, Ehsan, Peccati, Giovanni
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