arXiv subjects

S. Redner

Publications and source records attributed to S. Redner.

At least 145 records · Page 8Linked to original sources

arXiv2005

Dynamics of Social Diversity

We introduce and solve analytically a model for the development of disparate social classes in a competitive population. Individuals advance their fitness by competing against those in lower classes, and in parallel, individuals decline due to inactivity. We find a phase transition from a homogeneous, single-class society to a hierarchical, multi-class society. In the latter case, a finite fraction of the population still belongs to the lower class, and the rest of the population is in the middle class, on top of which lies a tiny upper class. While the lower class is static and poor, the middle class is upwardly mobile.

cond-mat.stat-mech↗

arXiv2004

Excited Random Walk in One Dimension

We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no bias. For the 1-excited walk on the half-line (one cookie initially at each site), the probability of first returning to the starting point at time t scales as t^{-(2-p)}. Although the average return time to the origin is infinite for all p, the walk eats, on average, only a finite number of cookies until this first return when p<1/2. For the infinite line, the probability distribution for the 1-excited walk has an unusual anomaly at the origin. The positions of the leftmost and rightmost uneaten cookies can be accurately estimated by probabilistic arguments and their corresponding distributions have power-law singularities near the origin. The 2-excited walk on the infinite line exhibits peculiar features in the regime p>3/4, where the walk is transient, including a mean displacement that grows as t^{nu}, with nu>1/2 dependent on p, and a breakdown of scaling for the probability distribution of the walk.

math.PR↗

arXiv2004

Majority Rule Dynamics in Finite Dimensions

We investigate the long-time behavior of a majority rule opinion dynamics model in finite spatial dimensions. Each site of the system is endowed with a two-state spin variable that evolves by majority rule. In a single update event, a group of spins with a fixed (odd) size is specified and all members of the group adopt the local majority state. Repeated application of this update step leads to a coarsening mosaic of spin domains and ultimate consensus in a finite system. The approach to consensus is governed by two disparate time scales, with the longer time scale arising from realizations in which spins organize into coherent single-opinion bands. The consequences of this geometrical organization on the long-time kinetics are explored.

cond-mat.stat-mech↗

arXiv2004

Log-Networks

We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows logarithmically with network size while the network diameter equals 2. We determine basic geometrical network properties, such as the size dependence of the number of links and the in- and out-degree distributions. We also compare our predictions with real networks where the node degree also grows slowly with time -- the Internet and the citation network of all Physical Review papers.

cond-mat.stat-mech↗

arXiv2004

Statistics of Weighted Networks

We study the statistics of growing networks in which each link carries a weight (k_i k_j)^theta, where k_i and k_j are the node degrees at the endpoints of link ij. Network growth is governed by preferential attachment in which a newly-added node attaches to a node of degree k with rate A_k=k+lambda. For general values of theta and lambda, we compute the total weight of a network as a function of the number of nodes N and the distribution of link weights. Generically, the total weight grows as N for lambda>theta-1, and super-linearly otherwise. The link weight distribution is predicted to have a power law form that is modified by a logarithmic correction for the case lambda=0. We also determine the node strength, defined as the sum of the weights of the links that attach to the node, as function of k. Using known results for degree correlations, we deduce the scaling of the node strength on k and N.

cond-mat.stat-mech↗

arXiv2004

First Passage Properties of the Erdos-Renyi Random Graph

We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as all moments of this first-passage time, are insensitive to the fraction p of occupied links. This prediction qualitatively agrees with numerical simulations away from the percolation threshold. Near the percolation threshold, the statistically meaningful quantity is the mean transit rate, namely, the inverse of the first-passage time. This rate varies non-monotonically with p near the percolation transition. Much of this behavior can be understood by simple heuristic arguments.

cond-mat.stat-mech↗

arXiv2004

Citation Statistics From More Than a Century of Physical Review

We study the statistics of citations from all Physical Review journals for the 110-year period 1893 until 2003. In addition to characterizing the citation distribution and identifying publications with the highest citation impact, we investigate how citations evolve with time. There is a positive correlation between the number of citations to a paper and the average age of citations. Citations from a publication have an exponentially decaying age distribution; that is, old papers tend to not get cited. In contrast, the citations to a publication are consistent with a power-law age distribution, with an exponent close to -1 over a time range of 2 -- 20 years. We also identify a number of strongly-correlated citation bursts and other dramatic features in the time history of citations to individual publications.

