8 papers
Digraphons: connectivity and spectral aspects
Jan Hladký, Petr Savický
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymm…
Inhomogeneous random 2-SAT
Jan Hladký, Petr Savický
We introduce an inhomogeneous variant of random 2-SAT. Each variable is assigned a type from a state space , independently at random. Clause inclusion is gover…
Graphon branching processes and fractional isomorphism
Jan Hladký, Eng Keat Hng, Anna Margarethe Limbach
In their study of the giant component in inhomogeneous random graphs, Bollobás, Janson, and Riordan introduced a class of branching processes parametrized by a possibly unbounded…
Machine Learning-Assisted Measurement of Lepton-Jet Azimuthal Angular Asymmetries in Deep-Inelastic Scattering at HERA
The H1 collaboration, V. Andreev, M. Arratia +141
In deep-inelastic positron-proton scattering, the lepton-jet azimuthal angular asymmetry is measured using data collected with the H1 detector at HERA. When the average transverse…
On cospectral graphons
Jan Hladký, Daniel IľkoviÄ, Jared León +1
In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectr…
A tower lower bound for the degree relaxation of the Regularity Lemma
Frederik Garbe, Jan Hladký
It is well-known that if is an -regular pair (in the sense of Szemerédi) then there exist sets and with $|A'|\leq \var…