Searcharxiv⌕ Search

arXiv subjects

S. Redner

Publications and source records attributed to S. Redner.

At least 127 records · Page 7Linked to original sources
arXiv2007

A Toy Model of the Rat Race

We introduce a toy model of the "rat race" in which individuals try to better themselves relative to the rest of the population. An individual is characterized by a real-valued fitness and each advances at a constant rate by an amount that depends on its standing in the population. The leader advances to remain ahead of its nearest neighbor, while all others advance by an amount that is set by the distance to the leader. A rich dynamics occurs as a function of the mean jump size of the trailing particles. For small jumps, the leader maintains its position, while for large jumps, there are long periods of stasis that are punctuated by episodes of explosive advancement and many lead changes. Intermediate to these two regimes, agents reach a common fitness and evolution grinds to a halt.

physics.soc-ph↗
arXiv2006

Scaling in Tournaments

We study a stochastic process that mimics single-game elimination tournaments. In our model, the outcome of each match is stochastic: the weaker player wins with upset probability q<=1/2, and the stronger player wins with probability 1-q. The loser is eliminated. Extremal statistics of the initial distribution of player strengths governs the tournament outcome. For a uniform initial distribution of strengths, the rank of the winner, x_*, decays algebraically with the number of players, N, as x_* ~ N^(-beta). Different decay exponents are found analytically for sequential dynamics, beta_seq=1-2q, and parallel dynamics, beta_par=1+[ln (1-q)]/[ln 2]. The distribution of player strengths becomes self-similar in the long time limit with an algebraic tail. Our theory successfully describes statistics of the US college basketball national championship tournament.

cond-mat.stat-mech↗
arXiv2006

On the Role of Global Warming on the Statistics of Record-Breaking Temperatures

We theoretically study long-term trends in the statistics of record-breaking daily temperatures and validate these predictions using Monte Carlo simulations and data from the city of Philadelphia, for which 126 years of daily temperature data is available. Using extreme statistics, we derive the number and the magnitude of record temperature events, based on the observed Gaussian daily temperatures distribution in Philadelphia, as a function of the number of elapsed years from the start of the data. We further consider the case of global warming, where the mean temperature systematically increases with time. We argue that the current warming rate is insufficient to measurably influence the frequency of record temperature events over the time range of the observations, a conclusion that is supported by numerical simulations and the Philadelphia temperature data.

physics.data-an↗
arXiv2006

Probing Non-Integer Dimensions

We show that two-dimensional convection-diffusion problems with a radial sink or source at the origin may be recast as a pure diffusion problem in a fictitious space in which the spatial dimension is continuously-tunable with the Peclet number. This formulation allows us to probe various diffusion-controlled processes in non-integer dimensions.

physics.chem-ph↗
arXiv2006

Parity and Predictability of Competitions

We present an extensive statistical analysis of the results of all sports competitions in five major sports leagues in England and the United States. We characterize the parity among teams by the variance in the winning fraction from season-end standings data and quantify the predictability of games by the frequency of upsets from game results data. We introduce a novel mathematical model in which the underdog team wins with a fixed upset probability. This model quantitatively relates the parity among teams with the predictability of the games, and it can be used to estimate the upset frequency from standings data.

physics.soc-ph↗
arXiv2006

Social Balance on Networks: The Dynamics of Friendship and Enmity

How do social networks evolve when both friendly and unfriendly relations exist? Here we propose a simple dynamics for social networks in which the sense of a relationship can change so as to eliminate imbalanced triads--relationship triangles that contains 1 or 3 unfriendly links. In this dynamics, a friendly link changes to unfriendly or vice versa in an imbalanced triad to make the triad balanced. Such networks undergo a dynamic phase transition from a steady state to "utopia"--all friendly links--as the amount of network friendliness is changed. Basic features of the long-time dynamics and the phase transition are discussed.

physics.gen-ph↗
arXiv2006

Divergent Time Scale in Axelrod Model Dynamics

We study the evolution of the Axelrod model for cultural diversity. We consider a simple version of the model in which each individual is characterized by two features, each of which can assume q possibilities. Within a mean-field description, we find a transition at a critical value q_c between an active state of diversity and a frozen state. For q just below q_c, the density of active links between interaction partners is non-monotonic in time and the asymptotic approach to the steady state is controlled by a time scale that diverges as (q-q_c)^{-1/2}.

physics.soc-ph↗
arXiv2006

Evolutionary dynamics on degree-heterogeneous graphs

The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model (VM) dynamics) or by an individual giving birth to an offspring that takes over a random neighbor node (invasion process (IP) dynamics). The fixation probability for one species to take over a population of N individuals depends crucially on the dynamics and on the local environment. Starting with a single fitter mutant at a node of degree k, the fixation probability is proportional to k for VM dynamics and to 1/k for IP dynamics.

q-bio.PE↗
arXiv2006

Finding Scientific Gems with Google

We apply the Google PageRank algorithm to assess the relative importance of all publications in the Physical Review family of journals from 1893--2003. While the Google number and the number of citations for each publication are positively correlated, outliers from this linear relation identify some exceptional papers or "gems" that are universally familiar to physicists.

physics.data-an↗
arXiv2006

