WorksMathematics
Cumulant Generating Function of the Hill-Lane-Sudderth urn model
Abstract
We consider the Hill, Lane and Sudderth urn, in which a black or white ball is added at each step with probabilities depending on the current proportion of black balls. We solve the equation for the limiting normalized cumulant generating function when the urn function is invertible on the outer branches beyond the fixed points and the corresponding inverses are Lipschitz. The solution has a parametric representation through three quadratures of the urn function and a limit of compositions of radicals, with no derivatives or inverses of the urn function in the final formula. We prove an error bound that does not accumulate along the partition and remains valid when starting from the initial singularity. Four examples with exact solutions illustrate the two orientations of the construction, the non-affine case and the presence of zeros.
Introduction
The Hill, Lane and Sudderth (HLS) urn is a two-color reinforcement model: one ball is added at each step, and the probabilities of the two colors depend on the current composition [1]. The current proportion thus summarizes the past additions, while the urn function determines how this history influences the next addition. Varying this response gives a common mathematical description of growth processes arising in different settings [2, 3].
Among these processes are leaf counts in random trees [4] and elephant random walks with either one or a fixed number of draws with replacement from the past [5, 6]. Nonlinear responses arise naturally when past choices affect subsequent preferences. In technological diffusion, current market shares influence later adoptions through positive or negative feedback [7]; increasing returns and social influence can produce competing long-run outcomes [8]. When return weights are proportional to a common power of wealth, the two-agent model with wages [9] also has an autonomous urn description. Each allocation of the capital return is an urn addition, with a probability determined by the current wealth shares. Deterministic wages make accumulated wealth an affine transformation of the urn count, so its fluctuations can be studied through the same process [3].
In irreversible magnetic growth, spins are added with probabilities determined by the accumulated magnetization [10]. A nonlinear response can sustain competing magnetizations, making the distribution of growth histories relevant even when the fixed points are known. Related competition occurs between two growing neuronal extensions, or neurites [11]. Pólya urn models have also been used to describe distributions of enantiomeric excess in asymmetric autocatalysis [12]. The review [3] develops cooperative nonlinear production rules as further illustrative urn models with several possible final compositions.
Nonlinear urns also describe the accumulation of information. In broadcasting on growing recursive graphs, a new vertex samples a fixed odd number of earlier vertices, at least three, uniformly with replacement. Each sampled color is independently flipped with a probability strictly between zero and one half, and the new color is chosen by majority vote [13]. The probability of choosing a given color is therefore a polynomial of its current fraction, and the urn records the number of vertices of each color. In reinforced recommendation, the reduction to one user and two items gives an urn with power-law reinforcement [14, 3]. Related feedback rules govern which new observations are added to a stored memory, as discussed in the review. A different response arises in urns with triggering: discovering an element expands the set of available elements [15]. This mechanism leads to a rational limiting urn response for the count of distinct discoveries, such as new words in a text. The comparison of history probabilities in [3] justifies transferring the limiting free energy to this autonomous HLS description.
For random walks and polymers, the accumulated observable can also be geometric. The range counts distinct visited sites; at a fixed length it determines the number of steps returning to old sites. Conditional continuation probabilities reproduce this return-count distribution, linking urns to the Stanley polymer model [16]. The same range statistics determine survival in the Rosenstock problem with random traps, while the zero-return sector selects self-avoiding walks [3]. Attractive interactions require the additional contact statistic, as in the study of interacting self-avoiding polymers [17]. These correspondences concern the distributions of counts; applying the autonomous HLS theory requires control of the limiting urn function and of the relevant boundary regimes [3].
For continuous urn functions, the basic asymptotic picture is given by almost sure convergence of the color proportion to a fixed point [1, 18]. Which limiting behaviors are possible depends on the local shape of the response, as illustrated by convergence to points of tangency [19] and by critical behavior in nonlinear urns [20]. Together with the characterization of the exchangeable cases [21], these results describe typical outcomes and special structures of reinforced growth. The fixed points alone do not determine the exponential cost of other final compositions. Our concern is how weighting these compositions changes the balance between growth histories. This leads to the growth of exponential moments and hence to the free energy studied below.
We consider two colors, black and white, and a continuous urn function
When the urn contains balls, we denote the proportion of black balls by ; the numbers of balls of the two colors are thus and . The new ball is black with probability and white with probability . The urn function is evaluated before the addition and remains the same throughout the evolution. The rule includes nonlinear reinforcement and may admit several fixed points, that is, compositions at which the probability of adding a black ball equals the current proportion.
The urn starts with balls and grows until it contains . We assume a uniform distribution over the initial compositions:
We assume that is sufficiently large to avoid pathological evolutions caused by the initial condition, that is, to keep the outer branches considered in Theorem 1 accessible with positive probability [22 Corollary 2]. In the limit , remains fixed.
We denote the increment in the number of black balls by : it equals one if the new ball is black and zero if it is white. For , the process is defined by
When throughout , the limiting function (6) does not depend on the initial composition or the finite initial number of balls [22 Lemma 16].
For this process, the normalized cumulant generating function (CGF) of the final black mass is
The expectation includes both the initial composition and the subsequent additions. The exponential factor weights histories according to their final composition: positive values of favor more black mass, while negative values favor less. This weighted sum over histories is a partition function, whose normalized logarithm defines the free energy in the convention used here. We study the limiting CGF
which describes the exponential growth of these moments as the urn grows. In the Stanley model, exponentially weighting the return count determines the polymer partition function, giving this correspondence a direct thermodynamic meaning [16]. Magnetization and wealth are affine functions of the appropriate urn count, so their free energies follow by rescaling the conjugate parameter and adding the deterministic contribution. Varying probes fluctuations through the response of the free energy. This connects the construction to large-deviation studies of growing systems [23].
Large deviation theory supplies the probabilistic basis for this free energy. Bryc, Minda and Sethuraman [4] establish a path large deviation principle and compute the limiting CGF for a family of affine processes related to random trees. For urn functions in the class , recalled in § 2.1, the large deviation principle of Ref. [22] ensures the existence of ; the equation (13) and the slope conditions selecting the solution are established in Ref. [22], Eq. (2.31) and Theorem 9. In Ref. [8], this theory is applied to increasing returns, and the equation is studied for nonlinear responses. The broader theory also includes strong laws for nonbinary increments [24], under conditions on the conditional mean and moments, and large deviations for integer increments from zero to , with [25]. For the binary model considered here, the differential equation and slope conditions provide the characterization from which we construct the limiting CGF.
Although this equation is of first order, it couples the derivative through the nonlinear urn function to an exponential of the CGF itself. Inverting the urn function therefore does not by itself give an integral representation. At , the equation is singular and the condition must be supplemented by the slopes prescribed by the extreme fixed points. The slopes can differ on the two sides of the origin, while the accessible endpoints determine the slopes at infinity. The task is thus to construct a globally convex solution satisfying these conditions on both half-lines, for either orientation of the outer branches.
Theorem 1 gives an exact constructive representation of this CGF, and hence of the asymptotic free energy, under the assumptions of Ref. [22], Theorem 9. These require invertibility with Lipschitz inverses on the outer branches beyond the fixed points, without imposing monotonicity between the extreme fixed points. Under these assumptions, three ordinary quadratures of the urn function and a convergent limit of compositions of radicals yield a solution parametrized by . Evaluation at a prescribed therefore requires only one scalar inversion, while the formula itself contains no derivatives or inverses of the urn function. The representation covers both increasing and decreasing branches, including urn functions with zeros and interior accessible endpoints. It therefore supplies a common route from an admissible nonlinear response to the free energy, without solving a new differential equation for each model.
The radical construction is obtained from a transformation to the real form of the chordal Loewner equation. Integration with a piecewise constant driving function and compositions of radicals are classical [26, 27]; here we derive the quadratures of the HLS transformation and identify the branch corresponding to the CGF. To control the resulting construction, we prove, with exact quadratures, an error bound for the reduced variable that is uniform at the partition nodes from the initial point up to each interior point of the branch. The estimate remains valid at the initial singularity and does not sum the errors over successive steps.
An exact CGF is also useful for assessing approximations to the history law. In connection with lattice field theory descriptions of neural activity [28], the HLS comparison developed in [3] shows that truncating the action to pair interactions can preserve the mean activity while changing the free energy. The present construction provides a reference for testing such reductions for admissible nonlinear responses. The variational balance between the action and entropy of histories also connects this description to formulations of active inference [29, 3].
Because the representation is expressed directly in terms of a fixed urn function, it can also be applied conditionally when that function is random. In the quenched setting, the response is sampled once, from a law independent of , and kept fixed throughout growth, as in a magnetic model with a frozen random field. Different field values give different nonlinear responses, each with its own free energy. Urns in such fixed random environments are investigated in [30], while the HLS formulation and affine examples are discussed in [3]. If the theorem’s hypotheses, including accessibility, hold for almost every realization, the construction gives the corresponding conditional CGF. Each is evaluated at a common value of before averaging over disorder, since the parametrization and its inversion depend on the realization. The construction thus provides the conditional free energies needed to extend the affine calculations to admissible nonlinear responses. The distinction between conditional growth and averages over systems also underlies the review’s discussion of replica symmetry breaking. Within such a history measure, exponential weighting changes the relative weights of the trajectory components through their conditional partition functions. This connects free-energy calculations to overlaps between independently sampled histories [3].
In § 4, we illustrate the construction with two affine urns, a non-affine urn and an urn with zeros. Their exact solutions allow the values obtained from the representation to be checked directly.
Main result
Assumptions and fixed points
We assume , the class of Ref. [22]: there is a modulus bound such that
for sufficiently small positive distances, uniformly in , and
In particular, all Hölder continuous urn functions belong to . Define
The case gives , whereas gives . In all other cases, the accessible endpoints are defined by
The differential equation, the limiting conditions and uniqueness of the CGF are established in Ref. [22], Eq. (2.31) and Theorem 9.
Representation of the CGF
Theorem 1 (Solution of the CGF equation). Let , with the model and initialization of § 1. Excluding the two constant cases already mentioned, suppose that is injective on each nonempty interval among
and that the inverse of each such restriction, defined on the corresponding image, is Lipschitz. No monotonicity is required between and .
The limit (1.6) exists and is finite. The CGF is continuous and convex on and is on the two open half-lines. It solves the equation
with the normalization
and the slope conditions
Within the class of functions with this regularity and convexity, the problem (13)–(16) has a unique solution.
On the half-line , if , then . If , fix and set
In the first case, . On the closed interval with endpoints and , the following integrals are oriented from :
The three functions are continuous, , and is strictly increasing along from to .
Let be a partition ordered along this path, with and . Define
and, for ,
The sign remains the one in (2.11) at every step. The following limit exists and is independent of the partitions:
More precisely, setting, for ,
we have
The bound concerns the exact quadratures (2.12)–(2.14); under these assumptions, need not be Lipschitz in the parameter . Finally, define
The solution is given parametrically by
The map is an increasing homeomorphism from onto , and
For a prescribed value of , it therefore suffices to invert this scalar map. On the increasing branch,
on the decreasing branch,
The negative half-line is obtained by applying the same construction to the reflected urn function:
The subscript specifies the urn function. In particular, gives for .
The quadratures are finite up to every interior point of the branch; at the endpoints, one takes the limits of the CGF without requiring to remain finite there.
Proof
Branch selection and parametrization
Uniqueness for the boundary value problem {(xref)}(2.7)–{(xref)}(2.10) is given by Theorem 9 of Ref. [22]. Let be the rate function, with compact sublevel sets, for the paths in Theorem 1 of Ref. [22], on the set of absolutely continuous paths with and almost everywhere. This set is compact in the uniform topology. We apply Corollary 2 of Ref. [22] to each initial composition with a nondegenerate accessible interval. If this interval reduces to a single value, the limiting conditional CGF is times that value, which is a fixed point of by the recursion for the mean. The limiting CGF of the finite mixture (1.2) is the maximum of the conditional CGFs, since its weights are positive and independent of . For , in the variational problem with cost , it suffices to consider paths between the lines of slope and : raising the portions below the first line onto it makes their cost zero and does not decrease the final value; no path of finite cost exceeds the second line, since above it. The accessibility assumed in § 1 allows us to use the same cost on these paths. For , the argument is symmetric between the lines of slope and . Continuity of the endpoint evaluation map, the contraction principle and Varadhan’s lemma therefore give
In particular, the limit exists and is finite and convex, with and slopes in . The entropy integrand of is nonnegative and vanishes exactly when almost everywhere. Thus the path has zero cost. If , {(xref)}(3.1) and give for . Henceforth assume .
No zero-cost path can end above . Indeed, writing gives
If , the backward evolution makes increase at a rate bounded away from zero on , contradicting . Compactness of the sublevel sets of and (3.1) give
For now, slope limits are taken through points of differentiability; the regularity proved below makes them ordinary limits. On the open upper branch, continuity and injectivity give . For the linear paths , the cost is finite:
Moreover,
If , the bound follows by induction starting from because above ; if , it is immediate. Applying (3.1) to these linear paths and using the upper bound yields as . Convexity then implies
Fix a point of differentiability and define the probability measure by
For every fixed neighborhood of , differentiability of allows us to choose small enough for the Chernoff bounds at and to make the probability of its complement under this measure exponentially small as . Hence converges in probability to under . Continuity and boundedness of imply
The transition rule gives the exact recursion
The right-hand side converges by (3.8). Summing the recursion from and taking Cesàro averages identifies the limit as : the initial term, bounded in absolute value by , vanishes after normalization. This yields (2.7) at every point of differentiability.
The slope bounds place in almost everywhere. Let be the inverse on the upper branch, extended continuously to ; the extension remains Lipschitz. ratio in the following equation belongs to the closed image of the branch: this holds at points of differentiability by (2.7), and elsewhere by continuity. Therefore
The right-hand side is continuous. Since is locally absolutely continuous, integration shows that it is on and that (2.7) holds everywhere. The same argument applies to the reflected urn on the negative half-line. If , the zero path has zero cost and (3.1) gives for . The upper branch is nonempty: otherwise, continuity and would imply . On this branch,
The second inequality follows from the absence of fixed points beyond ; the first follows from strict monotonicity and the definition of . If is increasing, an endpoint would force , which is impossible. Thus and
If is decreasing, instead,
In both cases and throughout . The quadratures in the statement are therefore finite and continuous on this closed interval, with and
Set . The regularity of the CGF makes continuous, while convexity makes it nondecreasing. We show that
If it reached either endpoint at a finite parameter value, it would be constant on an open interval extending towards zero or infinity. When the constant value is , the equation would imply
on that interval. For , the right-hand side is strictly convex, whereas is affine. For or , its derivative would be zero or one, respectively, still different from . Reaching would require , which is ruled out by . It remains to rule out reaching . In this case the branch is increasing. Its inverse extends to zero with , and a Lipschitz constant for it gives . If , convexity and imply . For every , the equation and give, on ,
Gronwall’s inequality forces on every such interval, contradicting (3.6). This proves (3.15).
Define
We have , , and is by the second expression in (3.18). Differentiating this expression gives
Moreover, is nondecreasing if is increasing and nonincreasing if is decreasing. The derivative cannot vanish. Indeed, if , the Lipschitz property of implies . Differentiating (3.19) at that point gives
Since (3.20) would imply , the sign of would change from positive to negative across , contradicting the monotonicity of . Since does not vanish, is also strictly increasing in . This proves the required homeomorphism property for the parameter and, by (3.20), the orderings (2.24) and (2.25).
Express the probability (3.19) as a function of the state by . We will show below that this function satisfies the reconstruction formula (2.20). Set
This function is continuous and positive in the interior. The logarithmic derivative of (3.19) gives
The definition of also gives
Dividing (56) by the nonzero derivative in (53), we obtain
Quadratures and reduction
To differentiate the quadratures without differentiating , compose the functions in the statement with . They are absolutely continuous on every closed interval between the initial point and an interior point. Indeed, is Lipschitz and the primitives of the integrands in (18)–(20) are on . The explicit terms are also absolutely continuous after the substitution . In the logarithmic derivative of (18), the terms containing cancel, leaving, almost everywhere,
Thus
Similarly,
almost everywhere, and
The identities (60) and (62) initially hold almost everywhere; their continuous right-hand sides then show that both compositions are . Absolute continuity of is not required.
Introduce
Using the algebraic identity
the derivatives (3.25)–(3.28) give
The identity holds almost everywhere; the denominator does not vanish in the interior, by (2.24)–(2.25), and the continuous right-hand side shows that is .
On the increasing branch we move downwards in from , that is, from infinity towards zero in ; on the decreasing branch we move upwards in from , that is, from zero towards infinity in . Along both paths, decreases from . Since in the interior, (3.29) proves that is strictly increasing along the path. At the starting endpoints,
These formulas follow from (3.19) and the limits already established for . In both cases, extends continuously to the initial point with value .
We now use , with , as time. Since is continuous and strictly increasing along , the identities
define and uniquely on . Differentiating with respect to , with , equations (3.29) and (3.33) give
with
For , we have on the increasing branch and on the decreasing branch. The time is finite for every interior , and the denominator does not vanish before that time is reached. The solution on the prescribed side of the driving function is obtained from the CGF. After rescaling time, (3.37) is the chordal Loewner equation in a real variable [26]. Integrating with constant on each step gives the radical used in the construction.
Comparison with a singular initial condition
We first treat . For , define
The first map is nondecreasing in and satisfies
For , it is the solution with constant driving function starting from , including when the initial condition equals . The recursion uses .
Consider a step of duration , shifting its time origin to zero. Assume
Then
To verify the bound also for a singular initial condition, set , , and consider the functions and . They are continuous at zero and smooth for , with . Write
The field is decreasing in and increasing in wherever it is defined. If , then , hence
If instead , then and
On every open component of the set where either difference is positive, that difference would therefore have a nonpositive initial value and a negative derivative, which is impossible. Continuity at zero allows the same argument for a component starting at zero, without requiring the solution to be differentiable there. This proves (76).
Now let be an approximate initial value with . The triangle inequality and give
Therefore
Identity (74) gives
Combining (76) with (81), we obtain
Thus the same error bound passes from one step to the next, even when .
Convergence and error control
For the partition in the statement, set
During the step from to , the unique satisfying lies between and . The definition of therefore gives
On the increasing branch, , and the recursion (22) is precisely with and . Since , the bound (84) applies inductively to every step and gives
On the decreasing branch, the substitution , preserves (70) and reduces the problem to the case just proved. Returning to the original sign gives exactly the positive square root prescribed by , with the same bound.
Uniform continuity of on implies as , without any condition on the ratios of the lengths of different steps. Hence the limit exists, is independent of the partitions, and is
The same identification at each node turns (87) into the bound (25) in the statement.
The same comparison applies to any other continuous solution of (70) with the same initial value and lying strictly on the same side of for . It satisfies (87) relative to the same radicals and therefore coincides with (88) as the mesh size tends to zero. The reduced solution is thus unique on this branch.
Reconstruction and reflection
The identities (63) and (88) recover (26). Solving (52) for the exponential and using (13), we obtain, respectively,
With , and , these are precisely (27) and (28). The arguments of their logarithms are positive by the orderings already proved; follows from . Strict monotonicity and the limits (36)–(39) complete the parametrization of the entire positive half-line.
Finally, the proportion of white mass has urn function and the same discrete uniform initialization (2). For every finite , we already have
Passing to the limit gives (33). Reflection preserves the class and the Lipschitz property of the inverses, interchanging the two outer branches. If , the largest fixed point of the reflected function is one, and the case already treated gives for . The normalization completes the solution on .
Examples and computation of the CGF
We compare the recursion (22) with four explicit CGFs.
Two affine urns
For comparison, we use two exact affine solutions from Corollary 12 of Ref. [22], as corrected in the accompanying corrigendum. We first consider
The fixed point is , the inverse is Lipschitz with constant 3, and the positive branch starts at with . The three quadratures become
The limit of the radicals is
Substitution into (26) gives
and reconstruction yields
The function in (4.5), expressed in the time variable , satisfies (70), has and satisfies for . By the uniqueness proved in § 3.4, this function coincides with the limit of the radicals; (4.7) is therefore the CGF. Since , reflection completes the solution:
For the second example, take
The fixed point is again , but the inverse has Lipschitz constant 2 and the positive branch starts at , with . The first quadrature is
The exact solution is now
Indeed, setting gives
and equation (13) follows by substitution. For , the derivative is strictly increasing and (53) gives ; moreover, and both tend to as . The transformed solution therefore starts at the prescribed initial point and remains above . Uniqueness from § 3.4 identifies the CGF on the positive half-line; the symmetry of the urn function gives the negative half-line by reflection. Figure 1 compares the two exact CGFs with the values obtained from the recursion.

