math.PR Mathematics

Probability papers on arXiv

Track stochastic processes, random structures, and limit results in math.PR. Choose a process or probabilistic model first, then add the type of result relevant to your work.

1,612 papers indexed

Follow the whole category with the official math.PR RSS feed, or use a personal filter to select keywords and authors. See the arXiv RSS feed guide for setup and the category guide for primary and cross-listed subjects.

Filter ideas for Probability

How filters work

A keyword such as convergence occurs in many settings. Combining it with a process or model reduces noise, while OR groups can connect equivalent names used by different communities.

  • Stochastic differential equations

    Add a coefficient condition, numerical method, or application to narrow equation studies.

    Category math.PR + abstract contains “stochastic differential”
    Try filter
  • Random graphs

    Follow a model family or property such as connectivity, percolation, or a limit law.

    Category math.PR + abstract contains “random graph”
    Try filter

Examples are starting points. Preview them before saving; keyword matches do not assess a paper’s quality. Recent papers below use the primary category; saved category filters also match cross-listed categories.

Recent Probability papers

5 recent papers
  • Deven Mithal

    Abstract

    We establish sublinear bounds for the internal diameter of External Diffusion Limited Aggregation (DLA) clusters on random planar maps. We develop two conditional DLA growth results for deterministic planar maps: the weaker condition yielding sublinear growth for DLA, and the stronger yielding polynomially sublinear growth for DLA. We then verify the strong assumption a.s. for the γγ-mated CRT maps, and the weak condition a.s. for ergodic scale-free random environments, establishing the corresponding a.s bounds.

  • Omer Angel, Christina Goldschmidt, Peleg Michaeli

    Abstract

    We study the cover times of uniform random recursive trees and linear preferential attachment trees, including the negative-parameter models corresponding to random dd-ary increasing trees. We prove explicit limits in probability and expectation when the cover times are rescaled by n(log⁡n)2n (\log n)^2. In particular, for the uniform random recursive tree the cover time is close to en(log⁡n)2e n (\log n)^2 with high probability.

  • Kevin Ren, Tara Trauthwein, Gesine Reinert

    Abstract

    Networks provide a popular representation of complex data. Often, different types of relational measurements are taken on the same subjects. Such data can be represented as a multislice network, a collection of networks on the same set of nodes, with connections between nodes of different layers. For the analysis of multislice networks, we take inspiration from the analysis of simple networks, for which small subgraphs (motifs) have proven to be useful; motifs are even seen as building blocks of complex networks. A particular instance of a motif is a triangle, and while triangle counts are well understood for simple network models such as Erdős-Rényi random graphs, with i.i.d. distributed edges, even for simple multislice network models little is known about triangle counts. Here we address this issue by extending the analysis of triadic structures to multislice Erdős-Rényi networks. Again taking inspiration from the analysis of sparse Erdős-Rényi random graphs, we show that the distribution of triangles across multiple layers in a multislice Erdős-Rényi network can be well approximated by an appropriate Poisson distribution. This theoretical result opens the door to statistical goodness of fit tests for multislice networks.

  • Ernesto M. Greco, Daniela Morale

    Abstract

    We study the convergence of the empirical measure of moderately interacting particle systems subject to singular forces derived by Lennard-Jones potential. Although the classical Lennard-Jones force is widely used in molecular dynamics, analytical results are not available. We consider a Lennard-Jones potential with free parameters in the McKean-Vlasov framework and proceed with a regularization at the mesoscale letting the particles interact moderately. We prove the well-posedness of the McKean-Vlasov SDE involving such singular kernels and the convergence of the empirical measure towards the solution of the McKean-Vlasov Fokker-Planck PDE, by means of a semigroup approach. We derive both the range of parameters characterizing the aggregation and repulsive force and the mesoscale order for which the convergence is achieved, by obtaining the right integrability regularity of the drift.

  • Cosme Louart

    Abstract

    We give simple criteria for sums, nonnegative products and compositions of scalar maximally monotone operators to preserve maximality, and introduce a pointwise resolvent order with associated infima and suprema. We first apply this framework to the Hardy transform to derive sharp bounds for nonlinear aggregation in terms of marginal upper-tail means, without independence assumptions. We then employ a geometric version of the Hardy transform (the geometric mean operator) to establish concentration inequalities for nonlinear observations with multiplicative random Lipschitz controls. No exponential tail decay is required, and the result covers heavy-tailed settings under logarithmic integrability assumptions. Feed-forward neural networks illustrate the latter result.

Frequently asked questions

How do I get alerts for new Probability papers on arXiv?

Create a filter for the math.PR category — add keywords or authors to narrow it further if you like. Matching papers are delivered to a personal RSS feed, and optionally by immediate, daily, or weekly email digest.

Where does this Probability paper data come from?

Paper metadata comes directly from arXiv through its official OAI-PMH feed, checked roughly every 15 minutes for new submissions in math.PR and every other arXiv category.