The Simplest Piston Problem I: Elastic Collisions

We study the dynamics of three elastic particles in a finite interval where two light particles are separated by a heavy ``piston''. The piston undergoes surprisingly complex motion that is oscillatory at short time scales but seemingly chaotic at longer scales. The piston also makes long-duration excursions close to the ends of the interval that stem from the breakdown of energy equipartition. Many of these dynamical features can be understood by mapping the motion of three particles on the line onto the trajectory of an elastic billiard in a highly skewed tetrahedral region. We exploit this picture to construct a qualitative random walk argument that predicts a power-law tail, with exponent -3/2, for the distribution of time intervals between successive piston crossings of the interval midpoint. These predictions are verified by numerical simulations.

cond-mat.stat-mech↗
arXiv2006

The Simplest Piston Problem II: Inelastic Collisions

We study the dynamics of three particles in a finite interval, in which two light particles are separated by a heavy ``piston'', with elastic collisions between particles but inelastic collisions between the light particles and the interval ends. A symmetry breaking occurs in which the piston migrates near one end of the interval and performs small-amplitude periodic oscillations on a logarithmic time scale. The properties of this dissipative limit cycle can be understood simply in terms of an effective restitution coefficient picture. Many dynamical features of the three-particle system closely resemble those of the many-body inelastic piston problem.

cond-mat.stat-mech↗
arXiv2005

Escape of a Uniform Random Walk from an Interval

We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the interval and the exit time from the interval exhibit anomalous properties stemming from the change in the minimum number of steps to escape the interval as a function of the starting point. As a decreases, first-passage properties approach those of continuum diffusion, but non-diffusive effects remain because of residual discreteness effects

physics.data-an↗
arXiv2005

What is the most competitive sport?

We present an extensive statistical analysis of the results of all sports competitions in five major sports leagues in England and the United States. We characterize the parity among teams by the variance in the winning fraction from season-end standings data and quantify the predictability of games by the frequency of upsets from game results data. We introduce a mathematical model in which the underdog team wins with a fixed upset probability. This model quantitatively relates the parity among teams with the predictability of the games, and it can be used to estimate the upset frequency from standings data. We propose the likelihood of upsets as a measure of competitiveness.

physics.data-an↗
arXiv2005

On The Structure of Competitive Societies

We model the dynamics of social structure by a simple interacting particle system. The social standing of an individual agent is represented by an integer-valued fitness that changes via two offsetting processes. When two agents interact one advances: the fitter with probability p and the less fit with probability 1-p. The fitness of an agent may also decline with rate r. From a scaling analysis of the underlying master equations for the fitness distribution of the population, we find four distinct social structures as a function of the governing parameters p and r. These include: (i) a static lower-class society where all agents have finite fitness; (ii) an upwardly-mobile middle-class society; (iii) a hierarchical society where a finite fraction of the population belongs to a middle class and a complementary fraction to the lower class; (iv) an egalitarian society where all agents are upwardly mobile and have nearly the same fitness. We determine the basic features of the fitness distributions in these four phases.

physics.soc-ph↗
arXiv2005

Consensus Formation in Multi-state Majority and Plurality Models

We study consensus formation in interacting systems that evolve by multi-state majority rule and by plurality rule. In an update event, a group of G agents (with G odd), each endowed with an s-state spin variable, is specified. For majority rule, all group members adopt the local majority state; for plurality rule the group adopts the local plurality state. This update is repeated until a final consensus state is generally reached. In the mean field limit, the consensus time for an N-spin system increases as ln N for both majority and plurality rule, with an amplitude that depends on s and G. For finite spatial dimensions, domains undergo diffusive coarsening in majority rule when s or G is small. For larger s and G, opinions spread ballistically from the few groups with an initial local majority. For plurality rule, there is always diffusive domain coarsening toward consensus.

cond-mat.stat-mech↗
arXiv2005

Dynamics of Social Balance on Networks

We study the evolution of social networks that contain both friendly and unfriendly pairwise links between individual nodes. The network is endowed with dynamics in which the sense of a link in an imbalanced triad--a triangular loop with 1 or 3 unfriendly links--is reversed to make the triad balanced. With this dynamics, an infinite network undergoes a dynamic phase transition from a steady state to "paradise"--all links are friendly--as the propensity p for friendly links in an update event passes through 1/2. A finite network always falls into a socially-balanced absorbing state where no imbalanced triads remain. If the additional constraint that the number of imbalanced triads in the network does not increase in an update is imposed, then the network quickly reaches a balanced final state.

cond-mat.stat-mech↗
arXiv2005

Voter Model on Heterogeneous Graphs

We study the voter dynamics model on heterogeneous graphs. We exploit the non-conservation of the magnetization to characterize how consensus is reached on networks with different connectivity patterns. For a network of N sites with an arbitrary degree distribution, we show that the mean time to reach consensus T_N scales as N mu_1^2/mu_2, where mu_k is the kth moment of the degree distribution. For a power-law degree distribution n_k k^{-nu}, we thus find that T_N scales as N for nu>3, as N/ln N for nu=3, as N^{(2nu-4)/(nu-1)} for 2<nu<3, as (ln N)^2 for nu=2, and as order one for nu<2.

cond-mat.stat-mech↗