## Breaking Down the 2015-2016 NBA Season

In this article, I will use Data Science / Machine Learning methodologies to break down the real factors separating the playoff from non-playoff teams. In particular, I used the data from Basketball-Reference.com to associate 44 predictor variables which each team: “FG” “FGA” “FG.” “X3P” “X3PA” “X3P.” “X2P” “X2PA” “X2P.” “FT” “FTA” “FT.” “ORB” “DRB” “TRB” “AST” “STL” “BLK” “TOV” “PF” “PTS” “PS.G” “oFG” “oFGA” “oFG.” “o3P” “o3PA” “o3P.” “o2P” “o2PA” “o2P.” “oFT” “oFTA” “oFT.” “oORB” “oDRB” “oTRB” “oAST” “oSTL” “oBLK” “oTOV” “oPF” “oPTS” “oPS.G”

, where a letter ‘o’ before the last 22 predictor variables indicates a defensive variable. (‘o’ stands for opponent. )

Using principal components analysis (PCA), I was able to project this 44-dimensional data set to a 5-D dimensional data set. That is, the first 5 principal components were found to explain 85% of the variance.

Here are the various biplots:

In these plots, the teams are grouped according to whether they made the playoffs or not.

One sees from this biplot of the first two principal components that the dominant component along the first PC is 3 point attempts, while the dominant component along the second PC is opponent points. CLE and TOR have a high negative score along the second PC indicating a strong **defensive** performance. Indeed, one suspects that the final separating factor that led CLE to the championship was their defensive play as opposed to 3-point shooting which all-in-all didn’t do GSW any favours. This is in line with some of my previous analyses.

## Talk today at Perimeter

I have a talk today at Perimeter Institute: here are the slides.

I basically showed that even a stochastic multiverse must be generated by precise initial conditions!

## Optimal Positions for NBA Players

I was thinking about how one can use the NBA’s new SportVU system to figure out optimal positions for players on the court. One of the interesting things about the SportVU system is that it tracks player coordinates on the court. Presumably, it also keeps track of whether or not a player located at makes a shot or misses it. Let us denote a player making a shot by , and a player missing a shot by . Then, one essentially will have data in the form .

One can then use a logistic regression to determine the probability that a player at position will make a shot:

The main idea is that the parameters uniquely characterize a given player’s probability of making a shot.

As a coaching staff from an offensive perspective, let us say we wish to position players as to say they have a very high probability of making a shot, let us say, for demonstration purposes 99%. This means we must solve the optimization problem:

(The constraints are determined here by the x-y dimensions of a standard NBA court).

This has the following solutions:

with the following conditions:

One can also have:

with the following conditions:

Another solution is:

with the following conditions:

The fourth possible solution is:

with the following conditions:

In practice, it should be noted, that it is typically unlikely to have a player that has a 99% probability of making a shot.

To put this example in more practical terms, I generated some random data (1000 points) for a player in terms of coordinates and whether he made a shot from that distance or not. The following scatter plot shows the result of this simulation:

In this plot, the red dots indicate a player has made a shot (a response of 1.0) from the coordinates given, while a purple dot indicates a player has missed a shot from the coordinates given (a response of 0.0).

Performing a logistic regression on this data, we obtain that .

Using the equations above, we see that this player has a maximum probability of of making a shot from a location of , and a minimum probability of of making a shot from a location of .

## Optimal Strategies for the Clinton/Trump Debate

Consider modelling the Clinton/Trump debate via a static game in which each candidate can choose between two strategies: , where denotes predominantly “attacking” the other candidate, while denotes predominantly discussing policy positions.

Further, let us consider the mixed strategies for Clinton, and for Trump. That is, Clinton predominantly attacks Trump with probability , and Trump predominantly attacks Clinton with probability .

Let us first deal with the general case of arbitrary payoffs, thus, generating the following payoff matrix:

That is, if Clinton attacks Trump and Trump attacks Clinton, the payoff to Clinton is , while the payoff to Trump is . If Clinton attacks Trump, and Trump ignores and discusses policy positions instead, the payoff to Clinton is , while the payoff to trump is . If Clinton discusses policy positions while Trump attacks, the payoff to Clinton is , while the payoff to Trump is , and if both candidates discuss policy positions instead of attacking each other, the payoff to them both will be and respectively.

With this information in hand, we can calculate the payoff to Clinton as:

while the payoff to Trump is:

With these payoff functions, we can compute each candidate’s **best response** to the other candidate by solving the following equations:

where indicates the best response strategy to a fixed strategy for the other player.

Solving these equations, we obtain the following:

If

then,

Clinton’s best response is to choose .

If

then,

Clinton’s best response is to choose .

Otherwise, her best response is to choose .

While for Trump, the best responses are computed as follows:

If

Trump’s best response is to choose .

If

Trump’s best response is to choose .

Otherwise, Trump’s best response is to choose .

**To demonstrate this, let us work out an example. Assume (for this example) that the payoffs for each candidate are to sway independent voters / voters that have not made up their minds. Further, let us assume that these voters are more interested in policy positions, and will take attacks negatively. Obviously, this is not necessarily true, and we have solved the general case above. We are just using the following payoff matrix for demonstration purposes:**

Using the above equations, we see that if , Clinton’s best response is to choose . While, if , Trump’s best response is to choose . That is, no matter what Trump’s strategy is, it is always Clinton’s best response to discuss policy positions. No matter what Clinton’s strategy is, it is always Trump’s best response to discuss policy positions as well. The two candidates’ payoff functions take the following form:

What this shows for example is that there is a Nash equilibrium of:

.

The expected payoffs for each candidate are evidently

.

