相关论文: Single Perturbative Splitting Diagrams in Double P…
This paper makes two main contributions: The first is the construction of a near-minimum spanning tree with constant average distortion. The second is a general equivalence theorem relating two refined notions of distortion: scaling…
\noindent A paired coalition in a graph $G=(V,E)$ consists of two disjoint sets of vertices $V_1$ and $V_2$, neither of which is a paired dominating set but whose union $V_1 \cup V_2$ is a paired dominating set. A paired coalition partition…
The $NN$ scattering near inelastic threshold is sensitive to the long-range diagonal interaction in the produced isobar channel. Earlier models included meson exchange potentials in the $NN$ sector and connecting that sector to isobar…
By combining the color dipole model of the nucleon with the assumption that cross sections behave asymptotically as $\ln^2(s)$, we are able to describe the data for photon, neutrino and hadron interactions with protons at all energies, $s$…
We use new scaling variables $x_w$ and $\xi_w$, and add low $Q^2$ modifications to GRV94 and GRV98 leading order parton distribution functions such that they can be used to model electron, muon and neutrino inelastic scattering cross…
We study the amplitude of deeply virtual Compton scattering in next-to-leading order of perturbation theory including the two-loop evolution effects for different sets of skewed parton distributions (SPDs). It turns out that in the minimal…
We introduce a system of two parallel-coupled discrete nonlinear Schroedinger (DNLS) inhomogeneous chains. Each one favors the unidirectional transmission of incident packets, in the opposite directions with respect to each other. Two…
A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a…
In this thesis, we present new techniques to deal with fundamental algorithmic graph problems where graphs are directed and partially dynamic, i.e. undergo either a sequence of edge insertions or deletions: - Single-Source Reachability…
Vector perturbation (VP) precoding is an effective nonlinear precoding technique in the downlink (DL) with modulo channels, providing an approximation of dirty paper coding (DPC) which is capacity-achieving. Especially, when combined with…
We investigate several ingredients for a theory of multiple hard scattering in hadron-hadron collisions. Issues discussed include the space-time structure of multiple interactions, their power behavior, spin and color correlations,…
The 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the most basic NP-hard (Survivable) Network Design problems: we are given an (unweighted) undirected graph $G$. Our goal is to find a spanning subgraph $S$ of $G$ with the…
General formalism for a two-component description of the inelastic lepton-nucleon scattering in the diffractive region is proposed. Nonperturbative contribution to electromagnetic structure functions of a nucleon is described by the…
High-energy proton-proton collisions at the LHC offer a stringent test of Quantum Chromodynamics (QCD) in the small-$x$, gluon-dominated regime. This study focus on a minimal, gluon-driven framework to describe the charged-particle…
The precise knowledge of parton distribution functions (PDFs) is indispensable to the accurate calculation of hadron-initiated QCD hard scattering observables. Much of our information on PDFs is extracted by comparing deep inelastic…
We present next-to-leading order (NLO) perturbative-QCD calculations of the cross sections for $\ell N\to h X$ and $\ell N\to \mathrm{jet}\, X$. The main feature of these processes is that the scattered lepton is not observed, so that the…
A drawing of a graph is 1-planar if each edge participates in at most one crossing and adjacent edges do not cross. Up to symmetry, each crossing in a 1-planar drawing belongs to one out of six possible crossing types, where a type…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
We present new short proofs of known spanning tree enumeration formulae for threshold and Ferrers graphs by showing that the Laplacian matrices of such graphs admit triangular rank-one perturbations. We then characterize the set of graphs…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…