An official website of the United States government
We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class of analytic functions. As a key step in the proof, we obtain a total variation distance bound for the Poisson approximation of the number of cycles and cyclically non-backtracking walks in random biregular bipartite graphs, which might be of independent interest. We also prove a semicircle law for random [Formula: see text]-biregular bipartite graphs when [Formula: see text]. As an application, we translate the results to adjacency matrices of uniformly distributed random regular hypergraphs.
more »
« less
Marchenko–Pastur law with relaxed independence conditions
We prove the Marchenko–Pastur law for the eigenvalues of [Formula: see text] sample covariance matrices in two new situations where the data does not have independent coordinates. In the first scenario — the block-independent model — the [Formula: see text] coordinates of the data are partitioned into blocks in such a way that the entries in different blocks are independent, but the entries from the same block may be dependent. In the second scenario — the random tensor model — the data is the homogeneous random tensor of order [Formula: see text], i.e. the coordinates of the data are all [Formula: see text] different products of [Formula: see text] variables chosen from a set of [Formula: see text] independent random variables. We show that Marchenko–Pastur law holds for the block-independent model as long as the size of the largest block is [Formula: see text], and for the random tensor model as long as [Formula: see text]. Our main technical tools are new concentration inequalities for quadratic forms in random variables with block-independent coordinates, and for random tensors.
more »
« less
- PAR ID:
- 10273396
- Date Published:
- Journal Name:
- Random Matrices: Theory and Applications
- ISSN:
- 2010-3263
- Page Range / eLocation ID:
- 2150040
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Discrete-particle simulations of bidisperse shear thickening suspensions are reported. The work considers two packing parameters, the large-to-small particle radius ratio ranging from [Formula: see text] (nearly monodisperse) to [Formula: see text], and the large particle fraction of the total solid loading with values [Formula: see text], 0.5, and 0.85. Particle-scale simulations are performed over a broad range of shear stresses using a simulation model for spherical particles accounting for short-range lubrication forces, frictional interaction, and repulsion between particles. The variation of rheological properties and the maximum packing fraction [Formula: see text] with shear stress [Formula: see text] are reported. At a fixed volume fraction [Formula: see text], bidispersity decreases the suspension relative viscosity [Formula: see text], where [Formula: see text] is the suspension viscosity and [Formula: see text] is the suspending fluid viscosity, over the entire range of shear stresses studied. However, under low shear stress conditions, the suspension exhibits an unusual rheological behavior: the minimum viscosity does not occur as expected at [Formula: see text], but instead decreases with further increase of [Formula: see text] to [Formula: see text]. The second normal stress difference [Formula: see text] acts similarly. This behavior is caused by particles ordering into a layered structure, as is also reflected by the zero slope with respect to time of the mean-square displacement in the velocity gradient direction. The relative viscosity [Formula: see text] of bidisperse rate-dependent suspensions can be predicted by a power law linking it to [Formula: see text], [Formula: see text] in both low and high shear stress regimes. The agreement between the power law and experimental data from literature demonstrates that the model captures well the effect of particle size distribution, showing that viscosity roughly collapses onto a single master curve when plotted against the reduced volume fraction [Formula: see text].more » « less
-
Let ρ be a general law-invariant convex risk measure, for instance, the average value at risk, and let X be a financial loss, that is, a real random variable. In practice, either the true distribution μ of X is unknown, or the numerical computation of [Formula: see text] is not possible. In both cases, either relying on historical data or using a Monte Carlo approach, one can resort to an independent and identically distributed sample of μ to approximate [Formula: see text] by the finite sample estimator [Formula: see text] (μNdenotes the empirical measure of μ). In this article, we investigate convergence rates of [Formula: see text] to [Formula: see text]. We provide nonasymptotic convergence rates for both the deviation probability and the expectation of the estimation error. The sharpness of these convergence rates is analyzed. Our framework further allows for hedging, and the convergence rates we obtain depend on neither the dimension of the underlying assets nor the number of options available for trading. Funding: Daniel Bartl is grateful for financial support through the Vienna Science and Technology Fund [Grant MA16-021] and the Austrian Science Fund [Grants ESP-31 and P34743]. Ludovic Tangpi is supported by the National Science Foundation [Grant DMS-2005832] and CAREER award [Grant DMS-2143861].more » « less
-
Abstract Signal detection is one of the main challenges in data science. As often happens in data analysis, the signal in the data may be corrupted by noise. There is a wide range of techniques that aim to extract the relevant degrees of freedom from data. However, some problems remain difficult. This is notably the case for signal detection in almost continuous spectra when the signal-to-noise ratio is small enough. This paper follows a recent bibliographic line, which tackles this issue with field-theoretical methods. Previous analysis focused on equilibrium Boltzmann distributions for an effective field representing the degrees of freedom of data. It was possible to establish a relation between signal detection and -symmetry breaking. In this paper, we consider a stochastic field framework inspired by the so-called ‘model A’, and show that the ability to reach, or not reach, an equilibrium state is correlated with the shape of the dataset. In particular, by studying the renormalization group of the model, we show that the weak ergodicity prescription is always broken for signals that are small enough, when the data distribution is close to the Marchenko–Pastur law. This, in particular, enables the definition of a detection threshold in the regime where the signal-to-noise ratio is small enough.more » « less
-
We study the minimum spanning arborescence problem on the complete digraph [Formula: see text], where an edge e has a weight W e and a cost C e , each of which is an independent uniform random variable U s , where [Formula: see text] and U is uniform [Formula: see text]. There is also a constraint that the spanning arborescence T must satisfy [Formula: see text]. We establish, for a range of values for [Formula: see text], the asymptotic value of the optimum weight via the consideration of a dual problem.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1142/s2010326321500404
