Sunder Sethuraman
 Professor, Mathematics
 Professor, StatisticsGIDP
 Professor, Applied Mathematics  GIDP
Contact
 (520) 6211774
 Environment and Natural Res. 2, Rm. S413
 Tucson, AZ 85719
 sethuram@email.arizona.edu
Awards
 Fellowship in the Institute of Mathematical Statistics
 Institute of Mathematical Statistics, Fall 2018
 JSPS Invitational Fellowship for Research in Japan
 Japan Society for the Promotion of Science, Fall 2018
 Simons Foundation Fellowship for sabbatical support
 Simons Foundation, Spring 2018
Interests
No activities entered.
Courses
202021 Courses

Independent Study
MATH 599 (Fall 2020) 
Probability Math
MATH 563 (Fall 2020) 
Probability Math
STAT 563 (Fall 2020) 
Research
STAT 900 (Fall 2020)
201920 Courses

Calculus II
MATH 129 (Spring 2020) 
Dissertation
MATH 920 (Spring 2020) 
Dissertation
MATH 920 (Fall 2019) 
Probability Math
MATH 563 (Fall 2019) 
Probability Math
STAT 563 (Fall 2019) 
Research
STAT 900 (Fall 2019)
201819 Courses

Dissertation
MATH 920 (Spring 2019) 
Dissertation
MATH 920 (Fall 2018)
201718 Courses

Dissertation
MATH 920 (Spring 2018) 
Stochastic Diff Equation
MATH 565C (Spring 2018) 
Thesis
STAT 910 (Spring 2018) 
Calculus II
MATH 129 (Fall 2017) 
Dissertation
MATH 920 (Fall 2017) 
Stochastic Processes
MATH 565B (Fall 2017) 
Thesis
STAT 910 (Fall 2017)
201617 Courses

Dissertation
MATH 920 (Spring 2017) 
Honors Thesis
MATH 498H (Spring 2017) 
Thesis
STAT 910 (Spring 2017) 
Honors Thesis
MATH 498H (Fall 2016) 
Independent Study
MATH 599 (Fall 2016) 
Real Analysis
MATH 523A (Fall 2016) 
Theory of Probability
MATH 464 (Fall 2016)
201516 Courses

Appl Stochastic Process
MATH 468 (Spring 2016) 
Appl Stochastic Process
MATH 568 (Spring 2016) 
Dissertation
MATH 920 (Spring 2016) 
Independent Study
MATH 599 (Spring 2016)
Scholarly Contributions
Chapters
 Venkataramani, S. C., & Sethuraman, S. (2019). On the Growth of a Superlinear Preferential Attachment Scheme.. In Probability and Analysis in Interacting Physical Systems(pp 243265). Cham: Springer. doi:https://doi.org/10.1007/9783030153380_9More infoWe consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node selected with probability proportional to a superlinear function of its degree. For such schemes, it is known that the graph evolution condenses, that is a.s. in the limit graph there will be a single random node with infinite degree while all others have finite degree.In this note, among other results, we establish law of large numbers type limits in probability, as n\to \infty$, for the counts Z_k(n) of the number of nodes with degree k\geq 1 at time n\geq 1. These limits rigorously verify a physical picture of Krapivisky, Redner and Leyvraz (2000) on how the condensation arises with respect to the degree distribution.
 Bernardin, C., Goncalves, P., & Sethuraman, S. (2014). Equilibrium fluctuations of additive functionals of zerorange models.. In From Particle Systems to Partial Differential Equations(pp 143169). Berlin: SpringerVerlag.More infoWe discuss the fluctuations on occupation time and other functionals of zerorange particle systems. The main point of the paper is to understand how mixing rate, given by the type of interaction, connects with the fluctuations.