Figure 1. Two affine urns. Top: the increasing function (92); bottom: the decreasing function (100). On the left, the urn function (solid line) and the diagonal (dotted line) intersect at the fixed point. On the right, the exact CGF is compared with the points obtained from (22) using intervals (circles) and (crosses), uniformly spaced in between the initial point and the evaluation point. The quadratures are computed on a finer grid. The upper example starts at the boundary with the negative square root; the lower example starts at the fixed point with the positive square root.
A non-affine urn
Consider the increasing function
It is Hölder continuous with exponent , hence belongs to , and satisfies . Its inverse is
With , we obtain
The inverse is therefore Lipschitz, although has no finite derivative at the endpoints. Moreover,
The factor in parentheses is positive throughout the interval under consideration: the unique fixed point is . For the positive half-line, we therefore use and . The CGF is
To verify this, set ; then
Rationalizing the quotient in the HLS equation gives
On the positive half-line, has positive derivative, so (53) gives ; moreover, and both tend to one as . The transformed solution remains below and has the prescribed initial point. Uniqueness from § 3.4 therefore identifies this formula as the CGF; symmetry completes the negative half-line.
Zeros and an interior accessible endpoint
Take
In this case
The inverse on the two outer branches is and is Lipschitz; injectivity in (12) is required only up to the endpoint . On the positive half-line, the construction starts at with and remains in the interval . The first quadrature becomes
The solution on the whole real line can be written as
In particular,
with . Indeed, on the branches where , the HLS equation becomes
The integral (115) satisfies this identity. On each half-line, the difference between two solutions is a constant divided by the square root of ; continuity at zero eliminates both constants. Moreover, and
which gives : the derivative remains in the interval where the urn function is affine. We recover
At the interior endpoint, we also have
In equations (121) and (123), is the circle constant. The constant term is finite even though . Figure 2 compares the exact solutions with the values from the recursion for the non-affine urn and the urn with zeros. In the non-affine example, the urn function

