Results 31 to 40 of about 154 (96)

Resilience for tight Hamiltonicity [PDF]

We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any \(\gamma›0\) and \(k\ge3\), we show that asymptotically almost surely, every subgraph of the binomial random \(k\)-uniform hypergraph \(G^{(k)
Pfenninger, Vincent, Parczyk, Olaf, Allen, Peter   +2 more
core   +1 more source

INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES

Forum of Mathematics, Sigma, 2016
Let $L$ be a countable language. We say that a countable infinite $L$
NATHANAEL ACKERMAN, CAMERON FREER, REHANA PATEL   +2 more
doaj   +1 more source

Mixing Cutoff for Simple Random Walks on the Chung–Lu Digraph

Random Structures &Algorithms, Volume 66, Issue 1, January 2025.
ABSTRACT In this article, we are interested in the mixing behavior of simple random walks on inhomogeneous directed graphs. We focus our study on Chung–Lu digraphs, which are inhomogeneous networks that generalize Erdös–Rényi digraphs, and where edges are included independently and according to given Bernoulli laws.
Alessandra Bianchi, Giacomo Passuello
wiley   +1 more source

Zagreb connection indices on polyomino chains and random polyomino chains

Open Mathematics
In this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this framework, the article
Sigarreta Saylé, Cruz-Suárez Hugo
doaj   +1 more source

Two-Point Concentration of the Independence Number of the Random Graph

Forum of Mathematics, Sigma
We show that the independence number of $ G_{n,p}$ is concentrated on two values if $ n^{-2/3+ \epsilon } < p \le 1$ . This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in ...
Tom Bohman, Jakob Hofstad
doaj   +1 more source

Sharp thresholds for Ramsey properties

Forum of Mathematics, Sigma
In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as noncolourability of auxiliary hypergraphs.
Ehud Friedgut, Eden Kuperwasser, Wojciech Samotij, Mathias Schacht   +3 more
doaj   +1 more source

Forest Fire Model on Configuration Graphs with Random Node Degree Distribution [PDF]

, 2017
We consider two types of configuration graphs with node degrees being i.i.d. random variables following either the power-law or the Poisson distribution.
Leri, Marina M.
core   +1 more source

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

Ranking algorithms on directed configuration networks

, 2014
This paper studies the distribution of a family of rankings, which includes Google’s PageRank, on a directed configuration model. In particular, it is shown that the distribution of the rank of a randomly chosen node in the graph converges in ...
Litvak, Nelly, Olvera-Cravioto, Mariana, Chen, Ningyuan   +2 more
core   +1 more source

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