Journals/Publications
 Davis, E., & Sethuraman, S. (2019). Approximating geodesics via random points. Ann. Appl. Probab., 29, 14461486.More infoGiven a ‘cost’ functional F on paths \gamma in a domain D⊂R^d, in the form F(\gamma) = \int_0^1 f(\dot \gamma, \gamma)dt, it is of interest to approximate its minimumcost and geodesic paths. Let X_1, ..., X_n be points drawn independently from D according to a distribution with a density. Form a random geometric graph on the points where X_i and X_j are connected when 0
 Sethuraman, S., & Venkataramani, S. C. (2019). On the Growth of a Superlinear Preferential Attachment Scheme. Probability and Analysis in Interacting Particle Systems: In Honor of SRS Varadhan, Berlin, August 2016; Springer Proceedings in Mathematics and Statistics, 283, 243265.More infoWe consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node selected with probability proportional to a superlinear function of its degree. For such schemes, it is known that the graph evolution condenses, that is a.s. in the limit graph there will be a single random node with infinite degree while all others have finite degree.In this note, among other results, we establish law of large numbers type limits in probability, as n\to \infty$, for the counts Z_k(n) of the number of nodes with degree k\geq 1 at time n\geq 1. These limits rigorously verify a physical picture of Krapivisky, Redner and Leyvraz (2000) on how the condensation arises with respect to the degree distribution.
 Davis, E., & Sethuraman, S. (2016). Consistency of modularity clustering of random geometric graphs. Ann. Appl. Probab..More infoWe consider samples X_1,X_2,...,X_n of independent, identically distributed observations of an underlying probability measure \nu on a bounded domain D\subset R^d. The popular `modularity' clustering method specifies a partition U of the data set as the output of an optimization problem. In this paper, under conditions on \nu and D, we show a geometric form of consistency of versions of this method, among other limit results. That is, we show via Gamma convergence arguments, as n \to \infty, that the discrete optimal partitions U_n converge in a certain graphical sense to a continuum optimal partition U of the domain D, characterized as the output of a type of a Kelvin's shape optimization problem.
 Davis, E., & Sethuraman, S. (2017). Consistency of modularity clustering of random geometric graphs. Ann. Appl. Probab., 28, 20032062.More infoWe consider samples X_1,X_2,...,X_n of independent, identically distributed observations of an underlying probability measure \nu on a bounded domain D\subset R^d. The popular `modularity' clustering method specifies a partition U of the data set as the output of an optimization problem. In this paper, under conditions on \nu and D, we show a geometric form of consistency of versions of this method, among other limit results. That is, we show via Gamma convergence arguments, as n \to \infty, that the discrete optimal partitions U_n converge in a certain graphical sense to a continuum optimal partition U of the domain D, characterized as the output of a type of a Kelvin's shape optimization problem.
 Davis, E., & Sethuraman, S. (2018). CONSISTENCY OF MODULARITY CLUSTERING ON RANDOM GEOMETRIC GRAPHS. ANNALS OF APPLIED PROBABILITY, 28(4), 20032062.
 Lega, J., Sethuraman, S., & Young, A. (2017). On collisions times of elastic and inelastic particles in onedimension with random initial positions and velocities. J. Stat. Phys., 170, 10881122.More infoWe investigate a onedimensional system of N particles, initially distributed with random positions and velocities, interacting through binary collisions. The collisions rule is such that there is a time after which the N particles do not interact and sorted according to their velocities. In such a system, the distribution of the collision times is of interest. When the collisions are elastic, we derive asymptotic distributions for the ﬁnal collision time for a single particle and the ﬁnal collision time of the system as the number of particles approaches inﬁnity under different assumptions of the initial distributions of the particles’ positions and velocities. Additionally, a numerical investigation is carried out to determine how an inelastic collision rule which conserves neither momentum nor energy aﬀects the distribution of collision times, the ﬁnal collision time of a particle, and the ﬁnal collision time of the system.
 Lega, J., Sethuraman, S., & Young, A. L. (2018). On Collisions Times of 'SelfSorting' Interacting Particles in OneDimension with Random Initial Positions and Velocities. JOURNAL OF STATISTICAL PHYSICS, 170(6), 10881122.
 Sethuraman, S., & Shahar, D. (2018). Hydrodynamic limits for longrange asymmetric interacting particle systems. ELECTRONIC JOURNAL OF PROBABILITY, 23.
 Sethuraman, S., & Shahar, D. (2018). Hydrodynamics for asymmetric longrange interacting particle systems. Elec. J. Probab., 23, 54pgs.More infoWe consider the hydrodynamic scaling behavior of the mass density with respect to a general class of mass conservative interacting particle systems on Zn, where the jump rates are asymmetric and longrange of order x^{n+α} for a particle displacement of order x. Two types of evolution equations are identified depending on the strength of the longrange asymmetry. When 0 < α < 1, we find a new integropartial differential hydrodynamic equation, in an anomalous spacetime scale. On the other hand, when α ≥ 1, we derive a Burgers hydrodynamic equation, as in the finiterange setting, in Euler scale.
 Young, A. L., Sethuraman, S., & Lega, J. C. (2018). On collisions times of `selfsorting' interacting particles in onedimension with random initial positions and velocities. Journal of Statistical Physics, 170, 10881122. doi:http://dx.doi.org/10.1007/s1095501819744
 Bernardin, C., Goncalves, P., & Sethuraman, S. (2016). Occupation times of longrange exclusion and connections to KPZ class exponents. Probability Theory and Related Fields, 166, 365428.More infoIt is known that the fluctuations of the occupation time in nearestneighbor asymmetric simple exclusion processes, in some regime of parameters, reflects the fluctuations of the height function of certain interfaces related to KPZ class phenomena. Here, we consider asymmetries which are longrange and find phase transitions in the occupation time fluctuations in terms of a parameter governing the strength of the longrange transitions. We propose an extension of the nearestneighbor KPZ class to these longrange models.
 Choi, J., Sethuraman, S., & Venkatasubramani, S. (2016). A scaling limit for the degree distribution in sublinear preferential attachment. Random Structures and Algorithms, 48, 703731.More infoThis paper establishes a rigorous meanfield theory for the degree distribution in a growth model of random graphs which grow by a sublinear reinforcement rule, the socalled sublinear preferential attachment graph. The new technique merges probability and dynamical system arguments.
 Sethuraman, S. (2016). On microscopic derivation of a fractional stochastic Burgers equation. Communications in Mathematical Physics, 341, 625665.More infoWe derive a fractional Burgers stochastic partial differential equations as a limit of the fluctuation field from certain longrange weakly asymmetric interacting particle systems. This work introduces these SPDEs and also physically motivates them.
 Choi, J., & Sethuraman, S. (2013). Large deviations for the degree structure in preferential attachment schemes. Annals of Applied Probability, 23(2), 722763.More infoAbstract: Preferential attachment schemes, where the selection mechanism is linear and possibly timedependent, are considered, and an infinitedimensional large deviation principle for the sample path evolution of the empirical degree distribution is found by DupuisEllistype methods. Interestingly, the rate function, which can be evaluated, contains a term which accounts for the cost of assigning a fraction of the total degree to an "infinite" degree component, that is, when an atypical "condensation" effect occurs with respect to the degree structure. As a consequence of the large deviation results, a sample path a.s. law of large numbers for the degree distribution is deduced in terms of a coupled system of ODEs from which power law bounds for the limiting degree distribution are given. However, by analyzing the rate function, one can see that the process can deviate to a variety of atypical nonpower law distributions with finite cost, including distributions typically associated with sub and superlinear selection models. © 2013 Institute of Mathematical Statistics.
 Jara, M., Landim, C., & Sethuraman, S. (2013). Nonequilibrium fluctuations for a tagged particle in onedimensional sublinear zerorange processes. Annales de l'institut Henri Poincare (B) Probability and Statistics, 49(3), 611637.More infoAbstract: Nonequilibrium fluctuations of a tagged, or distinguished particle in a class of one dimensional meanzero zerorange systems with sublinear, increasing rates are derived. In JaraLandimSethuraman (Probab. Theory Related Fields 145 (2009) 565590), processes with at least linear rates are considered. A different approach to establish a main "local replacement" limit is required for sublinear rate systems, given that their mixing properties are much different. The method discussed also allows to capture the fluctuations of a "secondclass" particle in unit rate, symmetric zerorange models. © Association des Publications de l'Institut Henri Poincaré, 2013.
 Liu, S., Matzavinos, A., & Sethuraman, S. (2013). Random walk distances in data clustering and applications. Advances in Data Analysis and Classification, 7(1), 83108.More infoAbstract: In this paper, we develop a family of data clustering algorithms that combine the strengths of existing spectral approaches to clustering with various desirable properties of fuzzy methods. In particular, we show that the developed method "FuzzyRW," outperforms other frequently used algorithms in data sets with different geometries. As applications, we discuss data clustering of biological and face recognition benchmarks such as the IRIS and YALE face data sets. © 2013 SpringerVerlag Berlin Heidelberg.
 Sethuraman, S., & Varadhan, S. R. (2013). Large deviations for the current and tagged particle in 1D nearestneighbor symmetric simple exclusion. Annals of Probability, 41(3 A), 14611512.More infoAbstract: Laws of large numbers, starting from certain nonequilibrium measures, have been shown for the integrated current across a bond, and a tagged particle in onedimensional symmetric nearestneighbor simple exclusion [Ann. Inst. Henri Poincaré Probab. Stat. 42 (2006) 567577]. In this article, we prove corresponding large deviation principles and evaluate the rate functions, showing different growth behaviors near and far from their zeroes which connect with results in. © Institute of Mathematical Statistics, 2013.
 Athreya, S., Sethuraman, S., & Tóth, B. (2011). On the range, local times and periodicity of random walk on an interval. Alea, 8(1), 269284.More infoAbstract: The range, local times, and periodicity of symmetric, weakly asymmetric and asymmetric random walks at the time of exit from a strip with N locations are considered. Several results on asymptotic distributions are obtained.
 Sethuraman, J., & Sethuraman, S. (2010). Connections between bernoulli strings and random permutations. tThe Legacy of Alladi Ramakrishnan in the Mathematical Sciences, 389399.More infoAbstract: A sequence of random variables, each taking only two values 0 or 1, is called a Bernoulli sequence. Consider the counts of occurrences of strings of the form {11}, {101}, {1001}, ⋯ in Bernoulli sequences. Counts of such Bernoulli strings arise in the study of the cycle structure of random permutations, Bayesian nonparametrics, record values etc. The joint distribution of such counts is a problem worked on by several researchers. In this paper, we summarize the recent technique of using conditional marked Poisson processes which allows to treat all cases studied previously. We also give some related open problems. © 2010 Springer Science+Business Media, LLC.
 Bryc, W., Minda, D., & Sethuraman, S. (2009). Large deviations for the leaves in some random trees. Advances in Applied Probability, 41(3), 845873.More infoAbstract: Large deviation principles and related results are given for a class of Markov chains associated to the leaves.' in random recursive trees and preferential attachment random graphs, as well as the 'cherries' in Yule trees. In particular, the method of proof, combining analytic and DupuisEllistype path arguments, allows for an explicit computation of the large deviation pressure. © Applied Probability Trust 2009.
 Huffer, F. W., Sethuraman, J., & Sethuraman, S. (2009). A study of counts of bernoulli strings via conditional poisson processes. Proceedings of the American Mathematical Society, 137(6), 21252134.More infoAbstract: A sequence of random variables, each taking values 0 or 1, is called a Bernoulli sequence. We say that a string of length d occurs in a Bernoulli sequence if a success is followed by exactly (d  1) failures before the next success. The counts of such dstrings are of interest, and in specific independent Bernoulli sequences are known to correspond to asymptotic dcycle counts in random permutations. In this paper, we give a new framework, in terms of conditional Poisson processes, which allows for a quick characterization of the joint distribution of the counts of all dstrings, in a general class of Bernoulli sequences, as certain mixtures of the product of Poisson measures. In particular, this general class includes all Bernoulli sequences considered in the literature, as well as a host of new sequences. © 2008 American Mathematical Society.
 Jara, M. D., Landim, C., & Sethuraman, S. (2009). Nonequilibrium fluctuations for a tagged particle in meanzero onedimensional zerorange processes. Probability Theory and Related Fields, 145(4), 565590.More infoAbstract: We prove a nonequilibrium functional central limit theorem for the position of a tagged particle in meanzero onedimensional zerorange process. The asymptotic behavior of the tagged particle is described by a stochastic differential equation governed by the solution of the hydrodynamic equation. © SpringerVerlag 2008.
 Athreya, K. B., Ghosh, A. P., & Sethuraman, S. (2008). Growth of preferential attachment random graphs via continuoustime branching processes. Proceedings of the Indian Academy of Sciences: Mathematical Sciences, 118(3), 473494.More infoAbstract: Some growth asymptotics of a version of 'preferential attachment' random graphs are studied through an embedding into a continuoustime branching scheme. These results complement and extend previous work in the literature.
 Balázs, M., RassoulAgha, F., Seppäläinen, T., & Sethuraman, S. (2007). Existence of the zero range process and a deposition model with superlinear growth rates. Annals of Probability, 35(4), 12011249.More infoAbstract: We give a construction of the zero range and bricklayers' processes in the totally asymmetric, attractive case. The novelty is mat we allow jump rates to grow exponentially. Earlier constructions have permitted at most linearly growing rates. We also show the invariance and extremality of a natural family of i.i.d. product measures indexed by particle density. Extremality is proved with an approach mat is simpler than existing ergodicity proofs. © Institute of Mathematical Statistics, 2007.
 Dietz, Z., & Sethuraman, S. (2007). Occupation laws for some timenonhomogeneous Markov chains. Electronic Journal of Probability, 12, 661683.More infoAbstract: We consider finitestate timenonhomogeneous Markov chains whose transition matrix at time n is I + G/nζ where G is a "generator" matrix, that is G(i, j) > 0 for i, j distinct, and G(i, i) = ∑k≠i G(i, k), and ζ > 0 is a strength parameter. In these chains, as time grows, the positions are less and less likely to change, and so form simple models of agedependent timereinforcing schemes. These chains, however, exhibit a trichotomy of occupation behaviors depending on parameters. We show that the average occupation or empirical distribution vector up to time n, when variously 0 < ζ < 1, ζ > 1 or ζ = 1, converges in probability to a unique "stationary" vector V G, converges in law to a nontrivial mixture of point measures, or converges in law to a distribution μG with no atoms and full support on a simplex respectively, as n ↑ ∞. This last type of limit can be interpreted as a sort of "spreading" between the cases 0 < ζ 1 and ζ > 1. In particular, when G is appropriately chosen, μG is a Dirichlet distribution, reminiscent of results in Pólya urns.
 Sethuraman, S. (2007). On diffusivity of a tagged particle in asymmetric zerorange dynamics. Annales de l'institut Henri Poincare (B) Probability and Statistics, 43(2), 215232.More infoAbstract: Consider a distinguished, or tagged particle in zerorange dynamics on Zd with rate g whose finiterange jump probabilities p possess a drift ∑ j p (j) ≠ 0. We show, in equilibrium, that the variance of the tagged particle position at time t is at least order t in all d ≥ 1, and at most order t in d = 1 and d ≥ 3 for a wide class of rates g. Also, in d = 1, when the jump distribution p is totally asymmetric and nearestneighbor, and the rate g (k) increases, and g (k) / k either decreases or increases with k, we show the diffusively scaled centered tagged particle position converges to a Brownian motion with a homogenized diffusion coefficient in the sense of finitedimensional distributions. Some characterizations of the tagged particle variance are also given. © 2006 Elsevier Masson SAS. All rights reserved.
 Sethuraman, S. (2006). Erratum: Central limit theorems for additive functionals of the simple exclusion process (Annals of Probability (2006) 34:1 (427428)). Annals of Probability, 34(1), 427428.
 Sethuraman, S. (2006). Superdiffusivity of occupationtime variance in 2dimensional asymmetric exclusion processes with density ρ = 1/2. Journal of Statistical Physics, 123(4), 787802.More infoAbstract: We compute that the growth of the occupationtime variance at the origin up to time t in dimension d = 2 with respect to asymmetric simple exclusion in equilibrium with density ρ = 1/2 is in a certain sense at least tlog (log t) for general rates, and at least t(log t) 1/2 for rates which are asymmetric only in the direction of one of the axes. These estimates give a complement to bounds in the literature when d = 1, and are consistent with an important conjecture with respect to the transition function and variance of "secondclass" particles. © 2006 Springer Science+Business Media, Inc.
 Dietz, Z., & Sethuraman, S. (2005). Large deviations for a class of nonhomogeneous Markov chains. Annals of Applied Probability, 15(1 A), 421486.More infoAbstract: Large deviation results are given for a class of perturbed nonhomogeneous Markov chains on finite state space which formally includes some stochastic optimization algorithms. Specifically, let {P n} be a sequence of transition matrices on a finite state space which converge to a limit transition matrix P. Let [X n] be the associated nonhomogeneous Markov chain where P n controls movement from time n  1 to n. The main statements are a large deviation principle and bounds for additive functionals of the nonhomogeneous process under some regularity conditions. In particular, when P is reducible, three regimes that depend on the decay of certain "connection" P n probabilities are identified. Roughly, if the decay is too slow, too fast or in an intermediate range, the large deviation behavior is trivial, the same as the timehomogeneous chain run with P or nontrivial and involving the decay rates. Examples of anomalous behaviors are also given when the approach P n → P is irregular. Results in the intermediate regime apply to geometrically fast running optimizations, and to some issues in glassy physics. © Institute of Mathematical Statistics, 2005.
 Sethuraman, S., & Varadhan, S. R. (2005). A martingale proof of dobrushin's theorem for nonhomogeneous Markov Chains. Electronic Journal of Probability, 10.More infoAbstract: In 1956, Dobrushin proved an important central limit theorem for nonhomogeneous Markov chains. In this note, a shorter and different proof elucidating more the assumptions is given through martingale approximation.
 Seppäläinen, T., & Sethuraman, S. (2003). Transience of secondclass particles and diffusive bounds for additive functionals in onedimensional asymmetric exclusion processes. Annals of Probability, 31(1), 148169.More infoAbstract: Consider a onedimensional exclusion process with finiterange translationinvariant jump rates with nonzero drift. Let the process be stationary with product Bernoulli invariant distribution at density ρ. Place a secondclass particle initially at the origin. For the case ≠ 1/2 we show that the time spent by the secondclass particle at the origin has finite expectation. This strong transience is then used to prove that variances of additive functionals of local meanzero functions are diffusive when ≠ 1/2. As a corollary to previous work, we deduce the invariance principle for these functionals. The main arguments are comparisons of H1 norms, a large deviation estimate for secondclass particles and a relation between occupation times of secondclass particles, and additive functional variances.
 Sethuraman, S. (2003). A clustering law for some discrete order statistics. Journal of Applied Probability, 40(1), 226241.More infoAbstract: Let X1, X2, ..., Xn be a sequence of independent, identically distributed positive integer random variables with distribution function F. Anderson (1970) proved a variant of the law of large numbers by showing that the sample maximum moves asymptotically on two values if and only if F satisfies a 'clustering' condition, limn → ∞[1 F(n + 1)]/[1  F(n)] = 0. In this article, we generalize Anderson's result and show that it is robust by proving that, for any r ≥ 0, the sample maximum and other extremes asymptotically cluster on r + 2 values if and only if limn → ∞ [1  F(n + r + 1)]/[1  F(n)] = 0. Together with previous work which considered other asymptotic properties of these sample extremes, a more detailed asymptotic clustering structure for discrete order statistics is presented.
 Sethuraman, S. (2003). An equivalence of H_{1} norms for the simple exclusion process. Annals of Probability, 31(1), 3562.More infoAbstract: Resolvent H1 norms with respect to simple exclusion processes play an important role in many problems with respect to additive functionals, tagged particles, and hydrodynamics, among other concerns. Here, general translationinvariant finiterange simple exclusion processes with and without a distinguished particle are considered. For the standard system of indistinguishable particles, it is proved that the corresponding H1 norms are equivalent, in a sense, to the H1 norms of a nearestneighbor system. The same result holds for systems with a distinguished particle in dimensions d ≥ 2. However, in dimension d = 1, this equivalence does not hold. An application of the H1 norm equivalence to additive functional variances is also given.
 Sethuraman, S. (2003). Conditional survival distributions of Brownian trajectories in a one dimensional Piossonian environment. Stochastic Processes and their Applications, 103(2), 169209.More infoAbstract: Large time annealed path measure limits for a onedimensional Brownian motion, with possibly a small drift, moving among "soft" Poissonian traps are considered. Limits with respect to both scaled and unscaled motions are derived. The results in both cases considered here agree with those shown before for the related model with "hard" traps. The proofs follow by generalizing previous techniques which identify a large clearing empty of traps in which typically the Brownian motion is confined. What is understood then, in the cases studied, is that under the annealed measure the soft traps organize to act in effect as their hard counterparts. © 2002 Elsevier Science B.V. All rights reserved.
 Athreya, J. S., & Sethuraman, S. (2001). On the asymptotics of discrete order statistics. Statistics and Probability Letters, 54(3), 243249.More infoAbstract: Let X1,X2,...,Xn be a sequence of independent, identically distributed positive integer random variables. We study the asymptotics of the likelihood that the sample maximum is achieved k times and in its spacing relative to the second highest value. Earlier and other results are discussed in context. Also, some investigation is made when the sample is Markovian. Different results emerge in this case. © 2001 Elsevier Science B.V.
 Sethuraman, S. (2001). On extremal measures for conservative particle systems. Annales de l'institut Henri Poincare (B) Probability and Statistics, 37(2), 139154.More infoAbstract: It is well known that the exclusion, zerorange and misanthrope particle systems possess families of invariant measures due to the mass conservation property. Although these families have been classified a great deal, a full characterization of their extreme points is not available. In this article, we consider an approach to the study of this classification. One of the results in this note is that the zerorange product invariant measures, ∏i∈Sμα(·), for an infinite countable set S, under mild conditions, are identified as extremal for α(·)∈HZR where μα(i)(k)=Z(α(i))1α(i) k/g(1)g(k) with g and Z the rate function and normalization respectively, and HZR is the set of invariant measures for the transition probability p. © 2001 Éditions scientifiques et médicales Elsevier SAS.
 Sethuraman, S. (2000). Central limit theorems for additive functionals of the simple exclusion process. Annals of Probability, 28(1), 277302.More infoAbstract: Some invariance principles for additive functionals of simple exclusion with finiterange translationinvariant jump rates p(i, j) = p(j  i) in dimensions d ≥ 1 are established. A previous investigation concentrated on the case of p symmetric. The principal tools to take care of nonreversibility, when p is asymmetric, are invariance principles for associated random variables and a "local balance" estimate on the asymmetric generator of the process. As a byproduct, we provide upper and lower bounds on some transition probabilities for meanzero asymmetric secondclass particles, which are not Markovian, that show they behave like their symmetric Markovian counterparts. Also some estimates with respect to secondclass particles with drift are discussed. In addition, a dichotomy between the occupation time process limits in d = 1 and d ≥ 2 for symmetric exclusion is shown. In the former, the limit is fractional Brownian motion with parameter 3/4, and in the latter, the usual Brownian motion.
 Sethuraman, S., Varadhan, S. R., & Yau, H. (2000). Diffusive limit of a tagged particle in asymmetric simple exclusion processes. Communications on Pure and Applied Mathematics, 53(8), 9721006.More infoAbstract: Invariance principles are proved under diffusive scaling for the centered position of a tagged particle in the simple exclusion process with asymmetric nonzero drift jump probabilities in dimensions d ≥ 3. The method of proof is by martingale techniques which rely on the fact that symmetric random walks are transient in high dimensions. © 2000 John Wiley & Sons, Inc.
 Landim, C., Sethuraman, S., & Varadhan, S. (1996). Spectral gap for zerorange dynamics. Annals of Probability, 24(4), 18711902.More infoAbstract: We give a lower bound on the spectral gap for symmetric zerorange processes. Under some conditions on the rate function, we show that the gap shrinks as n2, independent of the density, for the dynamics localized on a cube of size nd. We follow the method outlined by Lu and Yau, where a similar spectral gap is proved for Kawasaki dynamics.
 Sethuraman, S., & Lin, X. u. (1996). A central limit theorem for reversible exclusion and zerorange particle systems. Annals of Probability, 24(4), 18421870.More infoAbstract: We give easily verifiable conditions under which a functional central limit theorem holds for additive functionals of symmetric simple exclusion and symmetric zerorange processes. Also a reversible exclusion model with speed change is considered. Let η(t) be the configuration of the process at time t and let f(η) be a function on the state space. The question is: For which functions f does λ 1/2∫λt0 f(η(s)) ds converge to a Brownian motion? A general but often intractable answer is given by Kipnis and Varadhan. In this article we determine what conditions beyond a meanzero condition on f(η) are required for the diffusive limit above. Specifically, we characterize the H1 space in an applicable way. Our method of proof relies primarily on a sharp estimate on the "spectral gap" of the process and weak regularity properties for the invariant measures.
 Sethuraman, S., & Lin, X. u. (1996). Spin depolarization decay rates in αsymmetric stable fields on cubic lattices. Communications on Pure and Applied Mathematics, 49(12), 12811298.More infoAbstract: We study the asymptotic, longtime behavior of the energy function E(t; λ; f) = 1/t ln E exp { tf [1/t ∑cursive Greek chi∈Zd (λ ∫t0 δ{cursive Greek chi} (Xs) ds)α]} where {Xs : 0 ≤ s < ∞} is the standard random walk on the ddimensional lattice ℤd, 1 < α ≤ 2, and f : ℝ+ → ℝ+ is any nondecreasing concave function. In the special case f(cursive Greek chi) = cursive Greek chi, our setting represents a lattice model for the study of transverse magnetization of spins diffusing in a homogeneous, αstable, i.i.d., random, longitudinal field {λV(cursive Greek chi) : cursive Greek chi ∈ ℤd} with common marginal distribution, the standard αsymmetric stable distribution; the parameter λ describes the intensity of the field. Using largedeviation techniques, we show that Sc(λ, α, f) = limt→∞ E(t; λ; f) exists. Moreover, we obtain a variational formula for this decay rate Sc. Finally, we analyze the behavior Sc(λ, α, f) as λ → 0 when f(cursive Greek chi) = cursive Greek chiβ for all 1 ≥ β > 0. Consequently, several physical conjectures with respect to lattice models of transverse magnetization are resolved by setting β = 1 in our results. We show that Sc(λ, α, 1) ∼ λα for d ≥ 3, λα(ln 1/λ)α1 in d = 2, and λ2α/α+1 in d = 1. © 1996 John Wiley & Sons, Inc.
Presentations
 Sethuraman, S. (2019, Jan 16, 2020). Approximating geodesics via random points. Joint Math Meetings (JMM); in Stochastic Spatial Models (an MRC event) I.. Denver, CO: AMS etc..
 Dietz, Z., Sethuraman, S., & Lippitt, W. L. (2019, September). Markovian Stickbreaking Measures and Clumping Procedures. AMS Fall Central Sectional Meeting. University of WisconsinMadison: AMS.More infoInvited talk on my dissertation research.
 Sethuraman, S. (2019, April 12, 2019). On Microscopic Derivation of a MeanCurvature Flow. NYU Probability Seminar. New York, NY: Courant Institute, NYU.
 Sethuraman, S. (2019, April 19, 2019). On Microscopic Derivation of a MeanCurvature Flow. Columbia Probability Seminar. New York, NY: Math, Columbia U..
 Sethuraman, S. (2019, April 5, 2019). On Microscopic Derivation of a MeanCurvature Flow. Brown Probability Seminar. Providence, RI: Applied Math, Brown U..
 Sethuraman, S. (2019, August 2630, 2019). On Microscopic Derivation of a MeanCurvature Flow. Dynamics, random media and universality of complex physical systems. Muenster, Germany: Uni Muenster, Germany.
 Sethuraman, S. (2019, Dec 12, 2019). On Microscopic Derivation of a MeanCurvature Flow. Hydrodynamic limit and related topics  One day symposium. Tokyo, Japan: Waseda University.
 Sethuraman, S. (2019, Dec 26, 2019). On Microscopic Derivation of a MeanCurvature Flow. Particle Systems and PDE VIII. Lisbon, Portugal: Inst Technico Superior, Lisbon.
 Sethuraman, S. (2019, January 16, 2019). Stick breaking, clumping, and occupation laws of Markov chains. Seminar at IMPA. Rio de Janeiro, Brazil: IMPA.
 Sethuraman, S. (2019, January 28, 2019). On hydrodynamic limit for Young diagrams. Universality in Random Structures 2019. Bangalore, India: ICTS International Center for Theoretical Sciences.
 Sethuraman, S. (2019, November 9, 2019). Stick breaking, clumping, and occupation laws of Markov chains. AMS Western Sectional Conference; Celebrating MM Rao's Many Mathematical Contributions as he Turns 90 Years Old, II. Riverside, CA: AMS; UC Riverside.
 Sethuraman, S. (2018, April). On the growth of nonlinear preferential attachment random trees. Random Trees: Structure, Selfsimilarity, and Dynamics. Guanajuato, MX: CIMAT.
 Sethuraman, S. (2018, June). On microscopic derivation of a multicolored KPZBurgers SPDE. Stochastic Processes and Applications. Gothenberg, Sweden: Chalmers University, and SPA.
 Sethuraman, S. (2018, November). Approximating geodesics via random points. SALSIS. KyotoRIMS: RIMS Kyoto University, Japan.
 Sethuraman, S. (2018, November). STICKBREAKING PROCESSES, CLUMPING, AND MARKOV CHAIN OCCUPATION LAWS. TempleUPenn Probability Seminar. Philadelphia, PA: Mathematics, Temple University.
 Sethuraman, S. (2018, October). Hydrodynamic limit for Young diagrams. Probability seminar, U. Tokyo. Tokyo, Japan: Mathematics, University of Tokyo.
 Sethuraman, S. (2018, Spring). Hydrodynamic limits for asymmetric longrange stochastic particle systems. Analysis seminar, U. Missouri. Columbia, Missouri: Mathematics, University of Missouri.
 Sethuraman, S. (2017, April). Consistency of modularity clustering and Kelvin's tiling problem. Statistics GIDP Colloquium. U. Arizona.More infoGave talk at the Stat colloquium
 Sethuraman, S. (2017, April, 3, 2017). On some problems in optimal stopping. Undergraduate Research Colloquium.
 Sethuraman, S. (2017, November). On multicolored fluctuation field scaling limits. Stochastic Analysis on Large Scale Interacting Systems (SALSIS). Tokyo University.More infoGave invited talk at annual conference of probabilists in Japan.
 Sethuraman, S. (2017, Spring 2017). Consistency of modularity clustering and the Kelvin tiling problem.. Discrete Geometry and Statistics conference, Chulalongkorn Univ., Bangkok, Jan 31 Feb 4, 2017. Chulalongkorn University, Bangkok, Thailand.More infoWe discussed the `consistency' of a statistical clustering algorithm on data given through spatial random geometric graphs. It is shown that the clustering outputs, in the limit of large data, is that of a tiling problem, similar to Lord Kelvin's problem about tiling R^d.
 Sethuraman, S. (2017, Spring 2017). Modularity clustering, random geometric graphs and Kelvin’s tiling prob lem.. Colloquium at Iowa State University April 21, 2017. Iowa State University.More infoWe discuss the concept of `consistency' of a clustering algorithm, and characterizations of outputs in terms of tiling problems when the underlying data is spatial.
 Sethuraman, S. (2016, 1/2016). Scaling limits in Stochastic Processes. CIMAT interaction workshop in Guanajuato, MX. Guanajuato, Mexico: CIMAT, MX.
 Sethuraman, S. (2016, 6/2016). On KPZBurgers equation and stochastic particle systems. Asia Pacific Rim Inst. Math. Statistics Conference. Hong Kong: City University of Hong Kong.
 Sethuraman, S. (2016, 7/2016). Consistency of Modularity clustering. Bangalore Probability Seminar, Indian Stat. Institute and Indian Inst. of Science. Bangalore: Indian Institute of Science and Indian Statistical Institute, Bangalore.
 Sethuraman, S. (2016, 7/2016). Consistency of Modularity clustering. Indian Stat. Institute, Dehli seminar. Delhi, India: Indian Statistical Institute, Delhi.
 Sethuraman, S. (2016, 8/2016). Deriving a longrange stochastic Burgers equation. Conference in honor of Prof. SRS Varadhan in Berlin. Berlin: TU Berlin.
 Sethuraman, S. (2015, December 710, 2015). On deriving stochastic Burgers equations from a class of particle systems. SIAM Analysis of PDE conference in Scottsdale, AZ.
 Sethuraman, S. (2015, March 1620, 2015). On deriving stochastic Burgers equations from microscopic interactions. AMS sectional conference in East Lansing, MI.
 Sethuraman, S. (2015, March 18, 2015). On deriving stochastic Burgers equations from microscopic interactions. Analysis seminar at U. Michigan, Ann Arbor, MI.
 Sethuraman, S. (2014, 2/10/2014). A scaling limit in preferential attachment random graphs. dynamics seminar at U. Houston. U. Houston: U. Houston.
 Sethuraman, S. (2014, 7/11/2014). A scaling limit for evolving preferential random graphs. stat/math seminar at ISI Kolkata. Kolkata, India: Indian Statistical Institute, Kolkata, India.
 Sethuraman, S. (2014, 7/15/2014). An introduction to preferential attachment schemes I, II. two seminars/mini course at IISc Bangalore on the same day. Bangalore, India: Indian Institute of Science, Bangalore, India.
 Sethuraman, S. (2014, 7/26/2014). Continuum SPDEs from microscopic systems. seminar at U. Tokyo. Tokyo, Japan: University of Tokyo, Japan.
 Sethuraman, S. (2014, 9/2014). On long range particle particle system interactions and `bulk' mass density limits. math physics seminar at U. Arizona Math Dept.. Tucson, AZ: Dept. of Mathematics, U. Arizona.