Figure 2. A non-affine urn and an urn with zeros. Top: (104), an increasing function with a Lipschitz inverse and fixed point ; the CGF (108) has limiting slope one. Bottom: (111) vanishes from onwards; the fixed point is and the limiting CGF slope is . Left: urn function and diagonal; right: exact CGF and points computed with intervals (circles) and (crosses), using the same conventions as in Figure 1. The upper example starts at with the negative square root, the lower example at with the positive square root.
remains positive and the slope of the CGF tends to one; for the urn with zeros, the range of slopes ends at the interior endpoint .
Numerical evaluation. Each approximate point in the figures is obtained by substituting for in formulas (26)–(28). We denote the coordinates by and . The vertical error relative to the exact curve is
Comparison at a prescribed value of also requires inverting the parametrization. For the four points corresponding to the exact values , with intervals uniformly spaced in , the maximum of (122) is less than in all examples. The quadratures were computed using the trapezoidal rule after the substitution
In these checks, doubling the grid from 65536 to 131072 intervals changes the reconstructed coordinates by less than . This comparison measures the numerical sensitivity of the quadratures; the theoretical bound (25) concerns exact quadratures. On an interior interval, the reconstruction formulas are regular functions of the admissible data. Notice that near the endpoints the logarithms may amplify the error and require a separate check.
Declaration of Generative AI
Research, writing, and proofreading of the present manuscript were performed with AI assistance (GPT-6 Astra) under strict human guidance and scrutiny. We independently checked all mathematical arguments and take full responsibility for the content of the publication.
References
- [1]B. M. Hill, D. Lane, W. Sudderth, A Strong Law for Some Generalized Urn Processes, Ann. Probab. 8(2), 214–226 (1980). https://doi.org/10.1214/aop/1176994772.
- [2]R. Pemantle, A survey of random processes with reinforcement, Probab. Surv. 4, 1–79 (2007). https://doi.org/10.1214/07-PS094.
- [3]S. Franchini, The Urn of Hill, Lane and Sudderth, arXiv:2506.20826 (2026). https://doi.org/10.48550/arXiv.2506.20826.
- [4]W. Bryc, D. Minda, S. Sethuraman, Large deviations for the leaves in some random trees, Adv. Appl. Probab. 41(3), 845–873 (2009). https://doi.org/10.1239/aap/1253281066.
- [5]E. Baur, J. Bertoin, Elephant random walks and their connection to Pólya-type urns, Phys. Rev. E 94, 052134 (2016). https://doi.org/10.1103/PhysRevE.94.052134.
- [6]M. Podder, A. Roy, Elephant Random Walks with Multiple Extractions and General Reinforcement Functions, J. Theor. Probab. 39(1), 17 (2026). https://doi.org/10.1007/s10959-025-01471-4.
- [7]G. Dosi, Y. Ermoliev, Y. Kaniovski, Generalized urn schemes and technological dynamics, J. Math. Econ. 23(1), 1–19 (1994). https://doi.org/10.1016/0304-4068(94)90032-9.
- [8]S. Franchini, R. Balzan, Large-deviation theory of increasing returns, Phys. Rev. E 107, 064142 (2023). https://doi.org/10.1103/PhysRevE.107.064142.
- [9]T. Gottfried, S. Grosskinsky, Wages and capital returns in a generalized Pólya urn, J. Econ. Interact. Coord. 20, 477–518 (2025). https://doi.org/10.1007/s11403-024-00437-9.
- [10]K. Klymko, J. P. Garrahan, S. Whitelam, Similarity of ensembles of trajectories of reversible and irreversible growth processes, Phys. Rev. E 96, 042126 (2017). https://doi.org/10.1103/PhysRevE.96.042126.
- [11]K. Khanin, R. Khanin, A probabilistic model for the establishment of neuron polarity, J. Math. Biol. 42, 26–40 (2001). https://doi.org/10.1007/PL00000071.
- [12]B. Barabás, L. Caglioti, K. Micskei, G. Pá lyi, Data-Based Stochastic Approach to Absolute Asymmetric Synthesis by Autocatalysis, Bull. Chem. Soc. Jpn. 82(11), 1372–1376 (2009). https://doi.org/10.1246/bcsj.82.1372.
- [13]S. Briend, L. Devroye, G. Lugosi, Broadcasting in random recursive dags, ESAIM Probab. Stat. 29, 184–203 (2025). https://doi.org/10.1051/ps/2025002.
- [14]A. Bellina, C. Castellano, P. Pineau, G. Iannelli, G. De Marzo, Effect of collaborative-filtering-based recommendation algorithms on opinion polarization, Phys. Rev. E 108, 054304 (2023). https://doi.org/10.1103/PhysRevE.108.054304.
- [15]F. Tria, V. Loreto, V. D. P. Servedio, S. H. Strogatz, The dynamics of correlated novelties, Sci. Rep. 4, 5890 (2014). https://doi.org/10.1038/srep05890.
- [16]S. Franchini, R. Balzan, Random polymers and generalized urn processes, Phys. Rev. E 98, 042502 (2018). https://doi.org/10.1103/PhysRevE.98.042502.
- [17]S. Franchini, R. Balzan, Energy of the interacting self-avoiding walk at the θ point, Phys. Rev. E 102, 032143 (2020). https://doi.org/10.1103/PhysRevE.102.032143.
- [18]W. B. Arthur, Yu. M. Ermoliev, Yu. M. Kaniovski, Strong laws for a class of path-dependent stochastic processes with applications, in Stochastic Optimization, Lecture Notes in Control and Information Sciences 81, 287–300 (1986). https://doi.org/10.1007/BFb0007105.
- [19]R. Pemantle, When are touchpoints limits for generalized Pólya urns?, Proc. Amer. Math. Soc. 113(1), 235–243 (1991). https://doi.org/10.1090/S0002-9939-1991-1055778-8.
- [20]K. Nakayama, S. Mori, Universal function of the nonequilibrium phase transition of a nonlinear Pólya urn, Phys. Rev. E 104, 014109 (2021). https://doi.org/10.1103/PhysRevE.104.014109.
- [21]B. M. Hill, D. Lane, W. Sudderth, Exchangeable urn processes, Ann. Probab. 15(4), 1586–1592 (1987). https://doi.org/10.1214/aop/1176991995.
- [22]S. Franchini, Large deviations for generalized Polya urns with arbitrary urn function, Stochastic Process. Appl. 127(10), 3372–3411 (2017). https://doi.org/10.1016/j.spa.2017.02.010; corrigendum: Stochastic Process. Appl. 189, 104745 (2025), https://doi.org/10.1016/j.spa.2025.104745.
- [23]R. L. Jack, Large deviations in models of growing clusters with symmetry-breaking transitions, Phys. Rev. E 100, 012140 (2019). https://doi.org/10.1103/PhysRevE.100.012140.
- [24]J. R. Blum, M. Brennan, On the strong law of large numbers for dependent random variables, Israel J. Math. 37(3), 241–245 (1980). https://doi.org/10.1007/BF02760965.
- [25]S. Franchini, Large deviations for Generalized Polya Urns with non-binary increments, arXiv:2506.22234 (2026). https://doi.org/10.48550/arXiv.2506.22234.
- [26]T. Kennedy, Numerical computations for the Schramm–Loewner Evolution, J. Stat. Phys. 137, 839–856 (2009). https://doi.org/10.1007/s10955-009-9866-2.
- [27]H. Tran, Convergence of an algorithm simulating Loewner curves, Ann. Acad. Sci. Fenn. Math. 40, 601–616 (2015). https://doi.org/10.5186/aasfm.2015.4037.
- [28]G. Bardella, S. Franchini, P. Pani, S. Ferraina, Lattice physics approaches for neural networks, iScience 27(12), 111390 (2024). https://doi.org/10.1016/j.isci.2024.111390.
- [29]K. Friston, T. FitzGerald, F. Rigoli, P. Schwartenbeck, G. Pezzulo, Active Inference: A Process Theory, Neural Comput. 29(1), 1–49 (2017). https://doi.org/10.1162/NECO_a_00912.
- [30]A. Bandyopadhyay, D. Thacker, A new approach to Pólya urn schemes and its infinite color generalization, Ann. Appl. Probab. 32(1), 46–79 (2022). https://doi.org/10.1214/21-AAP1671.