**Let us work out an another example. This time, assume that if Clinton attacks Trump, she receives a payoff of , while if Trump attacks Clinton, he receives a payoff of . While, if Clinton discusses policy, while being attacked by Trump, she receives a payoff of , while Trump receives a payoff of . On the other hand, if Trump discusses policy while being attacked by Clinton, he receives a payoff , while Clinton receives a payoff of . If Clinton discusses policy, while Trump discusses policy, she receives a payoff of , while Trump receives a payoff of . The payoff matrix is evidently:**

In this case, if , then Clinton’s best response is to choose . While, if , then Trump’s best response is to choose . The Nash equilibrium is evidently

.

The expected payoffs for each candidate are evidently

.

In this example, even though it is the optimal strategy for each candidate to play a mixed strategy of 50% attack, 50% discuss policy, Clinton is expected to benefit, while Trump is expected to lose.

Let us also consider an example of where the audience is biased towards Trump. So, every time Trump attacks Clinton, he gains an additional point. Every time Trump discusses policy, while Clinton does the same he gains an additional point. While, if Clinton attacks while Trump discusses policy positions, she will lose a point, and he gains a point. Such a payoff matrix can be given by:

Solving the equations above, we find that if , Clinton’s best response is to choose . If , Clinton’s best response is to choose . Otherwise, her best response is to choose . On the other hand, if , Trump’s best response is to choose . While, if , Trump’s best response is to choose . Evidently, there is a single Nash equilibrium (as long as ):

.

Therefore, in this situation, it is each candidate’s best strategy to attack one another. It is interesting that even in an audience that is heavily biased towards Trump, Clinton’s best strategy is still to attack 100% of the time.

The interested reader is invited to experiment with different scenarios using the general results derived above.

## Basketball Paper Update

Everyone by now knows about this paper I wrote a few months ago: http://arxiv.org/abs/1604.05266

Using data science / machine learning methodologies, it basically showed that the most important factors in characterizing a team’s playoff eligibility are the opponent field goal percentage and the opponent points per game. This seems to suggest that defensive factors as opposed to offensive factors are the most important characteristics shared among NBA playoff teams. It was also shown that championship teams must be able to have very strong defensive characteristics, in particular, strong perimeter defense characteristics in combination with an effective half-court offense that generates high-percentage two-point shots. A key part of this offensive strategy must also be the ability to draw fouls.

Some people have commented that despite this, teams who frequently attempt three point shots still can be considered to have an efficient offense as doing so leads to better rebounding, floor spacing, and higher percentage shots. We show below that this is not true. Looking at the last 16 years of all NBA teams (using the same data we used in the paper), we performed a correlation analysis of an individual NBA team’s 3-point attempts per game and other relevant variables, and discovered:

One sees that there is very little correlation between a team’s 3-point attempts per game and 2-point percentage, free throws, free throw attempts, and offensive rebounds. In fact, at best, there is a somewhat “medium” anti-correlation between 3-point attempts per game and a team’s 2-point attempts per game.

## The Mathematics of The Triangle Offense, Continued…

In a previous post, I showed how given random positions of 5 players on the court that they could “fill” the triangle. The main geometric constraint is that 5 players can form 3 triangles on the court, and that due to spacing requirements, these triangles are “optimal” if they are equilateral triangles.

Given that we now know how to fill the triangle, the question that this post tries to address is that how can players actually move within the triangle. The key is symmetry. Players must **all** move in a way such that the equilateral triangles remain invariant. Equilateral triangles have associated with them the dihedral symmetry group. They are therefore invariant with respect to 120 degree rotations, 240 degree rotations, 0 degree rotations, and three reflections.

There are therefore six generators of this group:

In fact, the Cayley graph for this group is as follows:

For now, I will discuss how players can move within the action of 120 degree rotations. As in the previous posting, let the -coordinates of player be represented by , where . Then, under a 120 degree rotation, the player’s coordinates get shifted according to:

This is a discrete dynamical system. In fact, it can be solved explicitly. Let represent the initial coordinates of player . Then, one solves the above discrete system to obtain:

Now, we can simulate this to see actually how players move within the triangle offense, forming equilateral triangles in every sequence:

This is running in continuous time, that is, endlessly. In future postings, I will update this to include the other symmetries of the dihedral group. However, the challenge is that this symmetry group is non-Abelian, so it will be interesting to implement pairs of consecutive symmetry operations in a simulation that would still result in invariant equilateral triangles.

Hopefully, this post also shows why teams cannot really run “parts” of the triangle, as one player’s movement necessarily effects everyone else’s. This is something that Charley Rosen also mentioned in an article of his own.

## The Possible Initial States of The Universe

Most people when talking about cosmology typically talk about the universe in one context, that is, as a particular solution to the Einstein field equations. Part of my research in mathematical cosmology is to try to determine whether the present-day universe which we observe to be very close to spatially flat and homogeneous, and very close to isotropic could have emerged from a more general geometric state.

What is often not discussed adequately is the fact that not only has our universe emerged from special initial conditions, but the fact that these special initial conditions also must include the geometry of the early universe, and the type of matter in the early universe. Below, I have attached a simulation that shows how the early universe can evolve to different possible states depending on the type of physical matter parametrized by an equation of state parameter . In particular, some examples are:

- : Vacuum energy
- : Radiation
- : Stiff Fluid

**Note: Click the image below to access the simulation!**

In these simulations, we present phase plots of solutions to the Einstein field equations for spatially homogeneous and isotropic flat, hyperbolic, and closed universe geometries. The different points are:

- dS: de Sitter universe – Inflationary epoch
- M: Milne universe
- F: spatially flat FLRW universe – our present-day universe
- E: Einstein static universe

Note how by changing the value of , the dynamics lead to different possible future states. Dynamical systems people will recognize the problem at hand requires one to determine for which values of is F a saddle or stable node.