Paul L Krapivsky
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Paul L Krapivsky has a total of 82 co-authors. Here are the top co-authors by number of shared publications:
- Jean Marc Luck
Institut de Physique Théorique Université Paris-Saclay CNRS CEA 91191 Gif-sur-Yvette France
16 shared publications - Eli Ben-Naim
Theoretical Division and Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, USA
15 shared publications - Kirone Mallick
Institut de Physique Théorique Université Paris-Saclay CEA and CNRS 91191 Gif-sur-Yvette France
11 shared publications - Sidney Redner
Santa Fe Institute
7 shared publications - Baruch Meerson
Hebrew University of Jerusalem
5 shared publications - Chikashi Arita
Universität des Saarlandes
3 shared publications
Latest Publications
- 25 September 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (3) , 034314
Anomalous scaling in redirection networks
In networks that grow by isotropic redirection (IR), a new node selects an initial target node uniformly at random and attaches to a randomly chosen neighbor of the target. The emerging networks exhibit leaf proliferation, in which the number of nonleaves scales sublinearly as ${N}^{\ensuremath{\mu}}$ and the degree distribution has an algebraic tail with exponent $1+\ensuremath{\mu}$. To understand these mysterious properties, we introduce a class of models with redirection to leaves whenever possible. The resulting networks exhibit qualitatively similar phenomenology to IR networks, but avoid the inherent nonlocality of the IR growth rule. These networks admit an analytical description of the leaf degree distribution, from which we extract the exponent $\ensuremath{\mu}$.- 25 September 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (3) , 034314
Anomalous scaling in redirection networks
In networks that grow by isotropic redirection (IR), a new node selects an initial target node uniformly at random and attaches to a randomly chosen neighbor of the target. The emerging networks exhibit leaf proliferation, in which the number of nonleaves scales sublinearly as ${N}^{\ensuremath{\mu}}$ and the degree distribution has an algebraic tail with exponent $1+\ensuremath{\mu}$. To understand these mysterious properties, we introduce a class of models with redirection to leaves whenever possible. The resulting networks exhibit qualitatively similar phenomenology to IR networks, but avoid the inherent nonlocality of the IR growth rule. These networks admit an analytical description of the leaf degree distribution, from which we extract the exponent $\ensuremath{\mu}$.- Open Access
- 7 July 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 137 (2) , 027101
Mixed Phases in Feedback Ising Models
We study mean-field Ising models in which the coupling depends on the magnetization via a feedback function. We identify mixed phases (MPs) and show that they can be stable at zero temperature for sufficiently strong feedback. Moreover, stable MPs are always superstable, meaning that perturbations decay linearly in time. Feedback Ising models (FIMs) provide a useful framework for phase transformations between aligned phases via stable and unstable intermediate phases in multistable systems. We also analyze the dynamical behavior of FIMs driven by a varying magnetic field and discuss basic properties of finite-dimensional FIMs.
- 7 July 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 137 (2) , 027101
Open AccessMixed Phases in Feedback Ising Models
We study mean-field Ising models in which the coupling depends on the magnetization via a feedback function. We identify mixed phases (MPs) and show that they can be stable at zero temperature for sufficiently strong feedback. Moreover, stable MPs are always superstable, meaning that perturbations decay linearly in time. Feedback Ising models (FIMs) provide a useful framework for phase transformations between aligned phases via stable and unstable intermediate phases in multistable systems. We also analyze the dynamical behavior of FIMs driven by a varying magnetic field and discuss basic properties of finite-dimensional FIMs.
- 21 April 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (16) , 165001
Leaves of preferential attachment trees
We provide a local probabilistic description of the limiting statistics of large preferential attachment (PA) trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are leaves). The full description is the joint degree-leafdegree distribution n k , ℓ , which we derive from its associated multivariate generating function. From n k , ℓ we obtain the leafdegree distribution, m ℓ , as well as the fraction of vertices that are protected (nonleaves with leafdegree zero) as a function of degree, n k , 0 , among numerous other results. We also examine fluctuations and concentration of joint degree-leafdegree empirical counts N k , ℓ . Although our main findings pertain to the PA tree, the approach we present is highly generalizable and can characterize numerous existing models, in addition to facilitating the development of tractable new models. We further demonstrate the approach by analyzing n k , ℓ in two other models: the random recursive tree, and a redirection-based model.
- 21 April 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (16) , 165001
Leaves of preferential attachment trees
We provide a local probabilistic description of the limiting statistics of large preferential attachment (PA) trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are leaves). The full description is the joint degree-leafdegree distribution n k , ℓ , which we derive from its associated multivariate generating function. From n k , ℓ we obtain the leafdegree distribution, m ℓ , as well as the fraction of vertices that are protected (nonleaves with leafdegree zero) as a function of degree, n k , 0 , among numerous other results. We also examine fluctuations and concentration of joint degree-leafdegree empirical counts N k , ℓ . Although our main findings pertain to the PA tree, the approach we present is highly generalizable and can characterize numerous existing models, in addition to facilitating the development of tractable new models. We further demonstrate the approach by analyzing n k , ℓ in two other models: the random recursive tree, and a redirection-based model.
- Open Access
- 4 February 2026
- Published by Elsevier in SSRN Electronic Journal
Regularized products of Gauss and Eisenstein integers and primes
We provide heuristic computations \`a la Euler of the regularized infinite products of Gauss and Eisenstein integers and primes. Our approach, yielding explicit expressions, is inspired by the work by Muñoz Garc\'ia and P\'erez-Marco, who evaluated the product of all natural primes to $4\pi^2$.- 4 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessRegularized products of Gauss and Eisenstein integers and primes
We provide heuristic computations \`a la Euler of the regularized infinite products of Gauss and Eisenstein integers and primes. Our approach, yielding explicit expressions, is inspired by the work by Muñoz Garc\'ia and P\'erez-Marco, who evaluated the product of all natural primes to $4\pi^2$. - Open Access
Leaves of preferential attachment trees
We provide a local probabilistic description of the limiting statistics of large preferential attachment trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are leaves). The full description is the joint degree-leafdegree distribution $n_{k,\ell}$, which we derive from its associated multivariate generating function. From $n_{k,\ell}$ we obtain the leafdegree distribution, $m_{\ell}$, as well as the fraction of vertices that are protected (nonleaves with leafdegree zero) as a function of degree, $n_{k,0}$, among numerous other results. We also examine fluctuations and concentration of joint degree-leafdegree empirical counts $N_{k,\ell}$. Although our main findings pertain to the preferential attachment tree, the approach we present is highly generalizable and can characterize numerous existing models, in addition to facilitating the development of tractable new models. We further demonstrate the approach by analyzing $n_{k,\ell}$ in two other models: the random recursive tree, and a redirection-based model.Open AccessLeaves of preferential attachment trees
We provide a local probabilistic description of the limiting statistics of large preferential attachment trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are leaves). The full description is the joint degree-leafdegree distribution $n_{k,\ell}$, which we derive from its associated multivariate generating function. From $n_{k,\ell}$ we obtain the leafdegree distribution, $m_{\ell}$, as well as the fraction of vertices that are protected (nonleaves with leafdegree zero) as a function of degree, $n_{k,0}$, among numerous other results. We also examine fluctuations and concentration of joint degree-leafdegree empirical counts $N_{k,\ell}$. Although our main findings pertain to the preferential attachment tree, the approach we present is highly generalizable and can characterize numerous existing models, in addition to facilitating the development of tractable new models. We further demonstrate the approach by analyzing $n_{k,\ell}$ in two other models: the random recursive tree, and a redirection-based model. - Top Cited PapersOpen Access
- 22 January 2026
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 7 (2)
Hypergraphs and simplicial complexes in focus: A roadmap for future research in higher-order interactions
Higher-order interactions are increasingly being recognised as fundamental to our understanding of complex systems, networks, and the development of the next generation of AI algorithms. However, modelling higher-order interactions requires us to go beyond graphs and networks, which can only encode pairwise interactions, and so demands a new theory. Hypergraphs and simplicial complexes (also called higher-order networks), which arise as natural mathematical representations of higher-order complex systems, are therefore attracting increasing attention. The mathematics of higher-order networks is already providing important insights, yet many fundamental mathematical questions remain unsolved; for instance, in spectral graph theory, discrete topology, and higher-order network dynamics. This roadmap summarizes the scientific discussions that took place on these topics between pure mathematicians, theoretical physicists, computer and network scientists at the Newton Institute Satellite meeting on `Hypergraphs: Theory and Applications'. We survey the current state-of-the-art in higher-order network research, and propose some trajectories for future research, including in areas such as extremal and spectral hypergraph theory, discrete topology, higher-order dynamics, higher-order machine learning, and applications in the brain and social sciences.
- 22 January 2026
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 7 (2)
Top Cited PapersOpen AccessHypergraphs and simplicial complexes in focus: A roadmap for future research in higher-order interactions
Higher-order interactions are increasingly being recognised as fundamental to our understanding of complex systems, networks, and the development of the next generation of AI algorithms. However, modelling higher-order interactions requires us to go beyond graphs and networks, which can only encode pairwise interactions, and so demands a new theory. Hypergraphs and simplicial complexes (also called higher-order networks), which arise as natural mathematical representations of higher-order complex systems, are therefore attracting increasing attention. The mathematics of higher-order networks is already providing important insights, yet many fundamental mathematical questions remain unsolved; for instance, in spectral graph theory, discrete topology, and higher-order network dynamics. This roadmap summarizes the scientific discussions that took place on these topics between pure mathematicians, theoretical physicists, computer and network scientists at the Newton Institute Satellite meeting on `Hypergraphs: Theory and Applications'. We survey the current state-of-the-art in higher-order network research, and propose some trajectories for future research, including in areas such as extremal and spectral hypergraph theory, discrete topology, higher-order dynamics, higher-order machine learning, and applications in the brain and social sciences.
- 7 January 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (1) , 015001
Finite-time consensus in a compromise process
A compromise process describes the evolution of opinions through binary interactions. Opinions are real numbers, and at each step, two randomly selected agents reach a compromise by averaging their pre-interaction opinions. We prove that if the number N of agents is a power of two, then consensus emerges after a finite number of compromise events with probability one; otherwise, consensus cannot be reached in a finite number of steps, provided the initial opinions are in a general position. The number of steps required to reach consensus is random for N = 2 k with k ⩾ 2 . We prove that the smallest number of steps is k ⋅ 2 k − 1 when the initial opinions are in a general position. For N = 4, we determine the distribution of the number of steps. In particular, we show that it has a purely exponential tail and compute all cumulants.
- 7 January 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (1) , 015001
Finite-time consensus in a compromise process
A compromise process describes the evolution of opinions through binary interactions. Opinions are real numbers, and at each step, two randomly selected agents reach a compromise by averaging their pre-interaction opinions. We prove that if the number N of agents is a power of two, then consensus emerges after a finite number of compromise events with probability one; otherwise, consensus cannot be reached in a finite number of steps, provided the initial opinions are in a general position. The number of steps required to reach consensus is random for N = 2 k with k ⩾ 2 . We prove that the smallest number of steps is k ⋅ 2 k − 1 when the initial opinions are in a general position. For N = 4, we determine the distribution of the number of steps. In particular, we show that it has a purely exponential tail and compute all cumulants.
- 1 December 2025
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2025 (12) , 123404
Deterministic simplicial complexes
We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and two 0-dimensional faces (the vertices). The process continues recursively: On the n -th step, every existing d − dimensional simplex ( d ⩽ n − 1 ) joins a new vertex forming a ( d + 1 ) − dimensional simplex; all 2 d + 1 − 2 new faces are also added so that the resulting object remains a simplicial complex. The emerging simplicial complex has intriguing local and global characteristics. The number of simplices grows faster than n ! , and the upper-degree distributions follow a power law. Here, the upper degree (or d -degree) of a d -simplex refers to the number of ( d + 1 ) -simplices that share it as a face. Interestingly, the d -degree distributions evolve quite differently for different values of d . We compute the Hodge Laplacian spectra of simplicial complexes and show that the spectral and Hausdorff dimensions are infinite. We also explore a constrained version where the dimension of the added simplices is fixed to a finite value m . In the constrained model, the number of simplices grows exponentially. In particular, for m = 1, the spectral dimension is 2. For m = 2, the spectral dimension is finite, and the degree distribution follows a power law, while the 1-degree distribution decays exponentially.
- 1 December 2025
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2025 (12) , 123404
Deterministic simplicial complexes
We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and two 0-dimensional faces (the vertices). The process continues recursively: On the n -th step, every existing d − dimensional simplex ( d ⩽ n − 1 ) joins a new vertex forming a ( d + 1 ) − dimensional simplex; all 2 d + 1 − 2 new faces are also added so that the resulting object remains a simplicial complex. The emerging simplicial complex has intriguing local and global characteristics. The number of simplices grows faster than n ! , and the upper-degree distributions follow a power law. Here, the upper degree (or d -degree) of a d -simplex refers to the number of ( d + 1 ) -simplices that share it as a face. Interestingly, the d -degree distributions evolve quite differently for different values of d . We compute the Hodge Laplacian spectra of simplicial complexes and show that the spectral and Hausdorff dimensions are infinite. We also explore a constrained version where the dimension of the added simplices is fixed to a finite value m . In the constrained model, the number of simplices grows exponentially. In particular, for m = 1, the spectral dimension is 2. For m = 2, the spectral dimension is finite, and the degree distribution follows a power law, while the 1-degree distribution decays exponentially.
- 1 December 2025
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2025 (12) , 123203
Dynamic space filling
Dynamic space filling (DSF) is a stochastic process defined on any connected graph. Each vertex can host an arbitrary number of particles forming a pile, with every arriving particle landing on the top of the pile. Particles in a pile, except for the particle at the bottom, can hop to neighboring vertices. Eligible particles hop independently and stochastically, with the overall hopping rate set to unity. When the number of vertices in a graph is equal to the total number of particles, the evolution stops when a single particle occupies every vertex. We determine the halting time distribution on complete graphs. Using the mapping of the DSF into a two-species annihilation process, we argue that on d -dimensional tori with N ≫ 1 vertices, the average halting time scales with the number of vertices as N 4 / d when d ⩽ 4 and as N when d > 4.
- 1 December 2025
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2025 (12) , 123203
Dynamic space filling
Dynamic space filling (DSF) is a stochastic process defined on any connected graph. Each vertex can host an arbitrary number of particles forming a pile, with every arriving particle landing on the top of the pile. Particles in a pile, except for the particle at the bottom, can hop to neighboring vertices. Eligible particles hop independently and stochastically, with the overall hopping rate set to unity. When the number of vertices in a graph is equal to the total number of particles, the evolution stops when a single particle occupies every vertex. We determine the halting time distribution on complete graphs. Using the mapping of the DSF into a two-species annihilation process, we argue that on d -dimensional tori with N ≫ 1 vertices, the average halting time scales with the number of vertices as N 4 / d when d ⩽ 4 and as N when d > 4.
- Open Access
- 21 August 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (8) , 087401
Self-Reinforcing Cascades: A Spreading Model for Beliefs or Products of Varying Intensity or Quality
Models of how things spread often assume that transmission mechanisms are fixed over time. However, social contagions—the spread of ideas, beliefs, innovations—can lose or gain in momentum as they spread: ideas can get reinforced, beliefs strengthened, products refined. We study the impacts of such self-reinforcement mechanisms in cascade dynamics. We use different mathematical modeling techniques to capture the recursive, yet changing nature of the process. We find a critical regime with a range of power-law cascade size distributions with nonuniversal scaling exponents. This regime clashes with classic models, where criticality requires fine-tuning at a precise critical point. Self-reinforced cascades produce critical-like behavior over a wide range of parameters, which may help explain the ubiquity of power-law distributions in empirical social data.
- 21 August 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (8) , 087401
Open AccessSelf-Reinforcing Cascades: A Spreading Model for Beliefs or Products of Varying Intensity or Quality
Models of how things spread often assume that transmission mechanisms are fixed over time. However, social contagions—the spread of ideas, beliefs, innovations—can lose or gain in momentum as they spread: ideas can get reinforced, beliefs strengthened, products refined. We study the impacts of such self-reinforcement mechanisms in cascade dynamics. We use different mathematical modeling techniques to capture the recursive, yet changing nature of the process. We find a critical regime with a range of power-law cascade size distributions with nonuniversal scaling exponents. This regime clashes with classic models, where criticality requires fine-tuning at a precise critical point. Self-reinforced cascades produce critical-like behavior over a wide range of parameters, which may help explain the ubiquity of power-law distributions in empirical social data.