physics.soc-ph↗

arXiv2004

Winning quick and dirty: the greedy random walk

As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of the walk x grows linearly in time. Asymptotically, the probability distribution of displacements is a purely exponentially decaying function of |x|/t. The probability E(t,L) for the walk to escape a bounded domain of size L at time t decays algebraically in the long time limit, E(t,L) ~ L/t^2. Consequently, the mean escape time ~ L ln L, while ~ L^{2n-1} for n>1. Corresponding results are derived when the step length after the kth return scales as k^alpha$ for alpha>0.

cond-mat.stat-mech↗

arXiv2004

Ultimate Fate of Constrained Voters

We determine the ultimate fate of individual opinions in a socially-interacting population of leftists, centrists, and rightists. In an elemental interaction between agents, a centrist and a leftist can become both centrists or both become leftists with equal rates (and similarly for a centrist and a rightist). However leftists and rightists do not interact. This interaction step between pairs of agents is applied repeatedly until the system can no longer evolve. In the mean-field limit, we determine the exact probability that the system reaches consensus (either leftist, rightist, or centrist) or a frozen mixture of leftists and rightists as a function of the initial composition of the population. We also determine the mean time until the final state is reached. Some implications of our results for the ultimate fate in a limit of the Axelrod model are discussed.

cond-mat.stat-mech↗

arXiv2004

A Billiard-Theoretic Approach to Elementary 1d Elastic Collisions

A simple relation is developed between elastic collisions of freely-moving point particles in one dimension and a corresponding billiard system. For two particles with masses m_1 and m_2 on the half-line x>0 that approach an elastic barrier at x=0, the corresponding billiard system is an infinite wedge. The collision history of the two particles can be easily inferred from the corresponding billiard trajectory. This connection nicely explains the classic demonstrations of the ``dime on the superball'' and the ``baseball on the basketball'' that are a staple in elementary physics courses. It is also shown that three elastic particles on an infinite line and three particles on a finite ring correspond, respectively, to the motion of a billiard ball in an infinite wedge and on on a triangular billiard table. It is shown how to determine the angles of these two sets in terms of the particle masses.

physics.ed-ph↗

arXiv2004

A Tractable Complex Network Model based on the Stochastic Mean-field Model of Distance

Much recent research activity has been devoted to empirical study and theoretical models of complex networks (random graphs) with three qualitative features: power-law degree distribution, local clustering of edges, and small diameter. We point out a new (in this context) platform for such models -- the stochastic mean-field model of distance -- and within this platform study a simple two-parameter proportional attachment model. The model is mathematicallly natural, permits a wide variety of explicit calculations, has the desired three qualitative features, and fits the complete range of degree scaling exponents and clustering parameters; in these respects it compares favorably to existing models.

cond-mat.dis-nn↗

arXiv2004

Dynamics of an Unbounded Interface Between Ordered Phases

We investigate the evolution of a single unbounded interface between ordered phases in two-dimensional Ising ferromagnets that are endowed with single-spin-flip zero-temperature Glauber dynamics. We examine specifically the cases where the interface initially has either one or two corners. In both examples, the interface evolves to a limiting self-similar form. We apply the continuum time-dependent Ginzburg-Landau equation and a microscopic approach to calculate the interface shape. For the single corner system, we also discuss a correspondence between the interface and the Young tableau that represents the partition of the integers.

cond-mat.stat-mech↗

arXiv2003

Random Walk with Shrinking Steps

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N), approaches a limiting distribution P_{lambda}(x) that has many beautiful features. For lambda<1/2, the support of P_{lambda}(x) is a Cantor set. For 1/2<=lambda<1, there is a countably infinite set of lambda values for which P_{lambda}(x) is singular, while P_{lambda}(x) is smooth for almost all other lambda values. In the most interesting case of lambda=(sqrt{5}-1)/2=g, P_g(x) is riddled with singularities and is strikingly self-similar. The self-similarity is exploited to derive a simple form for the probability measure M(a,b)= int_a^b P_g(x) dx.

