相关论文: A Coupling, and the Darling-Erdos Conjectures
The high temperature superconductivity in cuprate materials1 has puzzled scientists over twenty years. We must find a new way to understand superconductivity. It is found the spin-charge correlation may dominate the superconductivity2, and…
Classical coupling constructions arrange for copies of the \emph{same} Markov process started at two \emph{different} initial states to become equal as soon as possible. In this paper, we consider an alternative coupling framework in which…
We consider weighted double Hurwitz numbers, with the weight given by arbitrary rational function times an exponent of the completed cycles. Both special singularities are arbitrary, with the lengths of cycles controlled by formal…
We explore the behavior and establish new properties of the cumulative-sum process (CUSUM) and its running maximum. The study includes precise expressions for CUSUM's moment generating function and moments, fast recursive computing…
We consider a branching particle system consisting of particles moving according to the Ornstein-Uhlenbeck process in $\Rd$ and undergoing a binary, supercritical branching with a constant rate $\lambda>0$. This system is known to fulfil a…
The multiplicative coalescent is a mean-field Markov process in which any pair of blocks coalesces at rate proportional to the product of their masses. In Aldous and Limic (1998) each extreme eternal version of the multiplicative coalescent…
Markovian maximal couplings of Markov processes are characterized by an equality of total variation and a distance of Wasserstein type. If a Markovian maximal coupling is a Feller process, the generator can be calculated, e.g. for…
We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…
A family $\mathcal F\subset {[n]\choose k}$ is $U(s,q)$ of for any $F_1,\ldots, F_s\in \mathcal F$ we have $|F_1\cup\ldots\cup F_s|\le q$. This notion generalizes the property of a family to be $t$-intersecting and to have matching number…
We propose an approach for inferring strength of coupling between two systems from their transient dynamics. This is of vital importance in cases where most information is carried by the transients, for instance in evoked potentials…
In order to obtain functional limit theorems for heavy tailed stationary processes arising from dynamical systems, one needs to understand the clustering patterns of the tail observations of the process. These patterns are well described by…
We study some discrete and continuous variants of the following problem of Erdos: given a finite subset P of R^2 or R^3, what is the maximum number of pairs (p_1,p_2) with p_1,p_2 in P and |p_1 -p_2 |=1?
We uncover a duality between relaxation and first passage processes in ergodic reversible Markovian dynamics in both discrete and continuous state-space. The duality exists in the form of a spectral interlacing -- the respective time scales…
We survey most of the known results concerning the Eisenbud-Green-Harris Conjecture. Our presentation includes new proofs of several theorems, as well as a unified treatment of many results which are otherwise scattered in the literature.…
Time evolution of entanglement of N quantum dots is analyzed within the spin-1/2 van der Waals (or Lipkin-Meshkov-Glick) XY model. It is shown that, for a single dot initially excited and disentangled from the remaining unexcited dots, the…
We establish new couplings among several random graph and multigraph models related to the random regular graph $G(n,d)$, including the configuration model and unions of random perfect matchings. As a main result, we verify the…
We consider the statistical motion of a convex rigid body in a gas of N smaller (spherical) atoms close to thermodynamic equilibrium. Because the rigid body is much bigger and heavier, it undergoes a lot of collisions leading to small…
The $\lambda$-exponential family generalizes the standard exponential family via a generalized convex duality motivated by optimal transport. It is the constant-curvature analogue of the exponential family from the information-geometric…
In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+36t$$ for $t=1260r+169…
We introduce new probabilistic arguments to derive optimal-order central moment bounds in planar directed last-passage percolation. Our technique is based on couplings with the increment-stationary variants of the model, and is presented in…