physics.ed-ph↗

arXiv2003

Majority versus minority dynamics: Phase transition in an interacting two-state spin system

We introduce a simple model of opinion dynamics in which binary-state agents evolve due to the influence of agents in a local neighborhood. In a single update step, a fixed-size group is defined and all agents in the group adopt the state of the local majority with probability p or that of the local minority with probability 1-p. For group size G=3, there is a phase transition at p_c=2/3 in all spatial dimensions. For p>p_c, the global majority quickly predominates, while for p<p_c, the system is driven to a mixed state in which the densities of agents in each state are equal. For p=p_c, the average magnetization (the difference in the density of agents in the two states) is conserved and the system obeys classical voter model dynamics. In one dimension and within a Kirkwood decoupling scheme, the final magnetization in a finite-length system has a non-trivial dependence on the initial magnetization for all p.ne.p_c, in agreement with numerical results. At p_c, the exact 2-spin correlation functions decay algebraically toward the value 1 and the system coarsens as in the classical voter model.

cond-mat.stat-mech↗

arXiv2003

Dynamics of Majority Rule

We introduce a 2-state opinion dynamics model where agents evolve by majority rule. In each update, a group of agents is specified whose members then all adopt the local majority state. In the mean-field limit, where a group consists of randomly-selected agents, consensus is reached in a time that scales ln N, where N is the number of agents. On finite-dimensional lattices, where a group is a contiguous cluster, the consensus time fluctuates strongly between realizations and grows as a dimension-dependent power of N. The upper critical dimension appears to be larger than 4. The final opinion always equals that of the initial majority except in one dimension.

cond-mat.stat-mech↗

arXiv2003

Kinetic Anomalies in Addition-Aggregation Processes

We investigate irreversible aggregation in which monomer-monomer, monomer-cluster, and cluster-cluster reactions occur with constant but distinct rates K_{MM}, K_{MC}, and K_{CC}, respectively. The dynamics crucially depends on the ratio gamma=K_{CC}/K_{MC} and secondarily on epsilon=K_{MM}/K_{MC}. For epsilon=0 and gamma<2, there is conventional scaling in the long-time limit, with a single mass scale that grows linearly in time. For gamma >= 2, there is unusual behavior in which the concentration of clusters of mass k, c_k decays as a stretched exponential in time within a boundary layer k k*. When epsilon>0, analogous behaviors emerge for gamma<2 and gamma >= 2.

cond-mat.stat-mech↗

arXiv2002

Bifurcations and Patterns in Compromise Processes

We study an opinion dynamics model in which agents reach compromise via pairwise interactions. When the opinions of two agents are sufficiently close, they both acquire the average of their initial opinions; otherwise, they do not interact. Generically, the system reaches a steady state with a finite number of isolated, noninteracting opinion clusters (``parties''). As the initial opinion range increases, the number of such parties undergoes a periodic sequence of bifurcations. Both major and minor parties emerge, and these are organized in alternating pattern. This behavior is illuminated by considering discrete opinion states.

cond-mat.stat-mech↗

arXiv2002

Freezing and Slow Evolution in a Constrained Opinion Dynamics Model

We study opinion formation in a population that consists of leftists, centrists, and rightist. In an interaction between neighboring agents, a centrist and a leftist can become both centrists or leftists (and similarly for a centrist and a rightist). In contrast, leftists and rightists do not affect each other. The initial density of centrists rho_0 controls the evolution. With probability rho_0 the system reaches a centrist consensus, while with probability 1-rho_0 a frozen population of leftists and rightists results. In one dimension, we determine this frozen state and the opinion dynamics by mapping the system onto a spin-1 Ising model with zero-temperature Glauber kinetics. In the frozen state, the length distribution of single-opinion domains has an algebraic small-size tail x^{-2(1-psi)} and the average domain size grows as L^{2*psi}, where L is the system length. The approach to this frozen state is governed by a t^{-psi} long-time tail with psi-->2*rho_0/pi as rho_0-->0.

cond-mat.stat-mech↗